Exploiting Incidence Relation Between Subgroups for Improving Clustering-Based Recommendation Model

  • Zhipeng Wu
  • Hui TianEmail author
  • Xuzhen Zhu
  • Shaoshuai Fan
  • Shuo Wang
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 11295)


Matrix factorization (MF) has been attracted much attention in recommender systems due to its extensibility and high accuracy. Recently, some clustering-based MF recommendation methods have been proposed in succession to capture the associations between related users (items). However, these methods only use the subgroup data to build local models, so they will suffer the over-fitting problem caused by insufficient data in the process of training. In this paper, we analyse the incidence relation between subgroups of users (items) and then propose two single improved clustering-based MF models. Through exploiting these relations between subgroups, the local model in each subgroup can obtain global information from other subgroups, which can mitigate the over-fitting problem. Above all, we generate an ensemble model by combining the two single models for capturing associations between users and associations between items at the same time. Experimental results on different scales of MovieLens datasets demonstrate that our method outperforms state-of-the-art clustering-based recommendation methods, especially on sparse datasets.


Recommender system Clustering method Matrix factorization Incidence relation 



This work was supported by the National Natural Science Foundation of China (No. 61602048) and the Fundamental Research Funds for the Central Universities (No. NST20170206).


  1. 1.
    Basilico, J., Raimond, Y.: Recommending for the world. In: Proceedings of the 10th ACM Conference on Recommender Systems, pp. 375–375. ACM, Boston (2016)Google Scholar
  2. 2.
    Bell, R.M., Koren, Y.: Scalable collaborative filtering with jointly derived neighborhood interpolation weights. In: Proceedings of the 2007 Seventh IEEE International Conference on Data Mining, pp. 43–52. IEEE Computer Society, Washington, DC (2007)Google Scholar
  3. 3.
    Cao, D., et al.: Cross-platform app recommendation by jointly modeling ratings and texts. ACM Trans. Inf. Syst. 35(4), 37:1–37:27 (2017)CrossRefGoogle Scholar
  4. 4.
    Chen, C., Li, D., Lv, Q., Yan, J., Shang, L., Chu, S.: GLOMA: embedding global information in local matrix approximation models for collaborative filtering. In: AAAI Conference on Artificial Intelligence (2017)Google Scholar
  5. 5.
    Chen, C., Li, D., Zhao, Y., Lv, Q., Shang, L.: WEMAREC: accurate and scalable recommendation through weighted and ensemble matrix approximation. In: International ACM SIGIR Conference on Research and Development in Information Retrieval, pp. 303–312 (2015)Google Scholar
  6. 6.
    O’Connor, M.: Clustering items for collaborative filtering. In: ACM SIGIR Workshop on Recommender Systems: Algorithms and Evaluation (1999)Google Scholar
  7. 7.
    Devooght, R., Kourtellis, N., Mantrach, A.: Dynamic matrix factorization with priors on unknown values. In: Proceedings of the 21st International Conference on Knowledge Discovery and Data Mining, pp. 189–198. ACM (2015)Google Scholar
  8. 8.
    Hu, J., Li, P.: Collaborative filtering via additive ordinal regression. In: Proceedings of the 11th ACM International Conference on Web Search and Data Mining, pp. 243–251. ACM, Marina Del Rey (2018)Google Scholar
  9. 9.
    Koren, Y.: Factorization meets the neighborhood: a multifaceted collaborative filtering model. In: Proceedings of the 14th International Conference on Knowledge Discovery and Data Mining, pp. 426–434. ACM, Las Vegas (2008)Google Scholar
  10. 10.
    Koren, Y., Bell, R., Volinsky, C.: Matrix factorization techniques for recommender systems. Computer 42(8), 30–37 (2009)CrossRefGoogle Scholar
  11. 11.
    Li, D., Chen, C.: MPMA: mixture probabilistic matrix approximation for collaborative filtering. In: International Joint Conference on Artificial Intelligence (2016)Google Scholar
  12. 12.
    Luo, X., Zhou, M., Li, S., You, Z., Xia, Y., Zhu, Q.: A nonnegative latent factor model for large-scale sparse matrices in recommender systems via alternating direction method. IEEE Trans. Neural Netw. Learn. Syst. 27(3), 579–592 (2016)MathSciNetCrossRefGoogle Scholar
  13. 13.
    Paterek, A.: Improving regularized singular value decomposition for collaborative filtering. In: Proceedings of KDD Cup and Workshop (2007)Google Scholar
  14. 14.
    Ricci, F., Rokach, L., Shapira, B.: Recommender systems: introduction and challenges. In: Ricci, F., Rokach, L., Shapira, B. (eds.) Recommender Systems Handbook, pp. 1–34. Springer, Boston (2015). Scholar
  15. 15.
    Salakhutdinov, R., Mnih, A.: Probabilistic matrix factorization. In: International Conference on Neural Information Processing Systems, pp. 1257–1264 (2007)Google Scholar
  16. 16.
    Salakhutdinov, R., Mnih, A.: Bayesian probabilistic matrix factorization using Markov chain Monte Carlo. In: Proceedings of the 25th International Conference on Machine Learning, pp. 880–887. ACM, Helsinki (2008)Google Scholar
  17. 17.
    Wu, Z., Tian, H., Zhu, X., Wang, S.: Optimization matrix factorization recommendation algorithm based on rating centrality. In: Tan, Y., Shi, Y., Tang, Q. (eds.) DMBD 2018. LNCS, vol. 10943, pp. 114–125. Springer, Cham (2018)CrossRefGoogle Scholar
  18. 18.
    Yuan, T., Cheng, J., Zhang, X., Qiu, S., Lu, H.: Recommendation by mining multiple user behaviors with group sparsity. In: AAAI Conference on Artificial Intelligence, pp. 222–228 (2014)Google Scholar
  19. 19.
    Zhang, J., Chow, C., Xu, J.: Enabling kernel-based attribute-aware matrix factorization for rating prediction. IEEE Trans. Knowl. Data Eng. 29(4), 798–812 (2017)CrossRefGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  • Zhipeng Wu
    • 1
  • Hui Tian
    • 1
    Email author
  • Xuzhen Zhu
    • 1
  • Shaoshuai Fan
    • 1
  • Shuo Wang
    • 1
  1. 1.State Key Laboratory of Networking and Switching TechnologyBeijing University of Posts and TelecommunicationsBeijingChina

Personalised recommendations