Improve collaborative filtering through bordered block diagonal form matrices

SIGIR 2013 - Proceedings of the 36th International ACM SIGIR Conference on Research and Development in Information Retrieval

Volumn , Issue , 2013, Pages 313-322

  Zhang, Yongfeng ^a   Zhang, Min ^a   Liu, Yiqun ^a   Ma, Shaoping ^a  

^a TSINGHUA UNIVERSITY   (China)

Author keywords

Block Diagonal Form; Collaborative Filtering; Community Detection; Graph Partitioning

Indexed keywords

BLOCK DIAGONAL; BORDERED BLOCK DIAGONAL FORM; COLLABORATIVE FILTERING ALGORITHMS; COMMUNITY DETECTION; GRAPH PARTITIONING; PREDICTION ACCURACY; REAL-WORLD DATASETS; RECOMMENDATION ALGORITHMS;

FORECASTING; GRAPH THEORY; INFORMATION RETRIEVAL; POPULATION DYNAMICS; RATING;

COLLABORATIVE FILTERING;

EID: 84883126990     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2484028.2484101     Document Type: Conference Paper

References (40)

1. C. Aykanat, A. Pinar, and U. V. Catalyurek. Permuting Sparse Rectangular Matrices into Block-Diagonal From. SISC, 2004.
2. R. M. Bell and Y. Koren. Scalable Collaborative Filtering with Jointly Derived Neighborhood Interpolation Weights. Proc. ICDM, 2007.
3. E. Boman and M. Wolf. A Nested Dissection approach to Sparse Matrix Partitioning for Parallel Computations. Proc. AMM, 2007.
4. M. Brand. Fast online SVD revisions for lightweight recommender systems. Proc. SIAM SDM, 2003.
5. T. N. Bui and C. Jones. Finding Good Approximate Vertex and Edge Partitions is NP-hard. Inform. Process. Lett., 1992.
6. J. Chen and Y. Saad. Dense Subgraph Extraction with Application to Community Detection. TKDE, 2012.
7. I. S. Dhillon, S. Mallela, and D. S. Modha. Information Theoretic Co-clustering. Proc. SIGKDD, pages 89-98, 2003.
8. G. Dror, N. Koenigstein, Y. Koren, and M. Weimer. The Yahoo! Music Dataset and KDD-Cup'11. KDDCUP, 2011.
9. S. Fortunato. Community Detection in Graphs. Physics Reports, 486:75-174, 2010.
10. R. Gemulla, E. Nijkamp, P. J. Haas, and Y. Sismanis. Large-scale Matrix Factorization with Distributed Stochastic Gradient Descent. KDD, 2011.
11. T. George and S. Merugu. A Scalable Collaborative Filtering Framework based on Co-clustering. Proc. ICDM, 2005.
12. M. Jahrer and A. Toscher. Collaborative Filtering Ensemble. KDDCUP, 2011.
13. G. Karypis. Metis-A Software Package for Partitioning Unstructured Graphs, Meshes, and Computing Fill-Reducing Orderings of Sparse Matrices-Version 5.0. University of Minnesota, 2011.
14. G. Karypis and V. Kumar. A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs. SISC, 1998.
15. J. Kim, I. Hwang, Y. H. Kim, and B. R. Moon. Genetic Approaches for Graph Partitioning: A Survey. Proc. CECCO, pages 473-480, 2011.
16. Y. Koren, R. Bell, and C. Volinsky. Matrix Factorization Techniques for Recommender Systems. Computer, 42:30-37, 2009.
17. D. D. Lee and H. S. Seung. Algorithms for Non-negative Matrix Factorization. NIPS, 2001.
18. K. W. Leung, D. L. Lee, and W. Lee. CLR: A Collaborative Location Recommendation Framework based on Co-Clustering. Proc. SIGIR, 2011.
19. T. Li, C. Gao, and J. Du. A NMF-based Privacy-Preserving Recommendation Algorithm. Proc. ICISE, 2009.
20. W. Lin, X. Kong, P. S. Yu, Q. Wu, Y. Jia, and C. Li. Community Detection in Incomplete Information Networks. Proc. WWW, pages 341-349, 2012.
21. C. Liu, H. Yang, J. Fan, L. He, and Y. Wang. Distributed Nonnegative Matrix Factorization for Web-scale Dyadic Data Analysis on MapReduce. Proc. WWW, pages 681-690, 2010.
22. J. Liu, M. Z. Q. Chen, J. Chen, F. Deng, H. Zhang, Z. Zhang, and T. Zhou. Recent Advances in Personal Recommender Systems. Jour. Info. and Sys. Sci., 5:230-247, 2009.
23. F. Luo, J. Z. Wang, and E. Promislow. Exploring Local Community Structures in Large Networks. Proc. WI, 2006.
24. T. Nakahara and H. Morita. Recommender System for Music CDs Using a Graph Partitioning Method. Proc. KES, 2009.
25. J. Noel, S. Sanner, K. Tran, P. Christen, and L. Xie. New Objective Functions for Social Collaborative Filtering. Proc. WWW, pages 859-868, 2012.
26. M. O'Connor and J. Herlocker. Clustering Items for Collaborative Filtering. Proc. SIGIR Workshop, 1999.
27. S. Oyanagi, K. Kubota, and A. Nakase. Application of Matrix Clustering to Web Log Analysis and Access Prediction. Proc. WEBKDD, pages 13-21, 2001.
28. M. J. Pazzani and D. Billsus. Content-Based Recommendation Systems. The Adaptive Web LNCS, pages 325-341, 2007.
29. P. Resnick, N. Iacovou, M. Suchak, P. Bergstrom, and J. Riedl. GroupLens: An Open Architecture for Collaborative Filtering of Netnews. CSCW, 1994.
30. P. Sanders and C. Schulz. Engineering Multilevel Graph Partitioning Algorithms. ESA, 2011.
31. B. Sarwar, G. Karypis, J. Konstan, and J. Riedl. Item-Based Collaborative Filtering Recommendation Algorithms. Proc. WWW, pages 285-295, 2001.
32. B. Sarwar, G. Karypis, J. Konstan, and J. Riedl. Incremental Singular Value Decomposition Algorithms for Highly Scalable Recommender Systems. Proc. ICCIT, 2002.
33. B. M. Sarwar, G. Karypis, J. A. Konstan, and J. T. Riedl. Application of Dimensionality Reduction in Recommender Systems - a case study. WebKDD, 2000.
34. B. Savas and I. S. Dhillon. Clustered Low Rank Approximation of Graphs in Information Science Applications. Proc. SIAM SDM, pages 164-175, 2011.
35. B. Savas and I. S. Dhillon. Clustered Low Rank Approximation of Graphs in Information Science Applications. Proc. SIAM SDM, pages 164-175, 2011.
36. F. Wang, T. Li, X. Wang, S. Zhu, and C. Ding. Community Discovery using Nonnegative Matrix Factorization. Journal of DMKD, 22, 2011.
37. Q. Wang, J. Xu, H. Li, and N. Craswell. Regularized Latent Sematic Indexing. Proc. SIGIR, 2011.
38. Y. Wu, Q. Yan, D. Bickson, et al Efficient Multicore Collaborative Filtering. KDDCUP, 2011.
39. B. Xu, J. Bu, and C. Chen. An Exploration of Improving Collaborative Recommender Systems via User-Item Subgroups. WWW, pages 21-30, 2012.
40. S. Zhang, W. Wang, J. Ford, and F. Makedon. Learning from Incomplite Ratings Using Non-negative Matrix Factorization. Proc. SIAM SDM, 2006.