Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
research-article

Adaptive Local Low-rank Matrix Approximation for Recommendation

Published: 16 October 2019 Publication History

Abstract

Low-rank matrix approximation (LRMA) has attracted more and more attention in the community of recommendation. Even though LRMA-based recommendation methods (including Global LRMA and Local LRMA) obtain promising results, they suffer from the complicated structure of the large-scale and sparse rating matrix, especially when the underlying system includes a large set of items with various types and a huge amount of users with diverse interests. Thus, they have to predefine the important parameters, such as the rank of the rating matrix and the number of submatrices. Moreover, most existing Local LRMA methods are usually designed in a two-phase separated framework and do not consider the missing mechanisms of rating matrix. In this article, a non-parametric unified Bayesian graphical model is proposed for Adaptive Local low-rank Matrix Approximation (ALoMA). ALoMA has ability to simultaneously identify rating submatrices, determine the optimal rank for each submatrix, and learn the submatrix-specific user/item latent factors. Meanwhile, the missing mechanism is adopted to characterize the whole rating matrix. These four parts are seamlessly integrated and enhance each other in a unified framework. Specifically, the user-item rating matrix is adaptively divided into proper number of submatrices in ALoMA by exploiting the Chinese Restaurant Process. For each submatrix, by considering both global/local structure information and missing mechanisms, the latent user/item factors are identified in an optimal latent space by adopting automatic relevance determination technique. We theoretically analyze the model’s generalization error bounds and give an approximation guarantee. Furthermore, an efficient Gibbs sampling-based algorithm is designed to infer the proposed model. A series of experiments have been conducted on six real-world datasets (Epinions, Douban, Dianping, Yelp, Movielens (10M), and Netflix). The results demonstrate that ALoMA outperforms the state-of-the-art LRMA-based methods and can easily provide interpretable recommendation results.

References

