Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content

Exploiting Implicit Item Relationships for Recommender Systems

  • Conference paper
  • First Online:
User Modeling, Adaptation and Personalization (UMAP 2015)

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

Abstract

Collaborative filtering inherently suffers from the data sparsity and cold start problems. Social networks have been shown useful to help alleviate these issues. However, social connections may not be available in many real systems, whereas implicit item relationships are lack of study. In this paper, we propose a novel matrix factorization model by taking into account implicit item relationships. Specifically, we employ an adapted association rule technique to reveal implicit item relationships in terms of item-to-item and group-to-item associations, which are then used to regularize the generation of low-rank user- and item-feature matrices. Experimental results on four real-world datasets demonstrate the superiority of our proposed approach against other counterparts.

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Guo, G., Zhang, J., Thalmann, D.: A simple but effective method to incorporate trusted neighbors in recommender systems. In: Masthoff, J., Mobasher, B., Desmarais, M.C., Nkambou, R. (eds.) UMAP 2012. LNCS, vol. 7379, pp. 114–125. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  2. Ma, H., King, I., Lyu, M.: Learning to recommend with social trust ensemble. In: Proceedings of the 32nd International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR), pp. 203–210 (2009)

    Google Scholar 

  3. Jamali, M., Ester, M.: A matrix factorization technique with trust propagation for recommendation in social networks. In: Proceedings of the 4th ACM Conference on Recommender Systems (RecSys), pp. 135–142 (2010)

    Google Scholar 

  4. Ma, H., Zhou, D., Liu, C., Lyu, M., King, I.: Recommender systems with social regularization. In: Proceedings of the 4th ACM International Conference on Web Search and Data Mining (WSDM), pp. 287–296 (2011)

    Google Scholar 

  5. Yang, B., Lei, Y., Liu, D., Liu, J.: Social collaborative filtering by trust. In: Proceedings of the 23rd International Joint Conference on Artificial Intelligence (IJCAI), pp. 2747–2753 (2013)

    Google Scholar 

  6. Koren, Y.: Factorization meets the neighborhood: a multifaceted collaborative filtering model. In: Proceedings of the 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD), pp. 426–434 (2008)

    Google Scholar 

  7. Guo, G., Zhang, J., Yorke-Smith, N.: Trustsvd: Collaborative filtering with both the explicit and implicit influence of user trust and of item ratings. In: Proceedings of the 29th AAAI Conference on Artificial Intelligence (AAAI) (2015)

    Google Scholar 

  8. Kim, C., Kim, J.: A recommendation algorithm using multi-level association rules. In: Proceedings of 2003 IEEE/WIC International Conference on Web Intelligence (WI), pp. 524–527 (2003)

    Google Scholar 

  9. Shi, Y., Larson, M., Hanjalic, A.: Tags as bridges between domains: improving recommendation with tag-induced cross-domain collaborative filtering. In: Konstan, J.A., Conejo, R., Marzo, J.L., Oliver, N. (eds.) UMAP 2011. LNCS, vol. 6787, pp. 305–316. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  10. Hu, L., Sun, A., Liu, Y.: Your neighbors affect your ratings: on geographical neighborhood influence to rating prediction. In: Proceedings of the 37th International ACM SIGIR Conference on Research & Development in Information Retrieval (SIGIR), pp. 345–354 (2014)

    Google Scholar 

  11. Wang, D., Ma, J., Lian, T., L., G.: Recommendation based on weighted social trusts and item relationships. In: Proceedings of the 29th Annual ACM Symposium on Applied Computing (SAC), pp. 2000–2005 (2014)

    Google Scholar 

  12. Guo, G., Zhang, J., Yorke-Smith, N.: A novel Bayesian similarity measure for recommender systems. In: Proceedings of the 23rd International Joint Conference on Artificial Intelligence (IJCAI), pp. 2619–2625 (2013)

    Google Scholar 

  13. Salakhutdinov, R., Mnih, A.: Probabilistic matrix factorization. Advances in Neural Information Processing Systems (NIPS) 20, 1257–1264 (2008)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Zhu Sun .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Sun, Z., Guo, G., Zhang, J. (2015). Exploiting Implicit Item Relationships for Recommender Systems. In: Ricci, F., Bontcheva, K., Conlan, O., Lawless, S. (eds) User Modeling, Adaptation and Personalization. UMAP 2015. Lecture Notes in Computer Science(), vol 9146. Springer, Cham. https://doi.org/10.1007/978-3-319-20267-9_21

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-20267-9_21

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-20266-2

  • Online ISBN: 978-3-319-20267-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics