Generalized Robust Conjoint Estimation
The DOI matches its Crossref record; 6 of the 6 references it cites were found in a registry or an index.
Abstract
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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Cortes, C., & Vapnik, V. (1995) · Machine Learning · doi:10.1007/bf00994018 · Cited by 59,421
Tversky, A., & Kahneman, D. (1974) · Science · doi:10.1126/science.185.4157.1124 · Cited by 28,810
Friedman, J., Hastie, T., & Tibshirani, R. (2000) · The Annals of Statistics · doi:10.1214/aos/1016218223 · Cited by 6,884
Spline Models for Observational Data
Wahba, G. (1990) · doi:10.1137/1.9781611970128 · Cited by 4,184
A Probabilistic Theory of Pattern Recognition
Devroye, L., Györfi, L., & Lugosi, G. (1996) · Stochastic Modelling and Applied Probability · doi:10.1007/978-1-4612-0711-5 · Cited by 3,274
On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
Vapnik, V. N., & Chervonenkis, A. Y. (1971) · Theory of Probability & Its Applications · doi:10.1137/1116025 · Cited by 2,448
Cited by
Research on Innovation: A Review and Agenda for Marketing Science
Hauser, J., Tellis, G. J., & Griffin, A. (2006) · Marketing Science · doi:10.1287/mksc.1050.0144 · Cited by 1,077
Learning Multiple Tasks with Kernel Methods
Evgeniou, T., Micchelli, C. A., & Pontil, M. (2005) · doi:10.5555/1046920.1088693 · Cited by 799
Self-citationMachine learning and AI in marketing–Connecting computing power to human insights
Ma, L., & Sun, B. (2020) · International Journal of Research in Marketing · doi:10.1016/j.ijresmar.2020.04.005 · Cited by 602
Automated Marketing Research Using Online Customer Reviews
Lee, T. Y., & Bradlow, E. T. (2011) · Journal of Marketing Research · doi:10.1509/jmkr.48.5.881 · Cited by 460
Hauser, J. R. (2014) · Journal of Business Research · doi:10.1016/j.jbusres.2014.02.015 · Cited by 256
Metadata
- Authors
- Evgeniou, T., Boussios, C., & Zacharia, G.
- Venue
- Marketing Science
- Published
- 2005-08
- Volume
- 24
- Issue
- 3
- Pages
- 415-429
- ISSN
- 0732-2399 (ISSN-L)
- 1526-548X
- OpenAlex
- W261909730
- Cited by
- 121
- References
- 6
- FWCI
- 20.20
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Generalized Robust Conjoint Estimation. https://app.cochat.ai/papers/10.1287/mksc.1040.0100
- The paper
- Evgeniou, T., Boussios, C., & Zacharia, G. (2005). Generalized Robust Conjoint Estimation. Marketing Science. https://doi.org/10.1287/mksc.1040.0100
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.