Efficient distribution-free learning of probabilistic concepts
Journal of Computer and System Sciences - Special issue: 31st IEEE conference on foundations of computer science, Oct. 22–24, 1990
Regularization theory and neural networks architectures
Neural Computation
A decision-theoretic generalization of on-line learning and an application to boosting
Journal of Computer and System Sciences - Special issue: 26th annual ACM symposium on the theory of computing & STOC'94, May 23–25, 1994, and second annual Europe an conference on computational learning theory (EuroCOLT'95), March 13–15, 1995
Properties of support vector machines
Neural Computation
Stated choice methods: analysis and application
Stated choice methods: analysis and application
Statistical Learning Theory: A Primer
International Journal of Computer Vision - special issue on learning and vision at the center for biological and computational learning, Massachusetts Institute of Technology
Mining e-commerce data: the good, the bad, and the ugly
Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining
Introduction to Linear Optimization
Introduction to Linear Optimization
Duality and Geometry in SVM Classifiers
ICML '00 Proceedings of the Seventeenth International Conference on Machine Learning
Support Vector Machine Active Learning with Application sto Text Classification
ICML '00 Proceedings of the Seventeenth International Conference on Machine Learning
Incorporating Invariances in Support Vector Learning Machines
ICANN 96 Proceedings of the 1996 International Conference on Artificial Neural Networks
A Hierarchical Bayes Model of Primary and Secondary Demand
Marketing Science
MARK: a boosting algorithm for heterogeneous kernel models
Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining
Image Representations and Feature Selection for Multimedia Database Search
IEEE Transactions on Knowledge and Data Engineering
Web Mining: Information and Pattern Discovery on the World Wide Web
ICTAI '97 Proceedings of the 9th International Conference on Tools with Artificial Intelligence
Everything old is new again: a fresh look at historical approaches in machine learning
Everything old is new again: a fresh look at historical approaches in machine learning
Measuring Heterogeneous Reservation Prices for Product Bundles
Marketing Science
Fast Polyhedral Adaptive Conjoint Estimation
Marketing Science
Prediction in Marketing Using the Support Vector Machine
Marketing Science
Editorial: Who Is Afraid to Give Freedom of Speech to Marketing Folks?
Marketing Science
Research on Innovation: A Review and Agenda for Marketing Science
Marketing Science
The Impact of Utility Balance and Endogeneity in Conjoint Analysis
Marketing Science
Prediction in Marketing Using the Support Vector Machine
Marketing Science
Editorial: Who Is Afraid to Give Freedom of Speech to Marketing Folks?
Marketing Science
A case study of behavior-driven conjoint analysis on Yahoo!: front page today module
Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining
A kernel method for market clearing
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Kernel Methods for Revealed Preference Analysis
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
Active Machine Learning for Consideration Heuristics
Marketing Science
Hi-index | 0.00 |
We introduce methods from statistical learning theory to the field of conjoint analysis for preference modeling. We present a method for estimating preference models that can be highly nonlinear and robust to noise. Like recently developed polyhedral methods for conjoint analysis, our method is based on computationally efficient optimization techniques. We compare our method with standard logistic regression, hierarchical Bayes, and the polyhedral methods using standard, widely used simulation data. The experiments show that the proposed method handles noise significantly better than both logistic regression and the recent polyhedral methods and is never worse than the best method among the three mentioned above. It can also be used for estimating nonlinearities in preference models faster and better than all other methods. Finally, a simple extension for handling heterogeneity shows promising results relative to hierarchical Bayes. The proposed method can therefore be useful, for example, for analyzing large amounts of data that are noisy or for estimating interactions among product features.