[1]
Michal Aharon, Michal Elad, and Alfred Bruckstein. 2006. SVD: An algorithm for designing overcomplete dictionaries for sparse representation. IEEE Trans. Sign. Process. 54, 11 (2006), 4311--4322.
[2]
Chris Anderson. 2006. The Long Tail: Why the Future of Business Is Selling Less of More. Hyperion.
[3]
Christophe Andrieu, Nando De Freitas, Arnaud Doucet, and Michael I. Jordan. 2003. An introduction to mcmc for machine learning. Mach. Learn. 50, 1--2 (2003), 5--43.
[4]
Alex Beutel, Amr Ahmed, and Alex Smola. 2015. ACCAMS: Additive co-clustering to approximate matrices succinctly. In Proceedings of the International Conference on World Wide Web. 119--129.
[5]
Alex Beutel, Kenton Murray, Christos Faloutsos, and Alexander J. Smola. 2014. Cobafi: Collaborative Bayesian filtering. In Proceedings of the International Conference on World Wide Web. ACM, 97--108.
[6]
Bence Bolgar and Peter Antal. 2016. Bayesian matrix factorization with non-random missing data using informative gaussian process priors and soft evidences. In Proceedings of the International Conference on Probabilistic Graphical Models. 25--36.
[7]
Emmanuel J. Candes and Yaniv Plan. 2011. Matrix completion with noise. Proc. IEEE 98, 6 (2011), 925--936.
[8]
Emmanuel J. Candès and Benjamin Recht. 2009. Exact matrix completion via convex optimization. Found. Comput. Math. 9, 6 (2009), 717.
[9]
Chao Chen, Dongsheng Li, Qin Lv, Junchi Yan, Stephen M. Chu, and Li Shang. 2016. MPMA: Mixture probabilistic matrix approximation for collaborative filtering. In Proceedings of the International Joint Conference on Artificial Intelligent. 1382--1388.
[10]
Chao Chen, Dongsheng Li, Qin Lv, Junchi Yan, Li Shang, and Stephen M. Chu. 2017. GLOMA: Embedding global information in local matrix approximation models for collaborative filtering. In Proceedings of the AAAI Conference on Artificial Intelligence. 1295--1301.
[11]
Chao Chen, Dongsheng Li, Yingying Zhao, Qin Lv, and Li Shang. 2015. WEMAREC: Accurate and scalable recommendation through weighted and ensemble matrix approximation. In Proceedings of the ACM SIGIR Conference on Research and Development in Information Retrieval. ACM, 303--312.
[12]
Loc Do and Hady Wirawan Lauw. 2016. Probabilistic models for contextual agreement in preferences. ACM Trans. Inf. Syst. 34, 4, Article 21 (June 2016), 33 pages.
[13]
Thomas L. Griffiths, Michael I. Jordan, Joshua B. Tenenbaum, and David M. Blei. 2004. Hierarchical topic models and the nested chinese restaurant process. In Proceedings of the International Conference on Neural Information Processing Systems. 17--24.
[14]
Jonathan L. Herlocker, Joseph A. Konstan, Loren G. Terveen, and John T. Riedl. 2004. Evaluating collaborative filtering recommender systems. ACM Trans. Inf. Syst. 22, 1 (Jan. 2004), 5--53.
[15]
José Miguel Hernández-Lobato, Neil Houlsby, and Zoubin Ghahramani. 2014. Probabilistic matrix factorization with non-random missing data. In Proceedings of the International Conference on Machine Learning. 1512--1520.
[16]
Yehuda Koren, Robert Bell, and Chris Volinsky. 2009. Matrix factorization techniques for recommender systems. Computer 42, 8 (2009), 30--37.
[17]
Joonseok Lee, Seungyeon Kim, Guy Lebanon, and Yoram Singer. 2013. Local low-rank matrix approximation. In Proceedings of the International Conference on Machine Learning. 82--90.
[18]
Dongsheng Li, Chao Chen, Wei Liu, Tun Lu, Ning Gu, and Stephen Chu. 2017. Mixture-rank matrix approximation for collaborative filtering. In Proceedings of the International Conference on Neural Information Processing Systems. 477--485.
[19]
Dongsheng Li, Chao Chen, Qin Lv, Junchi Yan, Li Shang, and Stephen Chu. 2016. Low-rank matrix approximation with stability. In Proceedings of the International Conference on Machine Learning. 295--303.
[20]
Hui Li, Dingming Wu, Wweibing Tang, and Ninos Mamoulis. 2015. Overlapping community regularization for rating prediction in social recommender systems. In Proceedings of ACM Conference on Recommender Systems. 27--34.
[21]
Roderick J. A. Little and Donald B. Rubin. 2014. Statistical Analysis with Missing Data (2nd ed.). Vol. 333. John Wiley 8 Sons.
[22]
Hao Ma, Dengyong Zhou, Chao Liu, Michael R. Lyu, and Irwin King. 2011. Recommender systems with social regularization. In Proceedings of ACM Conference on Web Search and Web Data Mining. ACM, 287--296.
[23]
Lester W. Mackey, Michael I. Jordan, and Ameet Talwalkar. 2011. Divide-and-conquer matrix factorization. In Proceedings of the International Conference on Neural Information Processing Systems. 1134--1142.
[24]
Benjamin Marlin, Richard S. Zemel, Sam Roweis, and Malcolm Slaney. 2012. Collaborative Filtering and the Missing at Random Assumption. 2012.
[25]
Benjamin M. Marlin and Richard S. Zemel. 2009. Collaborative prediction and ranking with non-random missing data. In Proceedings of the ACM Conference on Recommender Systems. 5--12.
[26]
Paolo Massa and Paolo Avesani. 2007. Trust-aware recommender systems. In Proceedings of ACM Conference on Recommender Systems. 17--24.
[27]
Radford M. Neal. 1996. Bayesian Learning for Neural Networks. Springer. 456--456 pages.
[28]
Shohei Ohsawa, Yachiko Obara, and Takayuki Osogami. 2016. Gated probabilistic matrix factorization: Learning users’ attention from missing values. In Proceedings of the International Joint Conference on Artificial Intelligence. AAAI Press, 1888--1894.
[29]
Ruslan Salakhutdinov and Andriy Mnih. 2007. Probabilistic matrix factorization. In Proceedings of International Conference on Machine Learning. 880--887.
[30]
Ruslan Salakhutdinov and Andriy Mnih. 2008. Bayesian probabilistic matrix factorization using Markov chain monte carlo. In Proceedings of the International Conference on Machine Learning. 880--887.
[31]
Lei Shi, Wayne Xin Zhao, and Yi-Dong Shen. 2017. Local representative-based matrix factorization for cold-start recommendation. ACM Transation on Information System 36, 2, Article 22 (Aug. 2017), 28 pages.
[32]
Ruoyu Sun and Zhi-Quan Luo. 2016. Guaranteed matrix completion via non-convex factorization. IEEE Trans. Inf. Theory 62, 11 (2016), 6535--6579.
[33]
Keqiang Wang, Wayne Xin Zhao, Hongwei Peng, and Xiaoling Wang. 2016. Bayesian probabilistic multi-topic matrix factorization for rating prediction. In Proceedings of the International Joint Conference on Artificial Intelligent. 3910--3916.
[34]
David P. Wipf and Bhaskar D. Rao. 2007. An empirical Bayesian strategy for solving the simultaneous sparse approximation problem. IEEE Trans. Sign. Process. 55, 7 (2007), 3704--3716.
[35]
Yao Wu, Xudong Liu, Min Xie, Martin Ester, and Qing Yang. 2016. CCCF: Improving collaborative filtering via scalable user-item co-clustering. In Proceedings of the International Conference on Web Search and Data Mining. ACM, 73--82.
[36]
Menghao Zhang, Binbin Hu, Chuan Shi, and Bai Wang. 2017. Local low-rank matrix approximation with preference selection of anchor points. In Proceedings of the International Conference on World Wide Web. 1395--1403.
[37]
Yongfeng Zhang, Min Zhang, Yiqun Liu, and Shaoping Ma. 2013. Improve collaborative filtering through bordered block diagonal form matrices. In Proceedings of the ACM SIGIR Conference on Research and Development in Information Retrieval. ACM, 313--322.

