Orthogonal arrays of strength 3 with full estimation capacities Eric D. Schoen; Man V.M. Nguyen.

Slides:



Advertisements
Similar presentations
2.3 Modeling Real World Data with Matrices
Advertisements

1 STA 536 – Nonregular Designs: Construction and Properties Chapter 8: Non-regular Designs: Construction and Properties regular designs: 2 kp and 3 kp.
Ordinary Least-Squares
Sampling plans for linear regression
3.3 Hypothesis Testing in Multiple Linear Regression
Plackett-Burman Design of Experiments 1. Statistics developed in the early 20 th century 2. Tool to help improve yields in farming 3. Many types of experiments/techniques.
Matrices A matrix is a rectangular array of quantities (numbers, expressions or function), arranged in m rows and n columns x 3y.
ORTHOGONAL ARRAYS APPLICATION TO PSEUDORANDOM NUMBERS GENERATION AND OPTIMIZATION PROBLEMS A.G.Chefranov †‡, T.A.Mazurova ‡, I.D.Sidorov ‡, T.S.Letia 
Fractional Factorial Designs of Experiments
Silberschatz, Galvin and Gagne  2002 Modified for CSCI 399, Royden, Operating System Concepts Operating Systems Lecture 19 Scheduling IV.
Abhishek K. Shrivastava September 25 th, 2009 Listing Unique Fractional Factorial Designs – I.
11.1 Introduction to Response Surface Methodology
Chapter 6 Information Theory
Maths for Computer Graphics
Optimizing General Compiler Optimization M. Haneda, P.M.W. Knijnenburg, and H.A.G. Wijshoff.
Deterministic Length Reduction: Fast Convolution in Sparse Data and Applications Written by: Amihood Amir, Oren Kapah and Ely Porat.
Selection of Optimal DNA Oligos for Gene Expression Arrays Reporter : Wei-Ting Liu Date : Nov
Machine Learning CMPT 726 Simon Fraser University
Independent Component Analysis (ICA) and Factor Analysis (FA)
MAE 552 Heuristic Optimization Instructor: John Eddy Lecture #16 3/1/02 Taguchi’s Orthogonal Arrays.
Chapter 28 Design of Experiments (DOE). Objectives Define basic design of experiments (DOE) terminology. Apply DOE principles. Plan, organize, and evaluate.
Clustering In Large Graphs And Matrices Petros Drineas, Alan Frieze, Ravi Kannan, Santosh Vempala, V. Vinay Presented by Eric Anderson.
Basic Mathematics for Portfolio Management. Statistics Variables x, y, z Constants a, b Observations {x n, y n |n=1,…N} Mean.
Ger man Aerospace Center Gothenburg, April, 2007 Coding Schemes for Crisscross Error Patterns Simon Plass, Gerd Richter, and A.J. Han Vinck.
Linear regression models in matrix terms. The regression function in matrix terms.
Matrix Approach to Simple Linear Regression KNNL – Chapter 5.
Arithmetic Operations on Matrices. 1. Definition of Matrix 2. Column, Row and Square Matrix 3. Addition and Subtraction of Matrices 4. Multiplying Row.
CE 311 K - Introduction to Computer Methods Daene C. McKinney
Today Wrap up of probability Vectors, Matrices. Calculus
Case Study. DNA Deoxyribonucleic acid (DNA) is a nucleic acid that contains the genetic instructions used in the development and functioning of all known.
Chapter 6: The Traditional Approach to Requirements
Process Flowsheet Generation & Design Through a Group Contribution Approach Lo ï c d ’ Anterroches CAPEC Friday Morning Seminar, Spring 2005.
 Combines linear regression and ANOVA  Can be used to compare g treatments, after controlling for quantitative factor believed to be related to response.
