A general collaborative filtering framework based on matrix bordered block diagonal forms

Recommender systems based on Collaborative Filtering (CF) techniques have achieved great success in e-commerce, social networks and various other applications on the Web. However, problems such as data sparsity and scalability are still important issues to be investigated in CF algorithms. In this paper, we present a novel CF framework that is based on Bordered Block Diagonal Form (BBDF) matrices attempting to meet the challenges of data sparsity and scalability. In this framework, general and special interests of users are distinguished, which helps to improve prediction accuracy in collaborative filtering tasks. Experimental results on four real-world datasets show that the proposed framework helps many traditional CF algorithms to make more accurate rating predictions. Moreover, by leveraging smaller and denser submatrices to make predictions, this framework contributes to the scalability of recommender systems.

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

[2]  Ümit V. Çatalyürek,et al.  Permuting Sparse Rectangular Matrices into Block-Diagonal Form , 2004, SIAM J. Sci. Comput..

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

[4]  Yehuda Koren,et al.  Scalable Collaborative Filtering with Jointly Derived Neighborhood Interpolation Weights , 2007, Seventh IEEE International Conference on Data Mining (ICDM 2007).

[5]  Vipin Kumar,et al.  A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs , 1998, SIAM J. Sci. Comput..

[6]  Fei Wang,et al.  Community discovery using nonnegative matrix factorization , 2011, Data Mining and Knowledge Discovery.

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

[8]  John Riedl,et al.  Item-based collaborative filtering recommendation algorithms , 2001, WWW '01.

[9]  Yehuda Koren,et al.  Matrix Factorization Techniques for Recommender Systems , 2009, Computer.

[10]  G. Karypis,et al.  Incremental Singular Value Decomposition Algorithms for Highly Scalable Recommender Systems , 2002 .

[11]  Kazuto Kubota,et al.  Application of Matrix Clustering to Web Log Analysis and Access Prediction , 2001 .

[12]  Erik G. Boman,et al.  A nested dissection approach to sparse matrix partitioning for parallel computations. , 2008 .

[13]  Qing Yang,et al.  Efficient Multicore Collaborative Filtering , 2011, ArXiv.

[14]  Inderjit S. Dhillon,et al.  Clustered low rank approximation of graphs in information science applications , 2011, SDM.

[15]  Takanobu Nakahara,et al.  Recommender System for Music CDs Using a Graph Partitioning Method , 2009, KES.

[16]  Peter J. Haas,et al.  Large-scale matrix factorization with distributed stochastic gradient descent , 2011, KDD.

[17]  Yong-Hyuk Kim,et al.  Genetic approaches for graph partitioning: a survey , 2011, GECCO '11.

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

[19]  Inderjit S. Dhillon,et al.  Information-theoretic co-clustering , 2003, KDD '03.

[20]  Yehuda Koren,et al.  The Yahoo! Music Dataset and KDD-Cup '11 , 2012, KDD Cup.

[21]  Feng Luo,et al.  Exploring Local Community Structures in Large Networks , 2006, 2006 IEEE/WIC/ACM International Conference on Web Intelligence (WI 2006 Main Conference Proceedings)(WI'06).

[22]  Chao Liu,et al.  Distributed nonnegative matrix factorization for web-scale dyadic data analysis on mapreduce , 2010, WWW '10.

[23]  Santo Fortunato,et al.  Community detection in graphs , 2009, ArXiv.

[24]  Curt Jones,et al.  Finding Good Approximate Vertex and Edge Partitions is NP-Hard , 1992, Inf. Process. Lett..

[25]  Matthew Brand,et al.  Fast Online SVD Revisions for Lightweight Recommender Systems , 2003, SDM.

[26]  Michael Jahrer,et al.  Collaborative Filtering Ensemble , 2012, KDD Cup.

[27]  Quan Wang,et al.  Regularized latent semantic indexing , 2011, SIGIR.

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

[29]  Fei Deng,et al.  International Journal of C 2009 Institute for Scientific Information and Systems Sciences Computing and Information Recent Advances in Personal Recommender Systems , 2022 .

[30]  John Riedl,et al.  GroupLens: an open architecture for collaborative filtering of netnews , 1994, CSCW '94.

[31]  Tao Li,et al.  A NMF-Based Privacy-Preserving Recommendation Algorithm , 2009, 2009 First International Conference on Information Science and Engineering.

[32]  Philip S. Yu,et al.  Community detection in incomplete information networks , 2012, WWW.

[33]  Fillia Makedon,et al.  Learning from Incomplete Ratings Using Non-negative Matrix Factorization , 2006, SDM.

[34]  Scott Sanner,et al.  New objective functions for social collaborative filtering , 2012, WWW.

[35]  Yousef Saad,et al.  Dense Subgraph Extraction with Application to Community Detection , 2012, IEEE Transactions on Knowledge and Data Engineering.

[36]  John Riedl,et al.  Incremental SVD-Based Algorithms for Highly Scaleable Recommender Systems , 2002 .

[37]  Kenneth Wai-Ting Leung,et al.  CLR: a collaborative location recommendation framework based on co-clustering , 2011, SIGIR.