Cited By

View all
  • (2021)Exploiting Real-time Search Engine Queries for Earthquake Detection: A Summary of ResultsACM Transactions on Information Systems10.1145/345384239:3(1-32)Online publication date: 25-May-2021
  • (2021)Bayesian Additive Matrix Approximation for Social RecommendationACM Transactions on Knowledge Discovery from Data10.1145/345139116:1(1-34)Online publication date: 20-Jul-2021
  • (2020)Research Progress of Trust Evaluation2020 13th International Congress on Image and Signal Processing, BioMedical Engineering and Informatics (CISP-BMEI)10.1109/CISP-BMEI51763.2020.9263498(1081-1086)Online publication date: 17-Oct-2020

Index Terms

  1. Adaptive Local Low-rank Matrix Approximation for Recommendation

      Recommendations

      Comments

      Information & Contributors

      Information

      Published In

      cover image ACM Transactions on Information Systems
      ACM Transactions on Information Systems  Volume 37, Issue 4
      October 2019
      299 pages
      ISSN:1046-8188
      EISSN:1558-2868
      DOI:10.1145/3357218
      Issue’s Table of Contents
      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: 16 October 2019
      Accepted: 01 July 2019
      Revised: 01 July 2019
      Received: 01 August 2018
      Published in TOIS Volume 37, Issue 4

      Permissions

      Request permissions for this article.

      Check for updates

      Author Tags

      1. Recommendation system
      2. clustering
      3. probabilistic graphical model

      Qualifiers

      • Research-article
      • Research
      • Refereed

      Funding Sources

      Contributors

      Other Metrics

      Bibliometrics & Citations

      Bibliometrics

      Article Metrics

      • Downloads (Last 12 months)53
      • Downloads (Last 6 weeks)10
      Reflects downloads up to 03 Oct 2024

      Other Metrics

      Citations

      Cited By

      View all
      • (2021)Exploiting Real-time Search Engine Queries for Earthquake Detection: A Summary of ResultsACM Transactions on Information Systems10.1145/345384239:3(1-32)Online publication date: 25-May-2021
      • (2021)Bayesian Additive Matrix Approximation for Social RecommendationACM Transactions on Knowledge Discovery from Data10.1145/345139116:1(1-34)Online publication date: 20-Jul-2021
      • (2020)Research Progress of Trust Evaluation2020 13th International Congress on Image and Signal Processing, BioMedical Engineering and Informatics (CISP-BMEI)10.1109/CISP-BMEI51763.2020.9263498(1081-1086)Online publication date: 17-Oct-2020

      View Options

      Get Access

      Login options

      Full Access

      View options

      PDF

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader

      HTML Format

      View this article in HTML Format.

      HTML Format

      Media

      Figures

      Other

      Tables

      Share

      Share

      Share this Publication link

      Share on social media