國立臺北大學統計學系

專題演講

 

講題：Optimal Sequence Identification in Order-of-Addition Experiments Using Complete Consecutive Order Pairing (CCOP) Designs

主講人：潘建興 教授 (中央研究院 統計科學所)

時間：115年05月06日 (星期三，13：10~15：00)

地點：三峽校區商學院3F13教室

Abstract

Order-of-addition (OofA) experiments investigate how the sequence in which components are introduced affects the experimental response, and they have attracted considerable attention in the experimental design literature over the past decade. Recently, a new class of designs, known as Complete Consecutive Order Pairing (CCOP) designs, together with their associated analysis methods, has been proposed to provide a cost-efficient framework for conducting OofA experiments and identifying optimal input sequences when components may have multiple levels. These designs substantially reduce experimental cost while retaining strong inferential efficiency. In this talk, we first review the fundamental principles and advantages of this cost-efficient experimental approach. Two real-world examples are then presented to illustrate how CCOP designs can be applied to identify optimal sequences of practical interest. Finally, we discuss recent extensions of the CCOP framework that broaden its applicability to more complex experimental settings.

~歡迎參加~

國立臺北大學統計學系  敬邀

115.04.29

附件：演講摘要