skip to main content
10.1145/1935826.1935910acmconferencesArticle/Chapter ViewAbstractPublication PageswsdmConference Proceedingsconference-collections
poster

Adaptive bootstrapping of recommender systems using decision trees

Published:09 February 2011Publication History

ABSTRACT

Recommender systems perform much better on users for which they have more information. This gives rise to a problem of satisfying users new to a system. The problem is even more acute considering that some of these hard to profile new users judge the unfamiliar system by its ability to immediately provide them with satisfying recommendations, and may quickly abandon the system when disappointed. Rapid profiling of new users by a recommender system is often achieved through a bootstrapping process - a kind of an initial interview - that elicits users to provide their opinions on certain carefully chosen items or categories. The elicitation process becomes particularly effective when adapted to users' responses, making best use of users' time by dynamically modifying the questions to improve the evolving profile. In particular, we advocate a specialized version of decision trees as the most appropriate tool for this task. We detail an efficient tree learning algorithm, specifically tailored to the unique properties of the problem. Several extensions to the tree construction are also introduced, which enhance the efficiency and utility of the method. We implemented our methods within a movie recommendation service. The experimental study delivered encouraging results, with the tree-based bootstrapping process significantly outperforming previous approaches.

References

  1. D. Agarwal and B. Chen. Regression based Latent Factor Models. Proc. ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD), 19--28, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. J. Bennett and S. Lanning. The Netflix Prize. Proc. KDD Cup and Workshop, 2007.Google ScholarGoogle Scholar
  3. L. Breiman. Random Forests. Machine Learning 45:1, 5--32, 2001. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. J. H. Friedman. Stochastic Gradient Boosting. Computational Statistics & Data Analysis 38:4, 367--378, 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. N. Golbandi, Y. Koren and R. Lempel. On Bootstrapping Recommender Systems. Proc. International Conference on Information and Knowledge Management (CIKM), 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. D. Goldberg, D. Nichols, B. M. Oki and D. Terry. Using Collaborative Filtering to Weave an Information Tapestry. Communications of the ACM 35:12, 61--70, 1992. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. A. Gunawardana and C. Meek. Tied Boltzmann Machines for Cold Start Recommendations. Proc. third ACM conference on Recommender Systems (RecSys), 117--124, 2009.Google ScholarGoogle Scholar
  8. T. Hastie, R. Tibshirani and J. H. Friedman. The Elements of Statistical Learning: Data Mining, Inference, and Prediction (2nd edition). Springer Verlag, 2009.Google ScholarGoogle Scholar
  9. J. Herlocker, J. Konstan, L. Terveen and J. Riedl. Evaluating Collaborative Filtering Recommender Systems. ACM Transactions on Information Systems 22:1, 5--53, 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. A. Kohrs and B. Merialdo. Improving Collaborative Filtering for New Users by Smart Object Selection. Proc. International Conference on Media Features (ICMF), 2001.Google ScholarGoogle Scholar
  11. Y. Koren. Factor in the Neighbors: Scalable and Accurate Collaborative Filtering. ACM Transactions on Knowledge Discovery from Data 4:1, 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. Y. Koren, R. Bell and C. Volinsky. Matrix Factorization Techniques for Recommender Systems. IEEE Computer 42:8, 30--37, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. S. Lee. Commodity Recommendations of Retail Business Based on Decision Tree Induction. Expert Systems with Applications 37:5, 3685--3694, 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. G. Linden, B. Smith and J. York. Amazon.com Recommendations: Item-to-item Collaborative Filtering. IEEE Internet Computing 7:1, 76--80, 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. A. Paterek. Improving Regularized Singular Value Decomposition for Collaborative Filtering. Proc. KDD Cup and Workshop, 2007.Google ScholarGoogle Scholar
  16. A. M. Rashid, I. Albert, D. Cosley, S. K. Lam, S. M. Mcnee, J. A. Konstan and J. Riedl. Getting to Know You: Learning New User Preferences in Recommender Systems. Proc. 7th international conference on Intelligent user interfaces (IUI), 127--134, 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. A. M. Rashid, G. Karypis and J. Riedl. Learning Preferences of New Users in Recommender Systems: An Information Theoretic Approach. SIGKDD Explorations 10:2, 90--100, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. B. Sarwar, G. Karypis, J. Konstan and J. Riedl. Item-based Collaborative Filtering Recommendation Algorithms. Proc. 10th international conference on WWW, 285--295, 2001 Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Adaptive bootstrapping of recommender systems using decision trees

    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 Conferences
      WSDM '11: Proceedings of the fourth ACM international conference on Web search and data mining
      February 2011
      870 pages
      ISBN:9781450304931
      DOI:10.1145/1935826

      Copyright © 2011 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: 9 February 2011

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Qualifiers

      • poster

      Acceptance Rates

      WSDM '11 Paper Acceptance Rate83of372submissions,22%Overall Acceptance Rate498of2,863submissions,17%

      Upcoming Conference

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader