skip to main content
10.1145/2484028.2484101acmconferencesArticle/Chapter ViewAbstractPublication PagesirConference Proceedingsconference-collections
research-article

Improve collaborative filtering through bordered block diagonal form matrices

Published: 28 July 2013 Publication History

Abstract

Collaborative Filtering-based recommendation algorithms have achieved widespread success on the Web, but little work has been performed to investigate appropriate user-item relationship structures of rating matrices. This paper presents a novel and general collaborative filtering framework based on (Approximate) Bordered Block Diagonal Form structure of user-item rating matrices. We show formally that matrices in (A)BBDF structures correspond to community detection on the corresponding bipartite graphs, and they reveal relationships among users and items intuitionally in recommendation tasks. By this framework, general and special interests of a user are distinguished, which helps to improve prediction accuracy in collaborative filtering tasks. Experimental results on four real-world datasets, including the Yahoo! Music dataset, which is currently the largest, show that the proposed framework helps many traditional collaborative filtering algorithms, such as User-based, Item-based, SVD and NMF approaches, 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.

References

[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, pages21--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.

Cited By

View all
  • (2024)P-Reader: A Clue-Inspired Model for Machine Reading ComprehensionCognitive Computing – ICCC 202310.1007/978-3-031-51671-9_2(19-33)Online publication date: 4-Jan-2024
  • (2022)The Implementation of Hybrid Semantic Ontology-based Model on Movie Recommendation System2022 International Conference on Computer Engineering, Network, and Intelligent Multimedia (CENIM)10.1109/CENIM56801.2022.10037277(1-7)Online publication date: 22-Nov-2022
  • (2021)Explainable recommendation based on knowledge graph and multi-objective optimizationComplex & Intelligent Systems10.1007/s40747-021-00315-y7:3(1241-1252)Online publication date: 6-Mar-2021
  • Show More Cited By

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
SIGIR '13: Proceedings of the 36th international ACM SIGIR conference on Research and development in information retrieval
July 2013
1188 pages
ISBN:9781450320344
DOI:10.1145/2484028
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 28 July 2013

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. block diagonal form
  2. collaborative filtering
  3. community detection
  4. graph partitioning

Qualifiers

  • Research-article

Conference

SIGIR '13
Sponsor:

Acceptance Rates

SIGIR '13 Paper Acceptance Rate 73 of 366 submissions, 20%;
Overall Acceptance Rate 792 of 3,983 submissions, 20%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)8
  • Downloads (Last 6 weeks)1
Reflects downloads up to 27 Feb 2025

Other Metrics

Citations

Cited By

View all
  • (2024)P-Reader: A Clue-Inspired Model for Machine Reading ComprehensionCognitive Computing – ICCC 202310.1007/978-3-031-51671-9_2(19-33)Online publication date: 4-Jan-2024
  • (2022)The Implementation of Hybrid Semantic Ontology-based Model on Movie Recommendation System2022 International Conference on Computer Engineering, Network, and Intelligent Multimedia (CENIM)10.1109/CENIM56801.2022.10037277(1-7)Online publication date: 22-Nov-2022
  • (2021)Explainable recommendation based on knowledge graph and multi-objective optimizationComplex & Intelligent Systems10.1007/s40747-021-00315-y7:3(1241-1252)Online publication date: 6-Mar-2021
  • (2020)Improving the Cold Start Problem in Music Recommender SystemsJournal of Physics: Conference Series10.1088/1742-6596/1651/1/0120671651:1(012067)Online publication date: 1-Nov-2020
  • (2019)Adaptive Local Low-rank Matrix Approximation for RecommendationACM Transactions on Information Systems10.1145/336048837:4(1-34)Online publication date: 16-Oct-2019
  • (2019)Constructing Click Model for Mobile Search with Viewport TimeACM Transactions on Information Systems10.1145/336048637:4(1-34)Online publication date: 26-Sep-2019
  • (2019)Next and Next New POI Recommendation via Latent Behavior Pattern InferenceACM Transactions on Information Systems10.1145/335418737:4(1-28)Online publication date: 19-Sep-2019
  • (2019)Enhancing Personalized Recommendation by Implicit Preference Communities ModelingACM Transactions on Information Systems10.1145/335259237:4(1-32)Online publication date: 26-Nov-2019
  • (2019)Boosting Search Performance Using Query VariationsACM Transactions on Information Systems10.1145/334500137:4(1-25)Online publication date: 4-Oct-2019
  • (2019)Compositional Coding for Collaborative FilteringProceedings of the 42nd International ACM SIGIR Conference on Research and Development in Information Retrieval10.1145/3331184.3331206(145-154)Online publication date: 18-Jul-2019
  • Show More Cited By

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media