A general intuitive design pattern for optimally sequencing treatment combinations in 2k factorial experiment and a simple estimation algorithm. (July 2015)
- Record Type:
- Journal Article
- Title:
- A general intuitive design pattern for optimally sequencing treatment combinations in 2k factorial experiment and a simple estimation algorithm. (July 2015)
- Main Title:
- A general intuitive design pattern for optimally sequencing treatment combinations in 2k factorial experiment and a simple estimation algorithm
- Authors:
- Tsao, H.-S. Jacob
Patel, Minnie H. - Abstract:
- Highlights: Minimize number of treatment combinations for 2 k . Sequence interactions or their blocks in descending order based on domain knowledge. Propose a design pattern to generate a corresponding treatment-combination sequence. Provide recursive algorithms for parameter estimation and design-matrix inversion. Abstract: The number of model parameters of a 2 k factorial design grows exponentially. When the number of factors is large, numerous higher-order interactions constitute a vast majority of the model parameters while many of them do not exist or are insignificant. The classic methods of fractional factorial designs, Plackett–Burman designs, Taguchi designs, etc. seek an already developed and often cataloged design that fits exactly the problem being tackled or select a design that fits it the most. Most, if not all, of these designs were developed in absence of convenient computation tools and enjoy computational simplicity. The necessary number of treatment combinations for unbiased estimation of significant parameters is often exceeded; undesirable confounding, i.e., biased estimation, is difficult to avoid. An opposite approach is to determine, for any set of model parameters considered as significant, a corresponding set of equal (and minimum) number of treatment combinations for unbiased parameter estimation. A companion feature of that approach is active avoidance of confounding. In addition, if the experimenter, particularly when unsure of the "borderline"Highlights: Minimize number of treatment combinations for 2 k . Sequence interactions or their blocks in descending order based on domain knowledge. Propose a design pattern to generate a corresponding treatment-combination sequence. Provide recursive algorithms for parameter estimation and design-matrix inversion. Abstract: The number of model parameters of a 2 k factorial design grows exponentially. When the number of factors is large, numerous higher-order interactions constitute a vast majority of the model parameters while many of them do not exist or are insignificant. The classic methods of fractional factorial designs, Plackett–Burman designs, Taguchi designs, etc. seek an already developed and often cataloged design that fits exactly the problem being tackled or select a design that fits it the most. Most, if not all, of these designs were developed in absence of convenient computation tools and enjoy computational simplicity. The necessary number of treatment combinations for unbiased estimation of significant parameters is often exceeded; undesirable confounding, i.e., biased estimation, is difficult to avoid. An opposite approach is to determine, for any set of model parameters considered as significant, a corresponding set of equal (and minimum) number of treatment combinations for unbiased parameter estimation. A companion feature of that approach is active avoidance of confounding. In addition, if the experimenter, particularly when unsure of the "borderline" significance of some parameters, can attempt to sequence model parameters in non-increasing order of magnitude (based on prior knowledge or subjective judgment), a corresponding sequence of treatment combinations can be numerically determined (with one treatment combination added for each additional possibly significant model parameter). Recently, a simple design pattern was proposed with which such a sequence of treatment combinations can be intuitively and easily obtained, without numerical computation. However, that pattern requires for the estimability of an interaction that all main effects and all lower-order interactions among all factors involved in the experiment have been estimated. For example, the interaction AB may not be estimable without main effect C having been estimated first. This paper relaxes that requirement and extends the use condition of the proposed approach to virtually all practical situations and presents a simple algorithm to estimate model parameters recursively. As sequential experimentation progresses, no experiments already conducted could be considered unnecessary for unbiased estimation of significant parameters, and hence "forward compatibility" in minimizing the number of treatment combinations is achieved. Therefore, such optimality may be referred to as FC -optimality or, more intuitively, as optimality of 'one more treatment combination for one more parameter' and '1-1-Optimality' for short. … (more)
- Is Part Of:
- Computers & industrial engineering. Volume 85(2015)
- Journal:
- Computers & industrial engineering
- Issue:
- Volume 85(2015)
- Issue Display:
- Volume 85, Issue 2015 (2015)
- Year:
- 2015
- Volume:
- 85
- Issue:
- 2015
- Issue Sort Value:
- 2015-0085-2015-0000
- Page Start:
- 423
- Page End:
- 436
- Publication Date:
- 2015-07
- Subjects:
- Design of experiment -- Two-level factorial design -- Fractional factorial design -- Run minimization -- Parameter estimability -- Sequential design
Engineering -- Data processing -- Periodicals
Industrial engineering -- Periodicals
620.00285 - Journal URLs:
- http://www.sciencedirect.com/science/journal/03608352 ↗
http://www.elsevier.com/journals ↗ - DOI:
- 10.1016/j.cie.2015.04.001 ↗
- Languages:
- English
- ISSNs:
- 0360-8352
- Deposit Type:
- Legaldeposit
- View Content:
- Available online (eLD content is only available in our Reading Rooms) ↗
- Physical Locations:
- British Library DSC - 3394.713000
British Library DSC - BLDSS-3PM
British Library HMNTS - ELD Digital store - Ingest File:
- 6992.xml