skip to main content
10.1145/3018661.3018689acmconferencesArticle/Chapter ViewAbstractPublication PageswsdmConference Proceedingsconference-collections
research-article
Open Access

Recurrent Recommender Networks

Published:02 February 2017Publication History

ABSTRACT

Recommender systems traditionally assume that user profiles and movie attributes are static. Temporal dynamics are purely reactive, that is, they are inferred after they are observed, e.g. after a user's taste has changed or based on hand-engineered temporal bias corrections for movies. We propose Recurrent Recommender Networks (RRN) that are able to predict future behavioral trajectories. This is achieved by endowing both users and movies with a Long Short-Term Memory (LSTM) autoregressive model that captures dynamics, in addition to a more traditional low-rank factorization. On multiple real-world datasets, our model offers excellent prediction accuracy and it is very compact, since we need not learn latent state but rather just the state transition function.

References

  1. A. Anandkumar, R. Ge, D. Hsu, S. M. Kakade, and M. Telgarsky. Tensor decompositions for learning latent variable models. arXiv preprint arXiv:1210.7559, 2012.Google ScholarGoogle Scholar
  2. C. Andrieu, N. de Freitas, A. Doucet, and M. I. Jordan. An introduction to mcmc for machine learning. Machine Learning, 50:5--43, 2003. Google ScholarGoogle ScholarCross RefCross Ref
  3. Y. Bengio, P. Lamblin, D. Popovici, H. Larochelle, et al. Greedy layer-wise training of deep networks. NIPS, 19:153, 2007.Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. J. Bennett and S. Lanning. The netflix prize. In Proceedings of KDD Cup and Workshop, volume 2007, page 35, 2007.Google ScholarGoogle Scholar
  5. A. Beutel, A. Ahmed, and A. J. Smola. ACCAMS: Additive co-clustering to approximate matrices succinctly. In WWW, pages 119--129. ACM, 2015.Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. T. Chen, M. Li, Y. Li, M. Lin, N. Wang, M. W. T. Xiao, B. Xu, C. Zhang, and Z. Zhang. MXNet: A flexible and efficient machine learning library for heterogeneous distributed systems. arXiv preprint arXiv:1512.01274, 2015. [7] J. Chung, C. Gulcehre, K. Cho, and Y. Bengio. Gated feedback recurrent neural networks. arXiv preprint arXiv:1502.02367, 2015.Google ScholarGoogle Scholar
  7. C. Danescu-Niculescu-Mizil, R. West, D. Jurafsky, J. Leskovec, and C. Potts. No country for old members: User lifecycle and linguistic change in online communities. In WWW, pages 307--318, 2013.Google ScholarGoogle Scholar
  8. M. Deshpande and G. Karypis. Selective markov models for predicting web page accesses. ACM Transactions on Internet Technology (TOIT), 4(2):163--184, 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. Q. Diao, M. Qiu, C.-Y. Wu, A. J. Smola, J. Jiang, and C. Wang. Jointly modeling aspects, ratings and sentiments for movie recommendation (jmars). In SIGKDD, pages 193--202. ACM, 2014. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. S. Frederick and G. Loewenstein. Hedonic adaptation. D. Kahneman, E. Diener, and N. Schwarz (Eds.), Well being. The foundations of hedonic psychology, 1999.Google ScholarGoogle Scholar
  11. A. Graves. Generating sequences with recurrent neural networks. arXiv preprint arXiv:1308.0850, 2013.Google ScholarGoogle Scholar
  12. B. Hidasi, A. Karatzoglou, L. Baltrunas, and D. Tikk. Session-based recommendations with recurrent neural networks. arXiv preprint arXiv:1511.06939, 2015.Google ScholarGoogle Scholar
  13. S. Hochreiter and J. Schmidhuber. Long short-term memory. Neural computation, 9(8):1735--1780, 1997. [15] D. Kingma and J. Ba. Adam: A method for stochastic optimization. arXiv preprint arXiv:1412.6980, 2014.Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. Y. Koren. Collaborative filtering with temporal dynamics. In Knowledge discovery and data mining KDD, pages 447--456, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. A. Kyrola, G. Blelloch, and C. Guestrin. GraphChi: Large-scale graph computation on just a pc. In OSDI, 2012. [18] S. Roweis and Z. Ghahramani. A unifying review of linear Gaussian models. Neural Computation, 11(2), 1999.Google ScholarGoogle Scholar
  16. R. Salakhutdinov and A. Mnih. Probabilistic matrix factorization. In NIPS, volume 20, 2008.Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. B. Sarwar, G. Karypis, J. Konstan, and J. Riedl. Item-based collaborative filtering recommendation algorithms. In WWW, pages 285--295. ACM, 2001. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. S. Sedhain, A. K. Menon, S. Sanner, and L. Xie. Autorec: Autoencoders meet collaborative filtering. In WWW Companion, pages 111--112, 2015. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. L. Song, B. Boots, S. Siddiqi, G. Gordon, and A. J. Smola. Hilbert space embeddings of hidden markov models. In ICML, 2010.Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. C.-Y. Wu, C. V. Alvino, A. J. Smola, and J. Basilico. Using navigation to improve recommendations in real-time. In RecSys, pages 341--348. ACM, 2016. Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. H.-F. Yu, C.-J. Hsieh, S. Si, and I. S. Dhillon. Scalable coordinate descent approaches to parallel matrix factorization for recommender systems. In ICDM, 2012. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Recurrent Recommender Networks

    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 '17: Proceedings of the Tenth ACM International Conference on Web Search and Data Mining
      February 2017
      868 pages
      ISBN:9781450346757
      DOI:10.1145/3018661

      Copyright © 2017 Owner/Author

      Permission to make digital or hard copies of part or all 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 third-party components of this work must be honored. For all other uses, contact the Owner/Author.

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      • Published: 2 February 2017

      Check for updates

      Qualifiers

      • research-article

      Acceptance Rates

      WSDM '17 Paper Acceptance Rate80of505submissions,16%Overall Acceptance Rate498of2,863submissions,17%

      Upcoming Conference

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader