Nothing Special   »   [go: up one dir, main page]

skip to main content
10.1145/2433396.2433445acmconferencesArticle/Chapter ViewAbstractPublication PageswsdmConference Proceedingsconference-collections
research-article

Latent factor models with additive and hierarchically-smoothed user preferences

Published: 04 February 2013 Publication History

Abstract

Items in recommender systems are usually associated with annotated attributes: for e.g., brand and price for products; agency for news articles, etc. Such attributes are highly informative and must be exploited for accurate recommendation. While learning a user preference model over these attributes can result in an interpretable recommender system and can hands the cold start problem, it suffers from two major drawbacks: data sparsity and the inability to model random effects. On the other hand, latent-factor collaborative filtering models have shown great promise in recommender systems; however, its performance on rare items is poor. In this paper we propose a novel model LFUM, which provides the advantages of both of the above models. We learn user preferences (over the attributes) using a personalized Bayesian hierarchical model that uses a combination(additive model) of a globally learned preference model along with user-specific preferences. To combat data-sparsity, we smooth these preferences over the item-taxonomy using an efficient forward-filtering and backward-smoothing inference algorithm. Our inference algorithms can handle both discrete attributes (e.g., item brands) and continuous attributes (e.g., item prices). We combine the user preferences with the latent-factor models and train the resulting collaborative filtering system end-to-end using the successful BPR ranking algorithm. In our extensive experimental analysis, we show that our proposed model outperforms several commonly used baselines and we carry out an ablation study showing the benefits of each component of our model.

References

[1]
Pricegrabber. http://www.pricegrabber.com/.
[2]
D. Agarwal and B.-C. Chen. Regression-based latent factor models. In KDD, pages 19--28, 2009.
[3]
A. Ahmed, M. Aly, J. Gonzalez, S. Narayanamurthy, and A. J. Smola. Scalable inference in latent variable models. In WSDM, pages 123--132, 2012.
[4]
A. Ahmed, Y. Low, M. Aly, V. Josifovski, and A. J. Smola. Scalable distributed inference of dynamic user interests for behavioral targeting. In KDD, pages 114--122, 2011.
[5]
J. Bennett, S. Lanning, and N. Netflix. The netflix prize. In In KDD Cup and Workshop in conjunction with KDD, 2007.
[6]
R. D. Burke. Hybrid recommender systems: Survey and experiments. User Model. User-Adapt. Interact., 12(4):331--370, 2002.
[7]
P. Cowans. Probabilistic document modelling. 2006.
[8]
A. Gunawardana and C. Meek. Tied boltzmann machines for cold start recommendations. In RecSys, pages 19--26, 2008.
[9]
A. Gunawardana and C. Meek. A unified approach to building hybrid recommender systems. In RecSys, pages 117--124, 2009.
[10]
P. D. Hoeff. Bilinear mixed effects models for dyadic data. Journal of the American Statistical Assosciation, 2005.
[11]
A. W. K. Chou and A. Benveniste. Multiscale recursive estimation, data fusion, and regularization. IEEE Transactions on Automatic Control, 39(3), 1994.
[12]
N. Koenigstein, G. Dror, and Y. Koren. Yahoo! music recommendations: modeling music ratings with temporal dynamics and item taxonomy. In RecSys, 2011.
[13]
Y. Koren. Factorization meets the neighborhood: a multifaceted collaborative filtering model. In KDD, pages 426--434, 2008.
[14]
Y. Koren. Collaborative filtering with temporal dynamics. In KDD, pages 447--456, 2009.
[15]
Y. Koren and R. M. Bell. Advances in collaborative filtering. In Recommender Systems Handbook, pages 145--186. 2011.
[16]
Y. Koren, R. M. Bell, and C. Volinsky. Matrix factorization techniques for recommender systems. IEEE Computer, 42(8):30--37, 2009.
[17]
A. Mnih. Taxonomy-informed latent factor models for implicit feedback. In KDD Cup, KDD 2011, 2011.
[18]
S. Rendle, C. Freudenthaler, Z. Gantner, and L. Schmidt-thieme. L.s.: Bpr: Bayesian personalized ranking from implicit feedback. In UAI, 2009.
[19]
S. Rendle and L. Schmidt-Thieme. Pairwise interaction tensor factorization for personalized tag recommendation. In WSDM, 2010.
[20]
Y. W. Teh, M. I. Jordan, M. J. Beal, and D. M. Blei. Hierarchical dirichlet processes. Dec. 2006.
[21]
K. Yu, J. D. Lafferty, S. Zhu, and Y. Gong. Large-scale collaborative prediction using a nonparametric random effects model. In ICML, page 149, 2009.

