Skip to main content

Latent Path Connected Space Model for Recommendation

  • Conference paper
  • First Online:
Web and Big Data (APWeb-WAIM 2019)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 11642))

Abstract

Matrix Factorization (MF) is a latent factor model, which has been one of the most popular techniques for recommendation systems. Performance of MF-based recommender models degrades as the sparseness of user-item rating data increases. MF-based models map each user and each item into a low dimensional space, where either of them is represented by a point in the space. While a point is a concise and simple representation of a user’s preference or an item’s characteristics, it is hard to learn the precise position of the point, especially when the data is very sparse. In this paper we propose an alternative latent space model, Latent Path Connected Space model (LSpace), to address this issue. In this model, users and items are both represented by path connected space described by different latent dimensions and spatial intersection between user space and item space reflects their matching degree. Extensive evaluations on four real-world datasets show that our approach outperforms the Matrix Factorization model on rating prediction task especially when the rating data is extremely sparse.

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 59.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 79.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. Deshpande, M., Karypis, G.: Item-based top-n recommendation algorithms. ACM Trans. Inf. Syst. 22(1), 143–177 (2004)

    Article  Google Scholar 

  2. Herlocker, J.L., Konstan, J.A., Borchers, A., Riedl, J.: An algorithmic framework for performing collaborative filtering. In: Proceedings of the 22nd Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, SIGIR (1999)

    Google Scholar 

  3. Hu, Y., Koren, Y., Volinsky, C.: Collaborative filtering for implicit feedback datasets. In: ICDM (2008)

    Google Scholar 

  4. Salakhutdinov, R., Mnih, A.: Probabilistic matrix factorization. In: Proceedings of the 20th International Conference on Neural Information Processing Systems, NIPS (2007)

    Google Scholar 

  5. He, X., Liao, L., Zhang, H., Nie, L., Hu, X., Chua, T.-S.: Neural collaborative filtering. In: International World Wide Web Conferences Steering Committee, WWW (2017)

    Google Scholar 

  6. Shi, Y., Larson, M., Hanjalic, A.: Collaborative filtering beyond the user-item matrix: a survey of the state of the art and future challenges. ACM Comput. Surv. 47(1), 3 (2014)

    Article  Google Scholar 

  7. Ling, G., Lyu, M.R., King, I.: Ratings meet reviews, a combined approach to recommend. In: Proceedings of the 8th ACM Conference on Recommender Systems, RecSys (2014)

    Google Scholar 

  8. McAuley, J., Leskovec, J.: Hidden factors and hidden topics, understanding rating dimensions with review text. In: Proceedings of the 7th ACM Conference on Recommender Systems, RecSys (2013)

    Google Scholar 

  9. Wang, C., Blei, D.M.: Collaborative topic modeling for recommending scientific articles. In: Proceedings of the 17th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD (2011)

    Google Scholar 

  10. Wang, H., Wang, N., Yeung, D.-Y.: Collaborative deep learning for recommender systems. In: Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD (2015)

    Google Scholar 

  11. Koren, Y., Bell, R., Volinsky, C.: Matrix factorization techniques for recommender systems. Computer 42(8), 30–37 (2009)

    Article  Google Scholar 

  12. Salakhutdinov, R., Mnih, A.: Bayesian probabilistic matrix factorization using Markov chain Monte Carlo. In: Proceedings of the 25th International Conference on Machine Learning. ACM (2008)

    Google Scholar 

  13. Purushotham, S., Liu, Y. Kuo, C.-C.J.: Collaborative topic regression with social matrix factorization for recommendation systems. In: Proceedings of the 29th International Conference on Machine Learning, ICML (2012)

    Google Scholar 

  14. Kim, D., Park, C., Oh, J., Lee, S., Yu, H.: Convolutional matrix factorization for document context-aware recommendation. In: Proceedings of the 8th ACM Conference on Recommender Systems, RecSys (2016)

    Google Scholar 

  15. https://en.wikipedia.org/wiki/Jordan_measure

  16. Kingma, D., Ba, J.: Adam: a method for stochastic optimization. arXiv preprint arXiv:1412.6980 (2014)

  17. https://en.wikipedia.org/wiki/Connected_space#Path_connectedness

Download references

Acknowledgment

This work was supported in part by National Natural Science Foundation of China under grant No. U1711262, 71771131, 71490724 and the MOE Project of Key Research Institute of Humanities and Social Sciences at Universities with grant No.17JJD630006.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Jun He .

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

Mei, L., He, J., Liu, H., Du, X. (2019). Latent Path Connected Space Model for Recommendation. In: Shao, J., Yiu, M., Toyoda, M., Zhang, D., Wang, W., Cui, B. (eds) Web and Big Data. APWeb-WAIM 2019. Lecture Notes in Computer Science(), vol 11642. Springer, Cham. https://doi.org/10.1007/978-3-030-26075-0_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-26075-0_13

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-26074-3

  • Online ISBN: 978-3-030-26075-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics