Top-N Recommendation via Joint Cross-Domain User Clustering and Similarity Learning

A cross-domain recommendation algorithm exploits user preferences from multiple domains to solve the data sparsity and cold-start problems, in order to improve the recommendation accuracy. In this study, we propose an efficient Joint cross-domain user Clustering and Similarity Learning recommendation algorithm, namely JCSL. We formulate a joint objective function to perform adaptive user clustering in each domain, when calculating the user-based and cluster-based similarities across the multiple domains. In addition, the objective function uses an \(L_{2,1}\) regularization term, to consider the sparsity that occurs in the user-based and cluster-based similarities between multiple domains. The joint problem is solved via an efficient alternating optimization algorithm, which adapts the clustering solutions in each iteration so as to jointly compute the user-based and cluster-based similarities. Our experiments on ten cross-domain recommendation tasks show that JCSL outperforms other state-of-the-art cross-domain strategies.

[1]  Patrick Seemann,et al.  Matrix Factorization Techniques for Recommender Systems , 2014 .

[2]  Huan Liu,et al.  Social recommendation: a review , 2013, Social Network Analysis and Mining.

[3]  Feiping Nie,et al.  Efficient and Robust Feature Selection via Joint ℓ2, 1-Norms Minimization , 2010, NIPS.

[4]  Shou-De Lin,et al.  Matching users and items across domains to improve the recommendation quality , 2014, KDD.

[5]  William W. Cohen,et al.  Power Iteration Clustering , 2010, ICML.

[6]  Qi Gao,et al.  Analyzing Cross-System User Modeling on the Social Web , 2011, ICWE.

[7]  Guandong Xu,et al.  Personalized recommendation via cross-domain triadic factorization , 2013, WWW.

[8]  Paolo Cremonesi,et al.  Cross-Domain Recommender Systems , 2011, 2011 IEEE 11th International Conference on Data Mining Workshops.

[9]  Qiang Yang,et al.  Transfer Learning in Collaborative Filtering for Sparsity Reduction , 2010, AAAI.

[10]  Roberto Turrin,et al.  Performance of recommender algorithms on top-n recommendation tasks , 2010, RecSys '10.

[11]  Prateek Jain,et al.  Low-rank matrix completion using alternating minimization , 2012, STOC '13.

[12]  Charles X. Ling,et al.  Improving Top-N Recommendation for Cold-Start Users via Cross-Domain Information , 2015, TKDD.

[13]  Bin Li,et al.  Cross-Domain Collaborative Filtering: A Brief Survey , 2011, 2011 IEEE 23rd International Conference on Tools with Artificial Intelligence.

[14]  H. Sebastian Seung,et al.  Algorithms for Non-negative Matrix Factorization , 2000, NIPS.

[15]  Chao Liu,et al.  Recommender systems with social regularization , 2011, WSDM '11.

[16]  Ronald Chung,et al.  Integrated personal recommender systems , 2007, ICEC.

[17]  Hao Luo,et al.  Cross-Domain Recommendation via Cluster-Level Latent Factor Model , 2013, ECML/PKDD.

[18]  Francesco Ricci,et al.  Location-aware music recommendation using auto-tagging and hybrid matching , 2013, RecSys.

[19]  Wei Cheng,et al.  Flexible and robust co-regularized multi-domain graph clustering , 2013, KDD.

[20]  Tsvi Kuflik,et al.  Distributed collaborative filtering with domain specialization , 2007, RecSys '07.

[21]  Qiang Yang,et al.  Can Movies and Books Collaborate? Cross-Domain Collaborative Filtering for Sparsity Reduction , 2009, IJCAI.

[22]  Liang-Tien Chia,et al.  Laplacian Sparse Coding, Hypergraph Laplacian Sparse Coding, and Applications , 2013, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[23]  Shi Zhong,et al.  Efficient online spherical k-means clustering , 2005, Proceedings. 2005 IEEE International Joint Conference on Neural Networks, 2005..

[24]  Liang Du,et al.  Towards Robust Co-Clustering , 2013, IJCAI.

[25]  Martha Larson,et al.  Collaborative Filtering beyond the User-Item Matrix , 2014, ACM Comput. Surv..