A Machine Learning Approach to Conjoint Analysis

Choice-based conjoint analysis builds models of consumer preferences over products with answers gathered in questionnaires. Our main goal is to bring tools from the machine learning community to solve this problem more efficiently. Thus, we propose two algorithms to quickly and accurately estimate consumer preferences.

[1]  Bernhard E. Boser,et al.  A training algorithm for optimal margin classifiers , 1992, COLT '92.

[2]  Joel Huber,et al.  The Importance of Utility Balance in Efficient Choice Designs , 1996 .

[3]  David Barber,et al.  Bayesian Classification With Gaussian Processes , 1998, IEEE Trans. Pattern Anal. Mach. Intell..

[4]  David Haussler,et al.  Probabilistic kernel regression models , 1999, AISTATS.

[5]  V. Vapnik,et al.  Bounds on Error Expectation for Support Vector Machines , 2000, Neural Computation.

[6]  Ralf Herbrich,et al.  Large margin rank boundaries for ordinal regression , 2000 .

[7]  Thore Graepel,et al.  Large Margin Rank Boundaries for Ordinal Regression , 2000 .

[8]  Michael I. Jordan,et al.  Bayesian parameter estimation via variational methods , 2000, Stat. Comput..

[9]  Bernhard Schölkopf,et al.  Learning with kernels , 2001 .

[10]  Daphne Koller,et al.  Support Vector Machine Active Learning with Applications to Text Classification , 2000, J. Mach. Learn. Res..

[11]  Michael E. Tipping.  Bayesian Inference: An Introduction to Principles and Practice in Machine Learning , 2003, Advanced Lectures on Machine Learning.

[12]  Tony Jebara.  Convex Invariance Learning , 2003, AISTATS.

[13]  Charles A. Micchelli,et al.  Kernels for Multi--task Learning , 2004, NIPS.

[14]  John R. Hauser,et al.  Polyhedral Methods for Adaptive Choice , 2004 .

[15]  Giorgos Zacharia,et al.  Generalized robust conjoint estimation , 2005 .

[16]  Wei Chu,et al.  Gaussian Processes for Ordinal Regression , 2005, J. Mach. Learn. Res..

[17]  Anton Schwaighofer,et al.  Hierarchical Bayesian modelling with Gaus-sian processes , 2005, NIPS 2005.