An exploration of improving collaborative recommender systems via user-item subgroups
The DOI matches its Crossref record; 39 of the 39 references it cites were found in a registry or an index.
Abstract
Collaborative filtering (CF) is one of the most successful recommendation approaches. It typically associates a user with a group of like-minded users based on their preferences over all the items, and recommends to the user those items enjoyed by others in the group. However we find that two users with similar tastes on one item subset may have totally different tastes on another set. In other words, there exist many user-item subgroups each consisting of a subset of items and a group of like-minded users on these items. It is more natural to make preference predictions for a user via the correlated subgroups than the entire user-item matrix. In this paper, to find meaningful subgroups, we formulate the Multiclass Co-Clustering (MCoC) problem and propose an effective solution to it. Then we propose an unified framework to extend the traditional CF algorithms by utilizing the subgroups information for improving their top-N recommendation performance. Our approach can be seen as an extension of traditional clustering CF models. Systematic experiments on three real world data sets have demonstrated the effectiveness of our proposed approach.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Introduction to information retrieval
(2009) · Choice Reviews Online · doi:10.5860/choice.46-2715 · Cited by 12,278
Adomavicius, G., & Tuzhilin, A. (2005) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2005.99 · Cited by 10,310 · cited 2×
“…of the co-clustering approaches as well as the above one-sided clustering approaches is that, each user or item can be clustered into one single cluster only, whereas some recommender systems may benefit from the ability of clustering users and items into several clusters at the same time [1].”
BackgroundALGORITHMS FOR NON-NEGATIVE MATRIX FACTORIZATION
Lee, D. D., & Seung, H. S. (2000) · neural information processing systems · Cited by 9,968
Item-based collaborative filtering recommendation algorithms
Sarwar, B., Karypis, G., Konstan, J., & Riedl, J. (2001) · Proceedings of the 10th international conference on World Wide Web · doi:10.1145/371920.372071 · Cited by 9,135 · cited 1×
“[27] and Deshpande et al.”
Advances in Neural Information Processing Systems 14: Proceedings of the 2001 Conference
(2002) · The MIT Press eBooks · doi:10.7551/mitpress/1120.001.0001 · Cited by 8,890
On Spectral Clustering: Analysis and an algorithm
Ng, A. Y., Jordan, M. I., & Weiss, Y. (2001) · Cited by 8,159
GroupLens: an open architecture for collaborative filtering of netnews
Resnick, P., Iacovou, N., Suchak, M., Bergstrom, P., & Riedl, J. (1994) · Proceedings of the 1994 ACM conference on Computer supported cooperative work - CSCW '94 · doi:10.1145/192844.192905 · Cited by 5,058
Learning with Local and Global Consistency
Zhou, D., Bousquet, O., Lal, T. N., Weston, J., & Schölkopf, B. (2003) · neural information processing systems · Cited by 4,777
Empirical Analysis of Predictive Algorithms for Collaborative Filtering
Breese, J. S., Heckerman, D. E., & Kadie, C. M. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1301.7363 · Cited by 4,772 · cited 3×
“The user-item interaction information can be either explicit or implicit [3].”
BackgroundInfluentialALGORITHMS FOR NON-NEGATIVE MATRIX FACTORIZATION
Seung, D., & Lee, L.-W. (2001) · Cited by 4,753
Locality Preserving Projections
He, X., & Niyogi, P. (2003) · neural information processing systems · Cited by 4,498
A Survey of Collaborative Filtering Techniques
Su, X., & Khoshgoftaar, T. M. (2009) · Advances in Artificial Intelligence · doi:10.1155/2009/421425 · Cited by 3,602 · cited 3×
“Collaborative filtering (CF) [1, 14, 30] is one of the most widely adopted and successful recommendation approaches.”
BackgroundMethodFab: content-based, collaborative recommendation
Balabanović, M., & Shoham, Y. (1997) · Communications of the ACM · doi:10.1145/245108.245124 · Cited by 2,934 · cited 1×
“Typical works using content information include [2, 21].”
2009 International Joint Conference on Artificial Intelligence
(2009) · doi:10.1109/jcai15434.2009 · Cited by 2,800
Biclustering of expression data.
Cheng, Y., & Church, G. M. (2000) · PubMed · Cited by 2,462
Graph Regularized Nonnegative Matrix Factorization for Data Representation
Cai, D., He, X., Han, J., & Huang, T. S. (2011) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2010.231 · Cited by 2,451 · cited 1×
“To alleviate the sparsity problem, many matrix factorization models are used, such as the Singular Value Decomposition (SVD) [28], Nonnegative Matrix Factorization (NMF) [4,16], MaximumMargin Matrix Factorization (MMMF) [25] and Nonparametrix pPCA (NPCA) [33].”
MethodSelf-citationItem-based top-N recommendation algorithms
Deshpande, M., & Karypis, G. (2004) · ACM Transactions on Information Systems · doi:10.1145/963770.963776 · Cited by 2,164 · cited 1×
“Saewar et al. [27] and Deshpande et al. [7] compute item-item similarities and obtain the predictions or top-N recommendation via item-based ways.”
BackgroundADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 16
Storkey, A. (2004) · neural information processing systems · Cited by 2,085
Biclustering algorithms for biological data analysis: a survey
Madeira, S. C., & Oliveira, A. L. (2004) · IEEE/ACM Transactions on Computational Biology and Bioinformatics · doi:10.1109/tcbb.2004.2 · Cited by 2,049
Co-clustering documents and words using bipartite spectral graph partitioning
Dhillon, I. S. (2001) · Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/502512.502550 · Cited by 1,697 · cited 2×
“This is a bit like the Co-Clustering (CoC) problem [8, 9, 34], but the main difference and also the key point is that any user or item can appear in multiple subgroups.”
BackgroundMethodRecommender systems with social regularization
Ma, H., Zhou, D., Liu, C., Lyu, M. R., & King, I. (2011) · Proceedings of the fourth ACM international conference on Web search and data mining · doi:10.1145/1935826.1935877 · Cited by 1,626 · cited 1×
“0, recently many new collaborative fil-tering algorithms are designed to integrate social or trust information [15,18].”
BackgroundProceedings of the 20th conference on Uncertainty in artificial intelligence
Meek, C., Chickering, M., & Halpern, J. Y. (2004) · Cited by 1,574
Application of Dimensionality Reduction in Recommender System - A Case Study
Sarwar, B., Karypis, G., Konstan, J., & Riedl, J. (2000) · doi:10.21236/ada439541 · Cited by 1,491 · cited 2×
“To alleviate the sparsity problem, many matrix factorization models are used, such as the Singular Value Decomposition (SVD) [28], Non-negative Matrix Factorization (NMF) [4,16], Maximum Margin Matrix Factorization (MMMF) [25] and Nonparametrix pPCA (NPCA) [33].”
MethodLatent semantic models for collaborative filtering
Hofmann, T. (2004) · ACM Transactions on Information Systems · doi:10.1145/963770.963774 · Cited by 1,378 · cited 1×
“The modeling process is always performed by machine learning or data mining techniques such as the Bayesian model [11], Regression-based model [32], Latent Semantic model [5,12] and Clustering model [9,23,29,31].”
MethodContent-boosted collaborative filtering for improved recommendations
Melville, P., Mooney, R. J., & Nagarajan, R. (2002) · doi:10.5555/777092.777124 · Cited by 1,084
Fast maximum margin matrix factorization for collaborative prediction
Rennie, J. D. M., & Srebro, N. (2005) · Proceedings of the 22nd international conference on Machine learning - ICML '05 · doi:10.1145/1102351.1102441 · Cited by 939 · cited 2×
“We use the procedure in [25].”
MethodClustering Methods for Collaborative Filtering
Ungar, L., & Foster, D. P. (1998) · Cited by 639
On social networks and collaborative recommendation
Konstas, I., Stathopoulos, V., & Jose, J. M. (2009) · Proceedings of the 32nd international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/1571941.1571977 · Cited by 604 · cited 1×
“0, recently many new collaborative fil-tering algorithms are designed to integrate social or trust information [15,18].”
BackgroundCollaborative Filtering by Personality Diagnosis: A Hybrid Memory- and Model-Based Approach
Pennock, D. M., Horvitz, E., Lawrence, S., & Giles, C. L. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1301.3885 · Cited by 499 · cited 2×
“PD: Personality diagnosis is a representative hybrid CF approach that combines memory based and model based algorithms and retains some advantages of both algorithms [24].”
BackgroundMethodLatent Class Models for Collaborative Filtering
Hofmann, T., & Puzicha, J. (1999) · Cited by 484
A Scalable Collaborative Filtering Framework Based on Co-Clustering
George, T., & Merugu, S. (2006) · Fifth IEEE International Conference on Data Mining (ICDM'05) · doi:10.1109/icdm.2005.14 · Cited by 407 · cited 6×
“Many clustering CF models utilize user clusters [29], item clusters [23], or co-clusters [9] to design CF algorithms.”
BackgroundMethodResultInfluentialProceedings of the 16th Conference on Uncertainty in Artificial Intelligence
Boutilier, C. E., & Goldszmidt, M. (2000) · Cited by 359
A Comparison of Collaborative-Filtering Recommendation Algorithms for E-commerce
Huang, Z., Zeng, D., & Chen, H. (2007) · IEEE Intelligent Systems · doi:10.1109/mis.2007.4338497 · Cited by 299
(2000) · CrossRef Listing of Deleted DOIs · doi:10.1162/153244301753344614 · Cited by 219
Probabilistic dyadic data analysis with local and global consistency
Cai, D., Wang, X., & He, X. (2009) · International Conference on Machine Learning · doi:10.1145/1553374.1553388 · Cited by 189 · cited 1×
“The modeling process is always performed by machine learning or data mining techniques such as the Bayesian model [11], Regression-based model [32], Latent Semantic model [5,12] and Clustering model [9,23,29,31].”
MethodSelf-citationFast nonparametric matrix factorization for large-scale collaborative filtering
Yu, K., Zhu, S., Lafferty, J., & Gong, Y. (2009) · Proceedings of the 32nd international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/1571941.1571979 · Cited by 165 · cited 2×
“NPCA: The algorithm was proposed in [33] and according to the authors, it produced one of the most accurate prediction results among matrix factorization methods.”
MethodTowards a robust fuzzy clustering
Łęski, J. M. (2003) · Fuzzy Sets and Systems · doi:10.1016/s0165-0114(02)00372-x · Cited by 125 · cited 1×
“For multiple class case, which is the main focus of this paper, we choose to use the fuzzy c-means [17], a soft clustering method.”
MethodCollaborative Filtering Using a Regression-Based Approach
Vučetić, S., & Zoran Obradovic, A. (2004) · Knowledge and Information Systems · doi:10.1007/s10115-003-0123-8 · Cited by 110 · cited 1×
“The modeling process is always performed by machine learning or data mining techniques such as the Bayesian model [11], Regression-based model [32], Latent Semantic model [5,12] and Clustering model [9,23,29,31].”
MethodLocally Discriminative Coclustering
Zhang, L., Chen, C., Bu, J., Chen, Z., Cai, D., & Han, J. (2011) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2011.71 · Cited by 32
Self-citation
Cited by
Toward Scalable Systems for Big Data Analytics: A Technology Tutorial
Hu, H., Wen, Y., Chua, T.-S., & Li, X. (2014) · IEEE Access · doi:10.1109/access.2014.2332453 · Cited by 1,099
“For example, collaborative recommendation systems allow personalization for e-commerce by exploiting similarities and dissimilarities in user preferences [215].”
BackgroundA Recommendation Model Based on Deep Neural Network
Zhang, L., Luo, T., Zhang, F., & Wu, Y. (2018) · IEEE Access · doi:10.1109/access.2018.2789866 · Cited by 163
“• MCoC [27]: This method first clusters the users and items into subgroups, and then, it uses the basis CF method to make recommendations within each subgroup.”
Method
Metadata
- Authors
- Xu, B., Bu, J., Chen, C., & Cai, D.
- Venue
- Proceedings of the 21st international conference on World Wide Web
- Publisher
- ACM
- Published
- 2012-04-16
- Pages
- 21-30
- OpenAlex
- W2057932305
- Cited by
- 195
- References
- 39
- FWCI
- 20.21
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.