Chapter 4 Fractional factorial Experiments at two levels
Engineering Statistics ENGR 592 Prepared by: Mariam El-Maghraby Date: 26/05/04 Design of Experiments Plackett-Burman Box-Behnken.
Gu Yuxian Wang Weinan Beijing National Day School.
1 Chapter 7 Linear Programming. 2 Linear Programming (LP) Problems Both objective function and constraints are linear. Solutions are highly structured.
Motif finding with Gibbs sampling CS 466 Saurabh Sinha.
1 The General 2 k-p Fractional Factorial Design 2 k-1 = one-half fraction, 2 k-2 = one-quarter fraction, 2 k-3 = one-eighth fraction, …, 2 k-p = 1/ 2 p.
Accuracy Based Generation of Thermodynamic Properties for Light Water in RELAP5-3D 2010 IRUG Meeting Cliff Davis.
Matrix Multiplication Rank and Dependency n Columns of a matrix: n Matrix A:
Introduction to Matrices and Matrix Approach to Simple Linear Regression.
DEMA, August 12, A design problem 18 runs Five factors.
Algorithms 2005 Ramesh Hariharan. Algebraic Methods.
Experimental Algorithmics Reading Group, UBC, CS Presented paper: Fine-tuning of Algorithms Using Fractional Experimental Designs and Local Search by Belarmino.
Direct Methods for Sparse Linear Systems Lecture 4 Alessandra Nardi Thanks to Prof. Jacob White, Suvranu De, Deepak Ramaswamy, Michal Rewienski, and Karen.
Journal Club Journal of Chemometrics May 2010 August 23, 2010.
July 9-13, 2006 Nankai University Design of Experiments Conference Combining Combinatorics and D-optimal Designs Dean Sterling Hoskins Arizona State University.
Designing Factorial Experiments with Binary Response Tel-Aviv University Faculty of Exact Sciences Department of Statistics and Operations Research Hovav.
5.2 Polynomials, Linear Factors, and Zeros
Copyright © 2005, SAS Institute Inc. All rights reserved. Statistical Discovery. TM From SAS. 1 Minimum Potential Energy Designs Bradley Jones & Christopher.
Stats & Summary. The Woodbury Theorem where the inverses.
Matrix Multiplication The Introduction. Look at the matrix sizes.
Instructional Design Document Simplex Method - Optimization STAM Interactive Solutions.
DATA ANALYSIS AND MODEL BUILDING LECTURE 9 Prof. Roland Craigwell Department of Economics University of the West Indies Cave Hill Campus and Rebecca Gookool.
1 Introduce to the Count Function and Its Applications Chang-Yun Lin Institute of Statistics, NCHU.
Estimation Econometría. ADE.. Estimation We assume we have a sample of size T of: – The dependent variable (y) – The explanatory variables (x 1,x 2, x.
Matrices. Variety of engineering problems lead to the need to solve systems of linear equations matrixcolumn vectors.
Optimal Sequence Allocation and Multi-rate CDMA Systems Krishna Kiran Mukkavilli, Sridhar Rajagopal, Tarik Muharemovic, Vikram Kanodia.
© 207 M. Tallman. © 2007 M. Tallman Array- objects or symbols displayed in rows and columns. 3 Rows 4 Columns of 4 of 3.
Software Design.
12-1 Organizing Data Using Matrices
Optimal Sequence Allocation and Multi-rate CDMA Systems
11-1: Area of Rectangles and Squares
Matrices Definition: A matrix is a rectangular array of numbers or symbolic elements In many applications, the rows of a matrix will represent individuals.
Unfolding Problem: A Machine Learning Approach
Mohr Separations Research, Inc.
Linear Regression and Correlation
Linear Regression and Correlation
Unfolding with system identification
Presentation transcript:

Orthogonal arrays of strength 3 with full estimation capacities Eric D. Schoen; Man V.M. Nguyen

FullEC OA with strength 3 2Nankai University, July Outline Motivating example Motivating example Strength or efficiency? Strength or efficiency? Selection of arrays Selection of arrays Details of best arrays Details of best arrays

FullEC OA with strength 3 3Nankai University, July Example from wood technology Response: strength of wood-glue-wood bond Response: strength of wood-glue-wood bond Factors: Factors: glue (4 levels) glue (4 levels) wood (3 levels) wood (3 levels) moisture content, pretreatment, pressure, storage temperature (2 levels) moisture content, pretreatment, pressure, storage temperature (2 levels) About 50 runs About 50 runs

FullEC OA with strength 3 4Nankai University, July Full Estimation Capacity Most of the factors will be active. Most of the factors will be active. Many active interactions. Many active interactions. Design should permit estimation of all main effects (me) and all 2-factor interactions (2fi). Design should permit estimation of all main effects (me) and all 2-factor interactions (2fi). Parameters in wood technology example: Parameters in wood technology example:  1 intercept  9 me  32 2fi

FullEC OA with strength 3 5Nankai University, July Design options Choose orthogonal array (OA) of maximum strength compatible with run-size & factor specifications. Choose orthogonal array (OA) of maximum strength compatible with run-size & factor specifications. Choose array that maximizes D-efficiency for the p parameters of the full model. Choose array that maximizes D-efficiency for the p parameters of the full model.

FullEC OA with strength 3 6Nankai University, July Orthogonal arrays Example: OA(4, 2 3, 2). Example: OA(4, 2 3, 2). Symbols arranged in N rows and n columns. Symbols arranged in N rows and n columns. Rows: runs of a design. Rows: runs of a design. Columns: factors of a design. Columns: factors of a design. Strength t : each t-tuple of symbols occurs equally often. Strength t : each t-tuple of symbols occurs equally often

FullEC OA with strength 3 7Nankai University, July Properties for strength t = 2, 3, 4 t = 2: orthogonality among main effects. t = 2: orthogonality among main effects. t = 3: additional orthogonality me  2fi. t = 3: additional orthogonality me  2fi. t = 4: additional orthogonality among 2fi. t = 4: additional orthogonality among 2fi. In example: run sizes multiple of 24, 48, 96 for strength t = 2, 3, 4. In example: run sizes multiple of 24, 48, 96 for strength t = 2, 3, 4. Find 48-run array of strength 3 and FullEC. Find 48-run array of strength 3 and FullEC.

FullEC OA with strength 3 8Nankai University, July Optimization of D-efficiency X 1 : matrix with intercept + me ( length  N ) X 1 : matrix with intercept + me ( length  N ) X 2 : matrix with 2fi ( length  N ) X 2 : matrix with 2fi ( length  N ) X = [X 1 X 2 ] X = [X 1 X 2 ] D = |X’X| 1/p /N D = |X’X| 1/p /N 0  D  1 0  D  1 Maximum D minimizes volume of confidence region. Maximum D minimizes volume of confidence region.

FullEC OA with strength 3 9Nankai University, July Efficiency of me estimation Primary goal: efficient estimation of main effects to separate active from inactive me. Primary goal: efficient estimation of main effects to separate active from inactive me. D 1 = |X 1 ’(I - X 2 (X 2 ’X 2 ) -1 X 2 ’)X 1 | 1/p1 /N D 1 = |X 1 ’(I - X 2 (X 2 ’X 2 ) -1 X 2 ’)X 1 | 1/p1 /N residual sum of squares and products after projecting X 1 on X 2 residual sum of squares and products after projecting X 1 on X 2 Orthogonal arrays of strength 3 have D 1 = 1. Orthogonal arrays of strength 3 have D 1 = 1.

FullEC OA with strength 3 10Nankai University, July Efficiency of 2fi estimation Primary goal: distinguishing among 2fi. Primary goal: distinguishing among 2fi. D 2 = |X 2 ’(I - X 1 (X 1 ’X 1 ) -1 X 1 ’)X 2 | 1/p2 /N D 2 = |X 2 ’(I - X 1 (X 1 ’X 1 ) -1 X 1 ’)X 2 | 1/p2 /N |X’X|= (N D 2 ) p2.|X 1 ’X 1 | |X’X|= (N D 2 ) p2.|X 1 ’X 1 | If an array has higher |X’X| than has a strength-3 array, it must have higher D 2 - efficiency too. If an array has higher |X’X| than has a strength-3 array, it must have higher D 2 - efficiency too.

FullEC OA with strength 3 11Nankai University, July Selection of arrays Strength is best Generate all non- isomorphic (48; 4 x 3 x 2 4 ; 3): 19 arrays. Generate all non- isomorphic OA(48; 4 x 3 x 2 4 ; 3): 19 arrays. Select FullEC arrays: 14 arrays. Select FullEC arrays: 14 arrays. Select array with maximum D 2 : 1 array. Select array with maximum D 2 : 1 array. D-efficiency is best Generate 50 random arrays. Improve D-efficiency with modified Fedorov algorithm. Keep the best array.

FullEC OA with strength 3 12Nankai University, July Details of best arrays strength D1D1D1D1 D2D2D2D

FullEC OA with strength 3 13Nankai University, July Some other 48-run cases 6 x 2 5 t=3: 30 non-isomorphic arrays. t=3: 30 non-isomorphic arrays. No FulEC array. No FulEC array. Best D 2 -efficiency Best D 2 -efficiency Strength 0. Strength 0. D 1 -efficiency D 1 -efficiency x 2 7 t=3: 3056 ni arrays. 209 FulEC array. Best D 2 given t=3: Best D 2 -efficiency Strength 0. D 1 -efficiency 0.71.

FullEC OA with strength 3 14Nankai University, July Conclusion Separation of main effects & 2fi? Use FullEC array of strength 3. Use FullEC array of strength 3. Choose array with highest D 2 -efficiency. Choose array with highest D 2 -efficiency. Activity of 2fi? Use FullEC array with optimum D 2 -efficiency. Use FullEC array with optimum D 2 -efficiency.

FullEC OA with strength 3 15Nankai University, July Contact information (see also abstract) (see also abstract)