Cited By

View all
  • (2020)Machine Learning Approach in Heterogeneous Group of Algorithms for Transport Safety-Critical SystemApplied Sciences10.3390/app1008267010:8(2670)Online publication date: 13-Apr-2020
  • (2020)Mining User Interests from Social MediaProceedings of the 29th ACM International Conference on Information & Knowledge Management10.1145/3340531.3412167(3519-3520)Online publication date: 19-Oct-2020
  • (2020)Smart Tourism System in CalabriaData Science and Social Research II10.1007/978-3-030-51222-4_11(131-144)Online publication date: 26-Nov-2020
  • Show More Cited By

Index Terms

  1. Latent factor models with additive and hierarchically-smoothed user preferences

      Recommendations

      Comments

      Please enable JavaScript to view thecomments powered by Disqus.

      Information & Contributors

      Information

      Published In

      cover image ACM Conferences
      WSDM '13: Proceedings of the sixth ACM international conference on Web search and data mining
      February 2013
      816 pages
      ISBN:9781450318693
      DOI:10.1145/2433396
      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]

      Sponsors

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      Published: 04 February 2013

      Permissions

      Request permissions for this article.

      Check for updates

      Author Tags

      1. inference
      2. latent variable models
      3. recomcollaborative filtering
      4. recomfactor models
      5. recommendation

      Qualifiers

      • Research-article

      Conference

      WSDM 2013

      Acceptance Rates

      Overall Acceptance Rate 498 of 2,863 submissions, 17%

      Upcoming Conference

      Contributors

      Other Metrics

      Bibliometrics & Citations

      Bibliometrics

      Article Metrics

      • Downloads (Last 12 months)8
      • Downloads (Last 6 weeks)2
      Reflects downloads up to 17 Nov 2024

      Other Metrics

      Citations

      Cited By

      View all
      • (2020)Machine Learning Approach in Heterogeneous Group of Algorithms for Transport Safety-Critical SystemApplied Sciences10.3390/app1008267010:8(2670)Online publication date: 13-Apr-2020
      • (2020)Mining User Interests from Social MediaProceedings of the 29th ACM International Conference on Information & Knowledge Management10.1145/3340531.3412167(3519-3520)Online publication date: 19-Oct-2020
      • (2020)Smart Tourism System in CalabriaData Science and Social Research II10.1007/978-3-030-51222-4_11(131-144)Online publication date: 26-Nov-2020
      • (2019)Extracting, Mining and Predicting Users' Interests from Social NetworksProceedings of the 42nd International ACM SIGIR Conference on Research and Development in Information Retrieval10.1145/3331184.3331383(1407-1408)Online publication date: 18-Jul-2019
      • (2019)Social User Interest MiningProceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining10.1145/3292500.3332279(3235-3236)Online publication date: 25-Jul-2019
      • (2019)CCSMR: A Combinatorial Category Space-Based Model for RecommendationIEEE Access10.1109/ACCESS.2019.29330287(124502-124513)Online publication date: 2019
      • (2019)Taxonomy-aware collaborative denoising autoencoder for personalized recommendationApplied Intelligence10.1007/s10489-018-1378-949:6(2101-2118)Online publication date: 1-Jun-2019
      • (2018)Recommendations for All: Solving Thousands of Recommendation Problems Daily2018 IEEE 34th International Conference on Data Engineering (ICDE)10.1109/ICDE.2018.00159(1404-1413)Online publication date: Apr-2018
      • (2017)Modeling Consumer Preferences and Price Sensitivities from Large-Scale Grocery Shopping Transaction LogsProceedings of the 26th International Conference on World Wide Web10.1145/3038912.3052568(1103-1112)Online publication date: 3-Apr-2017
      • (2017)ST-SAGEACM Transactions on Intelligent Systems and Technology10.1145/30110198:3(1-25)Online publication date: 20-Apr-2017
      • Show More Cited By

      View Options

      Login options

      View options

      PDF

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader

      Media

      Figures

      Other

      Tables

      Share

      Share

      Share this Publication link

      Share on social media