A cross cluster-based collaborative filtering method for recommendation

As the clustering-based model has better scalability than typical collaborative filtering methods, it has become one of the most successful approaches for recommender systems. However, since clustering-based algorithms often result in nearby users being divided into different clusters, they only recommend items being rated by users belonging to the same cluster with the active user, and recommendation opportunities are missed for some users because of the loss of nearby users. In this paper, we propose a cross cluster-based method to take more recommendation opportunities by considering nearby users through merging of neighbors in user clusters. We define an associate degree to find the neighboring clusters. Experimental results on real data sets have shown that the proposed method can improve the accuracy of recommendation.

[1]  John Riedl,et al.  Recommender Systems for Large-scale E-Commerce : Scalable Neighborhood Formation Using Clustering , 2002 .

[2]  Thomas S. Huang,et al.  Graph Regularized Nonnegative Matrix Factorization for Data Representation. , 2011, IEEE transactions on pattern analysis and machine intelligence.

[3]  Taghi M. Khoshgoftaar,et al.  A Survey of Collaborative Filtering Techniques , 2009, Adv. Artif. Intell..

[4]  Srujana Merugu,et al.  A scalable collaborative filtering framework based on co-clustering , 2005, Fifth IEEE International Conference on Data Mining (ICDM'05).

[5]  Gerhard Friedrich,et al.  Recommender Systems: Collaborative recommendation , 2010 .

[6]  David M. Pennock,et al.  Categories and Subject Descriptors , 2001 .

[7]  Bracha Shapira,et al.  Recommender Systems Handbook , 2015, Springer US.

[8]  Licia Capra,et al.  Temporal diversity in recommender systems , 2010, SIGIR.

[9]  Lior Rokach,et al.  Introduction to Recommender Systems Handbook , 2011, Recommender Systems Handbook.

[10]  Sergio A. Alvarez,et al.  Efficient Adaptive-Support Association Rule Mining for Recommender Systems , 2004, Data Mining and Knowledge Discovery.

[11]  John Riedl,et al.  Application of Dimensionality Reduction in Recommender System - A Case Study , 2000 .

[12]  Jonathan L. Herlocker,et al.  Clustering items for collaborative filtering , 1999 .

[13]  Gerhard Friedrich,et al.  Recommender Systems - An Introduction , 2010 .

[14]  Kenneth H. Rosen,et al.  Discrete Mathematics and its applications , 2000 .

[15]  D. Heckerman,et al.  Dependency networks for inference , 2000 .

[16]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[17]  Chun Chen,et al.  An exploration of improving collaborative recommender systems via user-item subgroups , 2012, WWW.

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

[19]  David Maxwell Chickering,et al.  Dependency Networks for Inference, Collaborative Filtering, and Data Visualization , 2000, J. Mach. Learn. Res..

[20]  John Riedl,et al.  Analysis of recommendation algorithms for e-commerce , 2000, EC '00.

[21]  Korris Fu-Lai Chung,et al.  Knowledge and Information Systems , 2017 .

[22]  Chi-Yin Chow,et al.  Efficient Evaluation of k-Range Nearest Neighbor Queries in Road Networks , 2010, 2010 Eleventh International Conference on Mobile Data Management.

[23]  Nathan Srebro,et al.  Fast maximum margin matrix factorization for collaborative prediction , 2005, ICML.

[24]  Douglas B. Terry,et al.  Using collaborative filtering to weave an information tapestry , 1992, CACM.