Skip to main content

Exploiting Cluster Structure in Probabilistic Matrix Factorization

  • Conference paper
  • First Online:
Neural Information Processing (ICONIP 2019)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 1143))

Included in the following conference series:

  • 2209 Accesses

Abstract

Low-rank matrix factorization is a basic model for collaborative filtering. The low-rank matrix approximation model is equivalent to represent users and items by latent factors, and rating is obtained by calculating the inner product of factors. Most low-rank matrix approximation models assume the latent factors come from a common Gaussian distribution. However, users with similar preferences or items of the same type tend to have similar factors, thus there exists cluster structure underlying user factors and item factors. In this paper, we exploit the cluster structure in the low-rank matrix factorization model to improve prediction accuracy. Experimental results on MovieLens-1m and MovieLens-10m datasets demonstrate the effectiveness of the proposed methods.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Beutel, A., Ahmed, A., Smola, A.J.: ACCAMS: additive co-clustering to approximate matrices succinctly. In: International Conference on World Wide Web (2015)

    Google Scholar 

  2. Chen, C., Li, D., Zhao, Y., Lv, Q., Shang, L.: WEMAREC: accurate and scalable recommendation through weighted and ensemble matrix approximation. In: ACM SIGIR International Conference on Research and Development in Information Retrieval (2015)

    Google Scholar 

  3. Geman, S., Geman, D.: Stochastic relaxation, gibbs distributions, and the bayesian restoration of images. IEEE Trans. Pattern Anal. Mach. Intell. 6, 721–741 (1984)

    Article  Google Scholar 

  4. Harper, F.M., Konstan, J.A.: The movielens datasets: history and context. ACM Trans. Interact. Intell. Syst. (TIIS) 5(4), 19 (2016)

    Google Scholar 

  5. Hofmann, T.: Probabilistic latent semantic analysis. In: Fifteenth Conference on Uncertainty in Artificial Intelligence (1999)

    Google Scholar 

  6. Lee, J., Bengio, S., Kim, S., Lebanon, G., Singer, Y.: Local collaborative ranking. In: International Conference on World Wide Web (2014)

    Google Scholar 

  7. Lee, J., Lebanon, G., Lebanon, G., Singer, Y., Bengio, S.: LLORMA: local low-rank matrix approximation. J. Mach. Learn. Res. 17(1), 442–465 (2016)

    MathSciNet  MATH  Google Scholar 

  8. Li, D., Chen, C., Liu, W., Lu, T., Gu, N., Chu, S.: Mixture-rank matrix approximation for collaborative filtering. In: Advances in Neural Information Processing Systems (2017)

    Google Scholar 

  9. Mackey, L., Talwalkar, A., Jordan, M.I.: Divide-and-conquer matrix factorization. In: Advances in Neural Information Processing Systems (2011)

    Google Scholar 

  10. Marlin, B.: Modeling user rating profiles for collaborative filtering. In: Advances in Neural Information Processing Systems (2003)

    Google Scholar 

  11. Marlin, B., Zemel, R.S.: The multiple multiplicative factor model for collaborative filtering. In: International Conference on Machine Learning (2004)

    Google Scholar 

  12. Salakhutdinov, R., Mnih, A.: Probabilistic matrix factorization. In: Advances in Neural Information Processing Systems (2007)

    Google Scholar 

  13. Salakhutdinov, R., Mnih, A.: Bayesian probabilistic matrix factorization using Markov chain Monte Carlo. In: International Conference on Machine Learning (2008)

    Google Scholar 

  14. Shan, H., Banerjee, A.: Generalized probabilistic matrix factorizations for collaborative filtering. In: IEEE International Conference on Data Mining (2011)

    Google Scholar 

  15. Wang, K., Zhao, W.X., Peng, H., Wang, X.: Bayesian probabilistic multi-topic matrix factorization for rating prediction. In: International Joint Conference on Artificial Intelligence (2016)

    Google Scholar 

  16. Xu, B., Bu, J., Chen, C., Cai, D.: An exploration of improving collaborative recommender systems via user-item subgroups. In: International Conference on World Wide Web. ACM (2012)

    Google Scholar 

  17. Zhang, Y., Zhang, M., Liu, Y., Ma, S.: Improve collaborative filtering through bordered block diagonal form matrices. In: ACM SIGIR International Conference on Research and Development in Information Retrieval. ACM (2013)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Jinwen Ma .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Li, T., Ma, J. (2019). Exploiting Cluster Structure in Probabilistic Matrix Factorization. In: Gedeon, T., Wong, K., Lee, M. (eds) Neural Information Processing. ICONIP 2019. Communications in Computer and Information Science, vol 1143. Springer, Cham. https://doi.org/10.1007/978-3-030-36802-9_79

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-36802-9_79

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-36801-2

  • Online ISBN: 978-3-030-36802-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics