Webinar Experimental Designs for CBC
|
|
- Gwendolyn Parker
- 5 years ago
- Views:
Transcription
1 Experimental Designs for CBC
2 2 Outline Background designs for linear models CBC design strategies Based on orthogonal arrays Using efficiency calculations Sawtooth Software s multi-objective optimization
3 3 BACKGROUND
4 4 Why care? In the absence of an experimental design bad and terrible things can happen: Terrible: Some of your model coefficients (utilities) may not be possible to estimate, your research becomes a crash-and-burn disaster, dollars and careers can go up in flames Bad: your utility estimates lose precision If you don t get precision through your experimental design, you have to buy it with sample size Savings in $,,,, Rs are good reasons to like precision
5 5 Attributes and Levels Attributes are the characteristics of products and levels are the discrete values those characteristics may take on Attribute (levels): Brand (Pepsi, Coke, Dr. Pepper) Capacity (16GB, 32GB, 64GB) Price ($90, $125, $159) Flame-retardant fabric (yes, no)
6 6 Design for Linear Models Orthogonal designs Full factorial designs Show every possible combination of predictors An experiment with three 4 level factors and two 5 level factors (4 3 x 5 2 ) would need observations for 4 x 4 x 4 x 5 x 5 = 1,600 combinations Fractional factorial plans require fewer observations They assume no or very few interactions When they measure main effects only, we call them orthogonal main effects plans (OMEPs) An OMEP for the (4 3 x 5 2 ) design above uses just 25 combinations or runs
7 7 Example Design 3 4 OMEP Run X1 X2 X3 X
8 8 Properties of Example Orthogonality - each level occurs with levels from each other attribute a proportional number of times Correlation matrix: X1 1 X1 X2 X3 X4 X2 0 1 X X Two-way frequencies: X2 X
9 9 Sources of Orthogonal Fractional Designs Addelman (1962) OMEP catalog Designs account for main effects (of individual attributes) not interactions Until 1994, the marketing researcher s bible for creating experimental designs Hahn and Shapiro (1966) designs allowed some interactions Kuhfeld s SAS Technical Report Orthogonal Arrays offers an extensive collection plus links to other design databases
10 10 Using Orthogonal Arrays Traditional conjoint analysis used fractional factorial experimental designs to create a set of stimuli (concepts, profiles, cards) Respondents evaluated these stimuli via ratings or rankings Regression analysis decomposed the evaluations into utilities for each level of each attribute in the study We can also use fractional factorials in Menu-based choice experiments Situational choice experiments Choice-based conjoint (CBC) experiments
11 11 CBC DESIGNS FROM ORTHOGONAL PLANS
12 12 Designs Based on Orthogonal Plans Adapting fractional factorial designs for CBC experiments Louviere and Woodworth J designs 4 more early strategies (Louviere, Hensher and Swait, 2000) Mix and match 1 Mix and match 2 Labeled mix and match L MN Simple shifting (Bunch, Louviere and Anderson 1996) Flexible shifting (Street and Burgess 2007, Street, Burgess and Louviere 2005)
13 13 2 J Designs 1. Use a fractional factorial design to create profiles 2. Use a second fractional factorial design to decide which profiles to assign to particular choice sets (levels are absent and present 3. Hadamard matrices or balanced incomplete block designs can be used for step 2 as well
14 14 Pros and Cons Pros Conceptually and mechanically simple Cons Designs can get very large Different choice sets can have different numbers of profiles
15 15 Mix and Match 1 Algorithm 1. Generate a fractional factorial plan 2. Make some number of k exact copies of this fraction 3. From each of the k+1 equivalent fractions Randomly select one profile without replacement This set of K+1 profiles is choice set 1 Prevent duplicates within a set 4. Repeat step 3 until all profiles are assigned to choice sets This strategy produces an experiment where all choice sets have k+1 profiles
16 16 Example of Mix and Match 1 The same 9 profiles appear in both the first and second alternative Alternative A Alternative B Set X1 X2 X3 X4 X1 X2 X3 X
17 17 Mix and Match 2 Algorithm 1. Generate a fractional factorial plan 2. Make some number of k equivalent (not exact) copies of this fraction* 3. From each of the k+1 equivalent fractions Randomly select one profile without replacement This set of K+1 profiles is choice set 1 4. Repeat step 3 until all profiles are assigned to choice sets This strategy covers more of the design space than Mix and Match 1 *You can do this simply by switching columns, relabeling levels (1 2, 2 3 and 3 1) or both.
18 18 Example of Mix and Match 2 In this experiment unique profiles appear in the two alternatives and we cover twice as many possible profiles Alternative A Alternative B Set X1 X2 X3 X4 X1 X2 X3 X
19 19 Versions We could create multiple versions of a mix and match design One could be the design on the previous slide One could be the previous design where columns 1&2 and 3&4 are swapped in the left hand profile One could swap codes 3 and 2 in the even numbered columns of the right hand profile and 1 and 2 in the odd columns of the right hand profile We could make several other versions in a similar way, swapping columns and/or recoding levels Then we could randomly assign different respondents to different versions When we do this we explore more of the design space We also allow estimation of some interactions
20 20 Alternative-Specific Designs A trick called labeling allows us to make alternative-specific designs In each choice set, label the profile chosen from the first of the K+1 designs with the first brand name Label the profile chosen from the second design with the second brand name Etc. Benefits Brand is now an attribute in your experiment that you didn t have to build into the fractional factorial experiment In analysis, you can have brand-specific effects of price and all other attributes In other words you can estimate interactions of brand with all other attributes
21 21 Example of Alternative-Specific Design Just label the sets of alternatives with brand names Bose JBL Set X1 X2 X3 X4 X1 X2 X3 X
22 22 L MN Designs If we have L levels per attribute, M alternatives in our choice sets and N attributes, build the design from a fractional factorial with M*N columns For example, if we have 4 alternatives with 3 attributes of 3 levels each we need a design with 12 columns worth of 3 level attributes a 27 row design from the Addelman catalog would work In this design variables are independent both within and across profiles This feature allows measurement of cross-effects
23 23 A 3 3*2 Design 3 alternatives, 2 attributes of 3 levels each - this design uses an 18 run fractional factorial design with 7 columns of 3-level variables we use two per alternative, with one unused column Note we have an unused column. We need not use every column of a design. We may also use it for other purposes, like creating blocks of questions so that no respondent has to answer all 18. Set A1 A2 B1 B2 C1 C2 Unused
24 24 Shifting Designs 1. Generate a fractional factorial plan 2. Results of this plan are the first profile of each choice set 3. Second profile is just the first with all attributes shifted 1 becomes 2, 2 becomes 3 so on, with wraparound (highest level becomes 1 again) Example: Six 3-level attributes If first profile is Second profile is and third is
25 25 Shifting Design Example Starting with a 3 4 fractional factorial we create additional alternatives through shifting Note there is no level overlap Note that a 4 th profile would duplicate the first Alternative A Alternative B Alternative C Set X1 X2 X3 X4 X1 X2 X3 X4 X1 X2 X3 X
26 26 Flexible Shifting Designs We could choose to shift different columns of the initial matrix differently For example, we could shift the 1 st and 3 rd columns by one place and the 2 nd and 4 th by 2 places Street and Burgess (2007) call this pattern of shifts, 1212, a generator They show how to use generators to create a variety of designs for main effects and interactions Like simpler shifting designs, these will not work for alternative-specific effects
27 27 Flexible Shifting Example This design uses a 1212 generator Alternative A Alternative B Alternative C Set X1 X2 X3 X4 X1 X2 X3 X4 X1 X2 X3 X
28 28 Comparison of Orthogonal Designs For generic main effects models, shifting and modified shifting give more efficient designs than do mix and match designs Mix and match designs with enough versions allow estimation of interactions For models with alternative-specific effects, use Mix and Match 2 or and L MN designs For models with cross-effects, use L MN designs Avoid shifting if you want to estimate interactions or alternative-specific effects Shifting designs cause minimal overlap
29 29 Pros and Cons of Using Orthogonal Plans Recipe-based design algorithms easy enough that you can create designs by hand or using simple Excel workbooks While the columns of a fractional factorial are orthogonal with respect to one another, they may be perfectly correlated with un-modeled interactions Focus on orthogonality can detract from efficiency Prohibitions must be added manually and there is no good way to do this
30 30 EFFICIENT DESIGNS
31 31 Designs Based on Efficiency We can calculate D-efficiency of a design mathematically Rather than retrofitting orthogonal designs to create our CBC designs, we could search for groups of choice sets that constitute efficient designs Computer search algorithms can assist this process The covariance matrix itself depends on the model we plan to run, so different models require different efficiency calculations
32 32 D-Efficiency for MNL Models Kuhfeld, Tobias and Garratt (1994) show how to use search algorithms to make efficient designs for MNL models Generate many sets of profiles with the right number of attributes and levels and let a search algorithm identify the most efficient way to combine them SAS macros MKTEX and CHOICEFF work together to create a wide range of CBC experimental designs (Kuhfeld and Wurst 2012)
33 33 Further Improvements for MNL Models You can further improve designs with iterative refinements (Huber and Zwerina 1996) called relabeling and swapping If you have reasonably good estimates of respondents utilities, you can do better still (Sandor and Wedel 2001) These are sometimes called D p -efficient designs because we have a guess about their parameters They are distinguished from D 0 -efficient designs that assume null parameters
34 34 Other Model Specifications Efficient designs for mixed logit models (Sandor and Wedel 2002) Efficient designs for hierarchical Bayesian models (Sandor and Wedel 2005) Efficient designs for two-stage models with a noncompensatory first stage (Liu and Arora 2011) Efficient designs for repeated measures logit models (Bliemer and Rose 2010)
35 35 Pros and Cons of Efficiency-Based Designs Relatively easy to implement the basic D 0 -efficient MNL model (using off-the-shelf software) Complexity grows rapidly for different models and requires Extreme programming skills and/or Specialized software and/or Prior estimates of utilities
36 36 Orthogonal versus Efficiency-Based Designs Efficiency based designs are more flexible than orthogonal designs (e.g. prohibitions are easier to accommodate) Efficiency-based designs by their nature will be a little more efficient than orthogonal designs - a lot more efficient according to Bliemer and Rose (2010) The differences may not matter much in practice A lot of sniping and grousing happens anyway
37 37 LIGHTHOUSE STUDIO DESIGNS
38 38 Sources of CBC Efficiency These properties promote efficiency (One-way) Level Balance: within each attribute, each level appears an equal number of times Orthogonality, or two-way level balance: each level appears proportionally often with every level of other attributes Minimal Overlap: minimizing the extent to which an attribute level repeats within a choice set
39 39 Lighthouse Studio s Design Strategies We can balance the sources of efficiency to produce four design strategies Good designs at the respondent level that get better as more respondents answer more versions of the design As the number of versions increases, the difference in D- efficiency between complete enumeration and efficient designs becomes minuscule (Kuhfeld and Wurst 2012) Using many versions means We can cover a larger portion of the design space We can estimate interactions without pre-planning for them Version effects can cancel out
40 40 Complete Enumeration Generation process: Maximize one- and two-way level balance Profiles are nearly orthogonal for a given respondent Features One-way level balance (each level of an attribute occurs as equally often as possible) Two-way level balance (each pair of levels occurs as equally often as possible) Minimal overlap of levels within choice sets (promotes precision of main effects)
41 41 Shortcut Generation process: Similar to Complete Enumeration, except: Profiles are built using previously least-used attribute levels (from previous tasks and versions) Two-way frequency balance is not explicitly controlled Features Minimal overlap of levels between profiles One-way level balance (each level of an attribute occurs as equally often as possible) Loose (not strict) orthogonality
42 42 Random Generation process Profiles sampled randomly, with replacement, from full factorial universe of profiles No duplicate profiles allowed within a choice set Features Only loose one-way level balance (each level occurs approximately an equal number of times) Only loose two-way level balance (each pair of levels occurs approximately an equal number of times) Significant level overlap (an advantage for precision of interactions)
43 43 Balanced Overlap Similar to Complete Enumeration but with more level overlap Features About half as much level overlap as the purely Random strategy One-way level balance (each level occurs an equal number of times) Two-way level balance (each pair of levels occurs an equal number of times) Much better for main effects than Random and much better for interaction effects than Complete Enumeration Balanced Overlap is the default method in Sawtooth Software s CBC software
44 44 Pros and Cons of Lighthouse Strategies Complete Enumeration Shortcut Random Balanced Overlap Fast + + Main Effect Efficiency Interaction Efficiency Deep Processing + + Extreme Prohibitions + +
45 45 QUESTIONS? Keith Chrzan SVP, Sawtooth Analytics Megan Peitz Ingenuity Ambassador
46 46 References Addelman, S. (1962) Orthogonal Main-effects Plans for Asymmetrical Factorial Experiments, Technometrics, 4: Bliemer, M.C.J. and J.M. Rose (2010) Construction of Experimental Designs for Mixed Logit Models Allowing for Corelation Across Choice Observations, Transportation Research Part B, 44, Bliemer, M,C.J., J.M. Rose and S. Hess (2008) Approximation of Bayesian Efficiency in Experimental Choice Designs, Journal of Choice Modeling, 1: Bunch, D.S., J.J. Louviere and D. Anderson (1996) A Comparison of Experimental Design Strategies for Multinomial Logit Models: The Case of Generic Attributes, accessed on January 26, 2013 at Chrzan, K. and B. Orme (2000) Overview and Comparison of Design Strategies for Choice-Based Conjoint Analysis, Sawtooth Software Conference Proceedings, ) Hahn GJ. Shapiro SS. (1966) A catalogue and computer program for the design and analysis of orthogonal symmetric and asymmetric fractional factorial experiments. Report 66-C-165, General Electric Research and Development Centre, Schenectady, New York.
47 47 References Huber, J. and K. Zwerina (1996) The Importance of Utility Balance in Efficient Choice Designs, Journal of Marketing Research, 33: Kanninen, B. (2002) Optimal Designs for Multinomial Choice Experiments, Journal of Marketing Research, 39: Kuhfeld, W.F. Orthogonal Arrays. Technical Report, SAS Institute. Accessed on January 26, 2013 at Kuhfeld, W.F, R. Tobias and M. Garratt (1994) Efficient Experimental Design with Marketing Research Applications, Journal of Marketing Research, 31, Kuhfeld, W.F. and J.C. Wurst (2012) An overview of the Design of Stated Choice Experiments, Sawtooth Software Conference Proceedings. Orem: Sawtooth Software Liu, Q. and N. Arora (2011) Efficient Choice Designs for a Consider-Then- Choose Model, Marketing Science, 30: Louviere, J.J., D.A. Hensher and J.D. Swait (2000) Stated Choice Methods: Analysis and Application. Cambridge: Cambridge University
48 48 References Louviere, J.J. and G.W. Woodworth (1983) Design and Analysis of Simulated Consumer Choice or Allocation Experiments: An Approach Based on Aggregate Data, Journal of Marketing Research, 20: Sandor, Z. and M. Wedel (2001) Designing Choice Experiments Using Managers Prior Beliefs, Journal of Marketing Research, 38: Sandor, Z. and M. Wedel (2002) Profile Construction in Experimental Choice Designs for Mixed Logit Models, Marketing Science, 21: Sandor, Z. and M. Wedel (2005) Heterogeneous Choice Designs, Journal of Marketing Research, 42: Street, D.J. and L. Burgess (2007) The Construction of Optimal Stated Choice Experiments. Hoboken: Wiley. Street, D.J., L. Burgess and J.J. Louviere (2005) Quick and Easy Choice Sets: Constructing Optimal and Nearly Optimal Stated Choice Experiments, International Journal of Research in Marketing, 22:
The 7 th Balkan Conference on Operational Research BACOR 05 Constanta, May 2005, Romania
The 7 th Balkan Conference on Operational Research BACOR 05 Constanta, May 2005, Romania THE ALGORITHMS FOR CONSTRUCTING EFFICIENT EXPERIMENTAL DESIGNS IN CONJOINT ANALYSIS MARIJA KUZMANOVIÃ SLOBODAN KRÈEVINAC
More informationSawtooth Software. The CBC Advanced Design Module (ADM) Technical Paper TECHNICAL PAPER SERIES
Sawtooth Software TECHNICAL PAPER SERIES The CBC Advanced Design Module (ADM) Technical Paper Copyright 2005-2008, Sawtooth Software, Inc. 530 W. Fir St. Sequim, WA 98382 (360) 681-2300 www.sawtoothsoftware.com
More informationConjoint analysis Outline
Outline Conjoint analysis as a decompositional preference model Steps in conjoint analysis Uses of conjoint analysis Compositional vs. decompositional preference models Compositional: respondents evaluate
More informationMaxDiff Designer v2. (Updated 7 March 06) Sawtooth Software, Inc. Sequim, WA
MaxDiff Designer v2 (Updated 7 March 06) Sawtooth Software, Inc. Sequim, WA http://www.sawtoothsoftware.com In this manual, we refer to product names that are trademarked. Windows, Windows 95, Windows
More informationCatering to Your Tastes: Using PROC OPTEX to Design Custom Experiments, with Applications in Food Science and Field Trials
Paper 3148-2015 Catering to Your Tastes: Using PROC OPTEX to Design Custom Experiments, with Applications in Food Science and Field Trials Clifford Pereira, Department of Statistics, Oregon State University;
More informationA General Method for Constructing Efficient Choice Designs
A General Method for Constructing Efficient Choice Designs Klaus Zwerina Joel Huber Warren F. Kuhfeld Abstract Researchers have traditionally built choice designs using extensions of concepts from the
More informationCHAPTER 5. BASIC STEPS FOR MODEL DEVELOPMENT
CHAPTER 5. BASIC STEPS FOR MODEL DEVELOPMENT This chapter provides step by step instructions on how to define and estimate each of the three types of LC models (Cluster, DFactor or Regression) and also
More informationMR-2010I %MktEx Macro %MktEx Macro
MR-2010I %MktEx Macro 1017 %MktEx Macro The %MktEx autocall macro creates efficient factorial designs. The %MktEx macro is designed to be very simple to use and to run in seconds for trivial problems,
More informationRight-click on whatever it is you are trying to change Get help about the screen you are on Help Help Get help interpreting a table
Q Cheat Sheets What to do when you cannot figure out how to use Q What to do when the data looks wrong Right-click on whatever it is you are trying to change Get help about the screen you are on Help Help
More informationII. Linear Programming
II. Linear Programming A Quick Example Suppose we own and manage a small manufacturing facility that produced television sets. - What would be our organization s immediate goal? - On what would our relative
More informationCONNECTING TESTS. If two tests, A and B, are joined by a common link ofkitems and each test is given to its own sample ofnpersons, then da and drb
11. CONNECTING TESTS In this chapter we describe the basic strategies for connecting tests intended to measure on the same variable so that the separate measures each test implies are expressed together
More informationD-Optimal Designs. Chapter 888. Introduction. D-Optimal Design Overview
Chapter 888 Introduction This procedure generates D-optimal designs for multi-factor experiments with both quantitative and qualitative factors. The factors can have a mixed number of levels. For example,
More informationThe %ChoicEff Macro. Introduction
The %ChoicEff Macro Introduction The %ChoicEff autocall macro finds efficient experimental designs for choice experiments and evaluates choice designs. You supply a set of candidates, and the macro searches
More informationPackage blocksdesign
Type Package Package blocksdesign September 11, 2017 Title Nested and Crossed Block Designs for Factorial, Fractional Factorial and Unstructured Treatment Sets Version 2.7 Date 2017-09-11 Author R. N.
More informationData Mining. Data preprocessing. Hamid Beigy. Sharif University of Technology. Fall 1395
Data Mining Data preprocessing Hamid Beigy Sharif University of Technology Fall 1395 Hamid Beigy (Sharif University of Technology) Data Mining Fall 1395 1 / 15 Table of contents 1 Introduction 2 Data preprocessing
More informationSTAT 598L Learning Bayesian Network Structure
STAT 598L Learning Bayesian Network Structure Sergey Kirshner Department of Statistics Purdue University skirshne@purdue.edu November 2, 2009 Acknowledgements: some of the slides were based on Luo Si s
More informationSPM Users Guide. This guide elaborates on powerful ways to combine the TreeNet and GPS engines to achieve model compression and more.
SPM Users Guide Model Compression via ISLE and RuleLearner This guide elaborates on powerful ways to combine the TreeNet and GPS engines to achieve model compression and more. Title: Model Compression
More informationNon-Linearity of Scorecard Log-Odds
Non-Linearity of Scorecard Log-Odds Ross McDonald, Keith Smith, Matthew Sturgess, Edward Huang Retail Decision Science, Lloyds Banking Group Edinburgh Credit Scoring Conference 6 th August 9 Lloyds Banking
More informationOn the construction of nested orthogonal arrays
isid/ms/2010/06 September 10, 2010 http://wwwisidacin/ statmath/eprints On the construction of nested orthogonal arrays Aloke Dey Indian Statistical Institute, Delhi Centre 7, SJSS Marg, New Delhi 110
More informationWebinar. The Lighthouse Studio Scripting Series. Part 2 - Perl Sawtooth Software, Inc.
The Lighthouse Studio Scripting Series Part 2 - Perl 2 HTML 3 CSS 4 JavaScript 5 jquery (enhanced JavaScript) 6 Perl 7 Sawtooth Script Scripting language provided by Sawtooth Software Consists of various
More information11 Data Structures Foundations of Computer Science Cengage Learning
11 Data Structures 11.1 Foundations of Computer Science Cengage Learning Objectives After studying this chapter, the student should be able to: Define a data structure. Define an array as a data structure
More informationUniversity of Florida CISE department Gator Engineering. Clustering Part 2
Clustering Part 2 Dr. Sanjay Ranka Professor Computer and Information Science and Engineering University of Florida, Gainesville Partitional Clustering Original Points A Partitional Clustering Hierarchical
More informationTutorial #1: Using Latent GOLD choice to Estimate Discrete Choice Models
Tutorial #1: Using Latent GOLD choice to Estimate Discrete Choice Models In this tutorial, we analyze data from a simple choice-based conjoint (CBC) experiment designed to estimate market shares (choice
More informationImage Compression With Haar Discrete Wavelet Transform
Image Compression With Haar Discrete Wavelet Transform Cory Cox ME 535: Computational Techniques in Mech. Eng. Figure 1 : An example of the 2D discrete wavelet transform that is used in JPEG2000. Source:
More informationComputer Security. 08. Cryptography Part II. Paul Krzyzanowski. Rutgers University. Spring 2018
Computer Security 08. Cryptography Part II Paul Krzyzanowski Rutgers University Spring 2018 March 23, 2018 CS 419 2018 Paul Krzyzanowski 1 Block ciphers Block ciphers encrypt a block of plaintext at a
More informationON SOME METHODS OF CONSTRUCTION OF BLOCK DESIGNS
ON SOME METHODS OF CONSTRUCTION OF BLOCK DESIGNS NURNABI MEHERUL ALAM M.Sc. (Agricultural Statistics), Roll No. I.A.S.R.I, Library Avenue, New Delhi- Chairperson: Dr. P.K. Batra Abstract: Block designs
More informationThe Mode of Invitation for Web Surveys
Vol. 5, no 3, 2012 www.surveypractice.org The premier e-journal resource for the public opinion and survey research community The Mode of Invitation for Web Surveys Wolfgang Bandilla GESIS Leibniz Institute
More informationSTATISTICS (STAT) Statistics (STAT) 1
Statistics (STAT) 1 STATISTICS (STAT) STAT 2013 Elementary Statistics (A) Prerequisites: MATH 1483 or MATH 1513, each with a grade of "C" or better; or an acceptable placement score (see placement.okstate.edu).
More informationAssociation Pattern Mining. Lijun Zhang
Association Pattern Mining Lijun Zhang zlj@nju.edu.cn http://cs.nju.edu.cn/zlj Outline Introduction The Frequent Pattern Mining Model Association Rule Generation Framework Frequent Itemset Mining Algorithms
More informationMR-2010I %MktBIBD Macro 963. %MktBIBD Macro
MR-2010I %MktBIBD Macro 963 %MktBIBD Macro The %MktBIBD autocall macro finds balanced incomplete block designs (BIBDs). A BIBD is a list of treatments that appear together in blocks. Each block contains
More informationData Mining. Data preprocessing. Hamid Beigy. Sharif University of Technology. Fall 1394
Data Mining Data preprocessing Hamid Beigy Sharif University of Technology Fall 1394 Hamid Beigy (Sharif University of Technology) Data Mining Fall 1394 1 / 15 Table of contents 1 Introduction 2 Data preprocessing
More informationExam Review: Ch. 1-3 Answer Section
Exam Review: Ch. 1-3 Answer Section MDM 4U0 MULTIPLE CHOICE 1. ANS: A Section 1.6 2. ANS: A Section 1.6 3. ANS: A Section 1.7 4. ANS: A Section 1.7 5. ANS: C Section 2.3 6. ANS: B Section 2.3 7. ANS: D
More informationGENDEX-2001:GETTING STARTED AND THE BIB MODULE. Walter T. Federer Department of Biometrics, Cornell University,
GENDEX-2001:GETTING STARTED AND THE BIB MODULE By Walter T. Federer Department of Biometrics, Cornell University, Belinda Gross Department of Population Medicine and Diagnostic, Cornell University, Nam-Ky
More informationCONJOINT. Overview. **Default if subcommand or keyword is omitted.
CONJOINT CONJOINT [PLAN={* }] {file} [/DATA={* }] {file} /{SEQUENCE}=varlist {RANK } {SCORE } [/SUBJECT=variable] [/FACTORS=varlist[ labels ] ([{DISCRETE[{MORE}]}] { {LESS} } {LINEAR[{MORE}] } { {LESS}
More informationThe attendee will get a deep dive into all the DDL changes needed in order to exploit DB2 V10 Temporal tables as well as the limitations.
The attendee will get a deep dive into all the DDL changes needed in order to exploit DB2 V10 Temporal tables as well as the limitations. A case study scenario using a live DB2 V10 system will be used
More informationChapter 1. Using the Cluster Analysis. Background Information
Chapter 1 Using the Cluster Analysis Background Information Cluster analysis is the name of a multivariate technique used to identify similar characteristics in a group of observations. In cluster analysis,
More informationLab 9. Julia Janicki. Introduction
Lab 9 Julia Janicki Introduction My goal for this project is to map a general land cover in the area of Alexandria in Egypt using supervised classification, specifically the Maximum Likelihood and Support
More informationImplementation of Lifting-Based Two Dimensional Discrete Wavelet Transform on FPGA Using Pipeline Architecture
International Journal of Computer Trends and Technology (IJCTT) volume 5 number 5 Nov 2013 Implementation of Lifting-Based Two Dimensional Discrete Wavelet Transform on FPGA Using Pipeline Architecture
More informationCS 370 The Pseudocode Programming Process D R. M I C H A E L J. R E A L E F A L L
CS 370 The Pseudocode Programming Process D R. M I C H A E L J. R E A L E F A L L 2 0 1 5 Introduction At this point, you are ready to beginning programming at a lower level How do you actually write your
More information2. TOPOLOGICAL PATTERN ANALYSIS
Methodology for analyzing and quantifying design style changes and complexity using topological patterns Jason P. Cain a, Ya-Chieh Lai b, Frank Gennari b, Jason Sweis b a Advanced Micro Devices, 7171 Southwest
More informationCollective classification in network data
1 / 50 Collective classification in network data Seminar on graphs, UCSB 2009 Outline 2 / 50 1 Problem 2 Methods Local methods Global methods 3 Experiments Outline 3 / 50 1 Problem 2 Methods Local methods
More informationLG-Syntax TM User s Manual. LG Choice Modeling Extensions via the LG-Syntax Module
LG-Syntax TM User s Manual LG Choice Modeling Extensions via the LG-Syntax Module 1 This document should be cited as: Vermunt, J.K., and Magidson, J. (2011). LG-Syntax User s Guide: LG Choice Modeling
More informationFeature Selection for fmri Classification
Feature Selection for fmri Classification Chuang Wu Program of Computational Biology Carnegie Mellon University Pittsburgh, PA 15213 chuangw@andrew.cmu.edu Abstract The functional Magnetic Resonance Imaging
More informationHARNESSING CERTAINTY TO SPEED TASK-ALLOCATION ALGORITHMS FOR MULTI-ROBOT SYSTEMS
HARNESSING CERTAINTY TO SPEED TASK-ALLOCATION ALGORITHMS FOR MULTI-ROBOT SYSTEMS An Undergraduate Research Scholars Thesis by DENISE IRVIN Submitted to the Undergraduate Research Scholars program at Texas
More informationENV Laboratory 2: Graphing
Name: Date: Introduction It is often said that a picture is worth 1,000 words, or for scientists we might rephrase it to say that a graph is worth 1,000 words. Graphs are most often used to express data
More information1 Counting triangles and cliques
ITCSC-INC Winter School 2015 26 January 2014 notes by Andrej Bogdanov Today we will talk about randomness and some of the surprising roles it plays in the theory of computing and in coding theory. Let
More informationThe %MktEx Macro. Introduction. %MktEx Macro Syntax
The %MktEx Macro Introduction The %MktEx autocall macro creates efficient factorial designs It can handle simple problems like maineffects designs and more complicated problems, including designs that
More informationGraphing Calculator Comparison Activities
Graphing Calculator Comparison Activities CASIO fx-9750gii VS. TI-83, TI-83 Plus, TI-84, TI-84 Plus Finding Extrema Algebraically Texas Instruments: TI-83 Plus, TI-84 Plus, & TI-84 SE CASIO GRAPHING CALCULATORS
More informationEllipsoidal Methods for Adaptive Choice-Based Conjoint Analysis
Ellipsoidal Methods for Adaptive Choice-Based Conjoint Analysis Denis Sauré University of Chile, dsaure@dii.uchile.cl Juan Pablo Vielma MIT Sloan School of Management, jvielma@mit.edu Questionnaires for
More informationCS246: Mining Massive Datasets Jure Leskovec, Stanford University
CS246: Mining Massive Datasets Jure Leskovec, Stanford University http://cs246.stanford.edu 1/8/2014 Jure Leskovec, Stanford CS246: Mining Massive Datasets, http://cs246.stanford.edu 2 Supermarket shelf
More informationForecasting Technology Insertion Concurrent with Design Refresh Planning for COTS-Based Electronic Systems
Forecasting Technology Insertion Concurrent with Design Refresh Planning for COTS-Based Electronic Systems Peter Sandborn and Pameet Singh CALCE, Dept. of Mechanical Engineering, University of Maryland
More informationNumerical Linear Algebra
Numerical Linear Algebra Probably the simplest kind of problem. Occurs in many contexts, often as part of larger problem. Symbolic manipulation packages can do linear algebra "analytically" (e.g. Mathematica,
More informationDynamically Motivated Models for Multiplex Networks 1
Introduction Dynamically Motivated Models for Multiplex Networks 1 Daryl DeFord Dartmouth College Department of Mathematics Santa Fe institute Inference on Networks: Algorithms, Phase Transitions, New
More informationTutorial 10: Performing What-If Analyses. Microsoft Excel 2013 Enhanced
Tutorial 10: Performing What-If Analyses Microsoft Excel 2013 Enhanced Objectives Explore the principles of cost-volume-profit relationships Create a one-variable data table Create a two-variable data
More informationLinear Methods for Regression and Shrinkage Methods
Linear Methods for Regression and Shrinkage Methods Reference: The Elements of Statistical Learning, by T. Hastie, R. Tibshirani, J. Friedman, Springer 1 Linear Regression Models Least Squares Input vectors
More informationUnsupervised Learning : Clustering
Unsupervised Learning : Clustering Things to be Addressed Traditional Learning Models. Cluster Analysis K-means Clustering Algorithm Drawbacks of traditional clustering algorithms. Clustering as a complex
More informationBIOL591: Introduction to Bioinformatics Alignment of pairs of sequences
BIOL591: Introduction to Bioinformatics Alignment of pairs of sequences Reading in text (Mount Bioinformatics): I must confess that the treatment in Mount of sequence alignment does not seem to me a model
More informationCPSC 340: Machine Learning and Data Mining. Probabilistic Classification Fall 2017
CPSC 340: Machine Learning and Data Mining Probabilistic Classification Fall 2017 Admin Assignment 0 is due tonight: you should be almost done. 1 late day to hand it in Monday, 2 late days for Wednesday.
More informationClustering analysis of gene expression data
Clustering analysis of gene expression data Chapter 11 in Jonathan Pevsner, Bioinformatics and Functional Genomics, 3 rd edition (Chapter 9 in 2 nd edition) Human T cell expression data The matrix contains
More informationNetezza The Analytics Appliance
Software 2011 Netezza The Analytics Appliance Michael Eden Information Management Brand Executive Central & Eastern Europe Vilnius 18 October 2011 Information Management 2011IBM Corporation Thought for
More informationDM and Cluster Identification Algorithm
DM and Cluster Identification Algorithm Andrew Kusiak, Professor oratory Seamans Center Iowa City, Iowa - Tel: 9-9 Fax: 9- E-mail: andrew-kusiak@uiowa.edu Homepage: http://www.icaen.uiowa.edu/~ankusiak
More informationReal Numbers finite subset real numbers floating point numbers Scientific Notation fixed point numbers
Real Numbers We have been studying integer arithmetic up to this point. We have discovered that a standard computer can represent a finite subset of the infinite set of integers. The range is determined
More informationGateway Regional School District VERTICAL ARTICULATION OF MATHEMATICS STANDARDS Grades K-4
NUMBER SENSE & OPERATIONS K.N.1 Count by ones to at least 20. When you count, the last number word you say tells the number of items in the set. Counting a set of objects in a different order does not
More informationA Partition Method for Graph Isomorphism
Available online at www.sciencedirect.com Physics Procedia ( ) 6 68 International Conference on Solid State Devices and Materials Science A Partition Method for Graph Isomorphism Lijun Tian, Chaoqun Liu
More informationMichele Samorani. University of Alberta School of Business. More tutorials are available on Youtube
Dataconda Tutorial* Michele Samorani University of Alberta School of Business More tutorials are available on Youtube What is Dataconda? Software program to generate a mining table from a relational database
More informationDivisibility Rules and Their Explanations
Divisibility Rules and Their Explanations Increase Your Number Sense These divisibility rules apply to determining the divisibility of a positive integer (1, 2, 3, ) by another positive integer or 0 (although
More informationData Analytics and Dynamic Languages. Lee E. Edlefsen, Ph.D. VP of Engineering
Data Analytics and Dynamic Languages Lee E. Edlefsen, Ph.D. VP of Engineering 1 Overview This is my perspective on the use of dynamic languages (interpreters) for data analytics (statistics) I am a long-time
More informationData can be in the form of numbers, words, measurements, observations or even just descriptions of things.
+ What is Data? Data is a collection of facts. Data can be in the form of numbers, words, measurements, observations or even just descriptions of things. In most cases, data needs to be interpreted and
More informationExperimental Comparison of Different Techniques to Generate Adaptive Sequences
Experimental Comparison of Different Techniques to Generate Adaptive Sequences Carlos Molinero 1, Manuel Núñez 1 and Robert M. Hierons 2 1 Departamento de Sistemas Informáticos y Computación, Universidad
More informationGeneralized Additive Model
Generalized Additive Model by Huimin Liu Department of Mathematics and Statistics University of Minnesota Duluth, Duluth, MN 55812 December 2008 Table of Contents Abstract... 2 Chapter 1 Introduction 1.1
More informationMR-2010I %MktRuns Macro %MktRuns Macro
MR-2010I %MktRuns Macro 1159 %MktRuns Macro The %MktRuns autocall macro suggests reasonable sizes for experimental designs. See the following pages for examples of using this macro in the design chapter:
More informationComputer Security 3/23/18
s s encrypt a block of plaintext at a time and produce ciphertext Computer Security 08. Cryptography Part II Paul Krzyzanowski DES & AES are two popular block ciphers DES: 64 bit blocks AES: 128 bit blocks
More informationCITS4009 Introduction to Data Science
School of Computer Science and Software Engineering CITS4009 Introduction to Data Science SEMESTER 2, 2017: CHAPTER 4 MANAGING DATA 1 Chapter Objectives Fixing data quality problems Organizing your data
More informationEngineering 1000 Chapter 6: Abstraction and Modeling
Engineering 1000 Chapter 6: Abstraction and Modeling Outline Why is abstraction useful? What are models? how are models different from theory and simulation? Examples from microelectronics Types of model
More informationSection 4 General Factorial Tutorials
Section 4 General Factorial Tutorials General Factorial Part One: Categorical Introduction Design-Ease software version 6 offers a General Factorial option on the Factorial tab. If you completed the One
More informationCS 4649/7649 Robot Intelligence: Planning
CS 4649/7649 Robot Intelligence: Planning Probabilistic Roadmaps Sungmoon Joo School of Interactive Computing College of Computing Georgia Institute of Technology S. Joo (sungmoon.joo@cc.gatech.edu) 1
More informationTips on JMP ing into Mixture Experimentation
Tips on JMP ing into Mixture Experimentation Daniell. Obermiller, The Dow Chemical Company, Midland, MI Abstract Mixture experimentation has unique challenges due to the fact that the proportion of the
More informationPredict Outcomes and Reveal Relationships in Categorical Data
PASW Categories 18 Specifications Predict Outcomes and Reveal Relationships in Categorical Data Unleash the full potential of your data through predictive analysis, statistical learning, perceptual mapping,
More informationConverting between Percents, Decimals, and Fractions
Section. PRE-ACTIVITY PREPARATION Converting between Percents, Decimals, and Fractions Think about how often you have heard, read, or used the term percent (%) in its many everyday applications: The sales
More informationLecturer 2: Spatial Concepts and Data Models
Lecturer 2: Spatial Concepts and Data Models 2.1 Introduction 2.2 Models of Spatial Information 2.3 Three-Step Database Design 2.4 Extending ER with Spatial Concepts 2.5 Summary Learning Objectives Learning
More informationsuccess of Business enterprise especially in manufacturing organization. Goods manufactured by firm need to be distributed to dealers, distributers
INTRODUCTION ASSIGNMENT V/S TRANSPORTATION ASSUMPTIONS INITIAL BASIC FEASIBLE SOLUTION [IBFS] 5 METHODS. DEGENERACY IN TRANSPORTATION OPTIMAL SOLUTION [MODI METHOD] HOW TO PREPARE LOOP PROHIBITED PROBLEM
More information- 1 - Fig. A5.1 Missing value analysis dialog box
WEB APPENDIX Sarstedt, M. & Mooi, E. (2019). A concise guide to market research. The process, data, and methods using SPSS (3 rd ed.). Heidelberg: Springer. Missing Value Analysis and Multiple Imputation
More informationImproving the Efficiency of Fast Using Semantic Similarity Algorithm
International Journal of Scientific and Research Publications, Volume 4, Issue 1, January 2014 1 Improving the Efficiency of Fast Using Semantic Similarity Algorithm D.KARTHIKA 1, S. DIVAKAR 2 Final year
More informationNo-Arbitrage ROM Simulation
Alois Geyer 1 Michael Hanke 2 Alex Weissensteiner 3 1 WU (Vienna University of Economics and Business) and Vienna Graduate School of Finance (VGSF) 2 Institute for Financial Services, University of Liechtenstein
More informationCHAPTER 2 DESIGN DEFINITION
CHAPTER 2 DESIGN DEFINITION Wizard Option The Wizard is a powerful tool available in DOE Wisdom to help with the set-up and analysis of your Screening or Modeling experiment. The Wizard walks you through
More informationWe propose and test new adaptive question design and estimation algorithms for partialprofile
Fast Polyhedral Adaptive Conjoint Estimation Olivier Toubia Duncan I. Simester John R. Hauser Ely Dahan Marketing Group, Massachusetts Institute of Technology, E56-345, 38 Memorial Drive, Cambridge, Massachusetts
More informationCoding for the Network: Scalable and Multiple description coding Marco Cagnazzo
Coding for the Network: Scalable and Multiple description coding Marco Cagnazzo Overview Examples and motivations Scalable coding for network transmission Techniques for multiple description coding 2 27/05/2013
More information(THE) ULTIMATE CONTACT STRATEGY HOW TO USE PHONE AND FOR CONTACT AND CONVERSION SUCCESS SALES OPTIMIZATION STUDY
(THE) ULTIMATE CONTACT STRATEGY HOW TO USE PHONE AND EMAIL FOR CONTACT AND CONVERSION SUCCESS EXECUTIVE SUMMARY This study, derived from the data of nearly 3.5 million leads, breaks new ground, revealing
More informationFrequencies, Unequal Variance Weights, and Sampling Weights: Similarities and Differences in SAS
ABSTRACT Paper 1938-2018 Frequencies, Unequal Variance Weights, and Sampling Weights: Similarities and Differences in SAS Robert M. Lucas, Robert M. Lucas Consulting, Fort Collins, CO, USA There is confusion
More informationPhd Program in Transportation. Transport Demand Modeling
Phd Program in Transportation Transport Demand Modeling Gonçalo Homem de Almeida Correia Session 2 Stated Preference Experiments The IIA assumption and the Hausman Test Nested Logit Models Phd in Transportation
More informationQuery Processing: A Systems View. Announcements (March 1) Physical (execution) plan. CPS 216 Advanced Database Systems
Query Processing: A Systems View CPS 216 Advanced Database Systems Announcements (March 1) 2 Reading assignment due Wednesday Buffer management Homework #2 due this Thursday Course project proposal due
More informationModule 9 : Numerical Relaying II : DSP Perspective
Module 9 : Numerical Relaying II : DSP Perspective Lecture 36 : Fast Fourier Transform Objectives In this lecture, We will introduce Fast Fourier Transform (FFT). We will show equivalence between FFT and
More informationA novel approach to include limited equipment connectivity in State-Task Network models
OSE SEMINAR 2011 A novel approach to include limited equipment connectivity in State- Network models Mikael Nyberg CENTER OF EXCELLENCE IN OPTIMIZATION AND SYSTEMS ENGINEERING AT ÅBO AKADEMI UNIVERSITY
More information2 (FTTH) FTTH JEL L96, H Tel&Fax:
+ 2 2 (FTTH) ADSL FTTH NTT 2300-2400 FTTH JEL L96, H40 + 606-8501 Tel&Fax: 075-753-3477 E-mail: ida@econ.kyoto-u.ac.jp 1 I. 2000 1 Fiber to the Home(FTTH)Asymmetric Digital Subscriber Line(ADSL) FTTH 4
More informationBECOME A LOAD TESTING ROCK STAR
3 EASY STEPS TO BECOME A LOAD TESTING ROCK STAR Replicate real life conditions to improve application quality Telerik An Introduction Software load testing is generally understood to consist of exercising
More informationThe first thing we ll need is some numbers. I m going to use the set of times and drug concentration levels in a patient s bloodstream given below.
Graphing in Excel featuring Excel 2007 1 A spreadsheet can be a powerful tool for analyzing and graphing data, but it works completely differently from the graphing calculator that you re used to. If you
More informationShow how the LG-Syntax can be generated from a GUI model. Modify the LG-Equations to specify a different LC regression model
Tutorial #S1: Getting Started with LG-Syntax DemoData = 'conjoint.sav' This tutorial introduces the use of the LG-Syntax module, an add-on to the Advanced version of Latent GOLD. In this tutorial we utilize
More informationPASS Sample Size Software. Randomization Lists
Chapter 880 Introduction This module is used to create a randomization list for assigning subjects to one of up to eight groups or treatments. Six randomization algorithms are available. Four of the algorithms
More information-Using Excel- *The columns are marked by letters, the rows by numbers. For example, A1 designates row A, column 1.
-Using Excel- Note: The version of Excel that you are using might vary slightly from this handout. This is for Office 2004 (Mac). If you are using a different version, while things may look slightly different,
More informationDimension reduction : PCA and Clustering
Dimension reduction : PCA and Clustering By Hanne Jarmer Slides by Christopher Workman Center for Biological Sequence Analysis DTU The DNA Array Analysis Pipeline Array design Probe design Question Experimental
More information