skip to main content
10.1145/1143844.1143890acmotherconferencesArticle/Chapter ViewAbstractPublication PagesicmlConference Proceedingsconference-collections
Article

A choice model with infinitely many latent features

Authors Info & Claims
Published:25 June 2006Publication History

ABSTRACT

Elimination by aspects (EBA) is a probabilistic choice model describing how humans decide between several options. The options from which the choice is made are characterized by binary features and associated weights. For instance, when choosing which mobile phone to buy the features to consider may be: long lasting battery, color screen, etc. Existing methods for inferring the parameters of the model assume pre-specified features. However, the features that lead to the observed choices are not always known. Here, we present a non-parametric Bayesian model to infer the features of the options and the corresponding weights from choice data. We use the Indian buffet process (IBP) as a prior over the features. Inference using Markov chain Monte Carlo (MCMC) in conjugate IBP models has been previously described. The main contribution of this paper is an MCMC algorithm for the EBA model that can also be used in inference for other non-conjugate IBP models---this may broaden the use of IBP priors considerably.

References

  1. Bradley, R., & Terry, M. (1952). The rank analysis of incomplete block designs. I. the method of paired comparisons. Biometrika, 39, 324--345.Google ScholarGoogle Scholar
  2. Griffiths, T. L., & Ghahramani, Z. (2005). Infinite latent feature models and the Indian buffet process (Technical Report 2005-01). Gatsby Computational Neuroscience Unit, University College London.Google ScholarGoogle Scholar
  3. James, L. F., & Lau, J. W. (2004). Flexible choice modelling based on Bayesian nonparametric mixed multinomial logit choice models. Submitted.Google ScholarGoogle Scholar
  4. Kuss, M., Jäkel, F., & Wichmann, F. A. (2005). Bayesian inference for psychometric functions. Journal of Vision, 5, 478--492.Google ScholarGoogle ScholarCross RefCross Ref
  5. Luce, R. (1959). Individual choice behavior. New York: Wiley.Google ScholarGoogle Scholar
  6. McFadden, D. (2000). Economic choice. In T. Persson (Ed.), Nobel lectures, Economics 1996--2000, 330--364. Singapore: World Scientific Publishing.Google ScholarGoogle Scholar
  7. Navarro, D., & Griffiths, T. L. (2005). Bayesian additive clustering. Proceedings of AML, 2.Google ScholarGoogle Scholar
  8. Neal, R. M. (2000). Markov chain sampling methods for Dirichlet process mixture models. Journal of Computational and Graphical Statistics, 9, 249--265.Google ScholarGoogle ScholarCross RefCross Ref
  9. Pitman, J. (2002). Combinatorial stochastic processes. Notes for Ecole d'Eté Saint-Flour Summer School.Google ScholarGoogle Scholar
  10. Restle, F. (1961). Psychology of judgment and choice: A theoretical essay. John Wiley & Sons.Google ScholarGoogle Scholar
  11. Rumelhart, D., & Greeno, J. (1971). Similarity between stimuli: An experimental test of the Luce and Restle choice models. Journal of Mathematical Psychology, 8, 370--381.Google ScholarGoogle ScholarCross RefCross Ref
  12. Train, K. (2003). Discrete choice methods with simulation. Cambridge University Press.Google ScholarGoogle ScholarCross RefCross Ref
  13. Tversky, A. (1972). Elimination by aspects: A theory of choice. Psychological Review, 79, 281--299.Google ScholarGoogle ScholarCross RefCross Ref
  14. Tversky, A., & Sattath, S. (1979). Preference trees. Psychological Review, 86, 542--573.Google ScholarGoogle ScholarCross RefCross Ref
  15. Wickelmaier, F., & Schmid, C. (2004). A Matlab function to estimate choice model parameters from paired comparison data. Behavior Research Methods, Instruments, & Computers, 36, 29--40.Google ScholarGoogle ScholarCross RefCross Ref

Index Terms

  1. A choice model with infinitely many latent features

      Recommendations

      Comments

      Login options

      Check if you have access through your login credentials or your institution to get full access on this article.

      Sign in
      • Published in

        cover image ACM Other conferences
        ICML '06: Proceedings of the 23rd international conference on Machine learning
        June 2006
        1154 pages
        ISBN:1595933832
        DOI:10.1145/1143844

        Copyright © 2006 ACM

        Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

        Publisher

        Association for Computing Machinery

        New York, NY, United States

        Publication History

        • Published: 25 June 2006

        Permissions

        Request permissions about this article.

        Request Permissions

        Check for updates

        Qualifiers

        • Article

        Acceptance Rates

        ICML '06 Paper Acceptance Rate140of548submissions,26%Overall Acceptance Rate140of548submissions,26%

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader