FISM: factored item similarity models for top-N recommender systems
The DOI matches its Crossref record; 14 of the 14 references it cites were found in a registry or an index.
Abstract
The effectiveness of existing top-N recommendation methods decreases as the sparsity of the datasets increases. To alleviate this problem, we present an item-based method for generating top-N recommendations that learns the item-item similarity matrix as the product of two low dimensional latent factor matrices. These matrices are learned using a structural equation modeling approach, wherein the value being estimated is not used for its own estimation. A comprehensive set of experiments on multiple datasets at three different sparsity levels indicate that the proposed methods can handle sparse datasets effectively and outperforms other state-of-the-art top-N recommendation methods. The experimental results also show that the relative performance gains compared to competing methods increase as the data gets sparser.
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
Regression shrinkage and selection via the lasso
Tibshirani, R. (1996) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1996.tb02080.x · Cited by 51,482
CAUSALITY: MODELS, REASONING AND INFERENCE
Hitchcock, C. (2001) · The Philosophical Review · doi:10.1215/00318108-110-4-639 · Cited by 4,741
BPR: Bayesian Personalized Ranking from Implicit Feedback
Rendle, S., Freudenthaler, C., Gantner, Z., & Schmidt-Thieme, L. (2012) · arXiv (Cornell University) · doi:10.48550/arxiv.1205.2618 · Cited by 4,242
Factorization meets the neighborhood: a multifaceted collaborative filtering model
Koren, Y. (2008) · Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1401890.1401944 · Cited by 3,852
(2011) · Springer eBooks · doi:10.1007/978-0-387-85820-3 · Cited by 3,761
Causality: models, reasoning, and inference
(2000) · Choice Reviews Online · doi:10.5860/choice.38-1494a · Cited by 2,873
Content-Based Recommendation Systems
Pazzani, M. J., & Billsus, D. (2007) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-72079-9_10 · Cited by 2,600 · cited 1×
“In content based methods [6, 9], the features associated with users/items are used to build models.”
MethodItem-based top-N recommendation algorithms
Deshpande, M., & Karypis, G. (2004) · ACM Transactions on Information Systems · doi:10.1145/963770.963776 · Cited by 2,164
Self-citationAdaptive Algorithms and Stochastic Approximations
Benveniste, A., Métivier, M., & Priouret, P. (1990) · Springer eBooks · doi:10.1007/978-3-642-75894-2 · Cited by 2,006
Performance of recommender algorithms on top-n recommendation tasks
Cremonesi, P., Koren, Y., & Turrin, R. (2010) · Proceedings of the fourth ACM conference on Recommender systems · doi:10.1145/1864708.1864721 · Cited by 1,410
Cited by
LightGCN: Simplifying and Powering Graph Convolution Network for Recommendation
He, X., Deng, K., Wang, X., Li, Y., Zhang, Y., & Wang, M. (2020) · Proceedings of the 43rd International ACM SIGIR Conference on Research and Development in Information Retrieval · doi:10.1145/3397271.3401063 · Cited by 4,430
Neural Graph Collaborative Filtering
Wang, X., He, X., Wang, M., Feng, F., & Chua, T.-S. (2019) · Proceedings of the 42nd International ACM SIGIR Conference on Research and Development in Information Retrieval · doi:10.1145/3331184.3331267 · Cited by 3,823
Self-Attentive Sequential Recommendation
Kang, W.-C., & McAuley, J. (2018) · 2018 IEEE International Conference on Data Mining (ICDM) · doi:10.1109/icdm.2018.00035 · Cited by 3,011
BERT4Rec: Sequential Recommendation with Bidirectional Encoder Representations from Transformer
Sun, F., Liu, J., Wu, J., Pei, C., Lin, X., Ou, W., & Jiang, P. (2019) · Proceedings of the 28th ACM International Conference on Information and Knowledge Management · doi:10.1145/3357384.3357895 · Cited by 2,558
“users and items into a shared vector space and estimate a user’s preference on an item by the inner product between their vectors [26, 27, 41]. Another line of work is item-based neighborhood methods [20, 25, 31, 43]. They estimate a user’s preference on an item via measuring its similarities with the items in her/his…”
MethodGraph Neural Networks in Recommender Systems: A Survey
Wu, S., Sun, F., Zhang, W., Xie, X., & Cui, B. (2023) · ACM Computing Surveys · doi:10.1145/3535101 · Cited by 1,326
Collaborative Denoising Auto-Encoders for Top-N Recommender Systems
Wu, Y., DuBois, C., Zheng, A. X., & Ester, M. (2016) · Proceedings of the Ninth ACM International Conference on Web Search and Data Mining · doi:10.1145/2835776.2835837 · Cited by 1,001
Chen, J., Zhang, H., He, X., Nie, L., Liu, W., & Chua, T.-S. (2017) · Proceedings of the 40th International ACM SIGIR Conference on Research and Development in Information Retrieval · doi:10.1145/3077136.3080797 · Cited by 851
Fusing Similarity Models with Markov Chains for Sparse Sequential Recommendation
He, R., & McAuley, J. (2016) · 2016 IEEE 16th International Conference on Data Mining (ICDM) · doi:10.1109/icdm.2016.0030 · Cited by 769
A Comprehensive Survey of Neighborhood-Based Recommendation Methods
Ning, X., Desrosiers, C., & Karypis, G. (2015) · Recommender Systems Handbook · doi:10.1007/978-1-4899-7637-6_2 · Cited by 641
Self-citationDisentangled Graph Collaborative Filtering
Wang, X., Jin, H., Zhang, A., He, X., Xu, T., & Chua, T.-S. (2020) · Proceedings of the 43rd International ACM SIGIR Conference on Research and Development in Information Retrieval · doi:10.1145/3397271.3401137 · Cited by 624
Improving Graph Collaborative Filtering with Neighborhood-enriched Contrastive Learning
Lin, Z., Tian, C., Hou, Y., & Zhao, W. X. (2022) · Proceedings of the ACM Web Conference 2022 · doi:10.1145/3485447.3512104 · Cited by 572
NAIS: Neural Attentive Item Similarity Model for Recommendation
He, X., He, Z., Song, J., Liu, Z., Jiang, Y.-G., & Chua, T.-S. (2018) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2018.2831682 · Cited by 569
Sequence-Aware Recommender Systems
Quadrana, M., Cremonesi, P., & Jannach, D. (2019) · ACM Computing Surveys · doi:10.1145/3190616 · Cited by 504
RecBole: Towards a Unified, Comprehensive and Efficient Framework for Recommendation Algorithms
Zhao, W. X., Mu, S., Hou, Y., Lin, Z., Chen, Y., Pan, X., Li, K., Lu, Y., Wang, H., Tian, C., et al. (2021) · Proceedings of the 30th ACM International Conference on Information & Knowledge Management · doi:10.1145/3459637.3482016 · Cited by 455
Multi-behavior Recommendation with Graph Convolutional Networks
Jin, B., Gao, C., He, X., Jin, D., & Li, Y. (2020) · Proceedings of the 43rd International ACM SIGIR Conference on Research and Development in Information Retrieval · doi:10.1145/3397271.3401072 · Cited by 415
Wu, L., He, X., Wang, X., Zhang, K., & Wang, M. (2022) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2022.3145690 · Cited by 413
LightGCN: Simplifying and Powering Graph Convolution Network for Recommendation
He, X., Deng, K., Wang, X., Li, Y., Zhang, Y., & Wang, M. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2002.02126 · Cited by 381
Adversarial Personalized Ranking for Recommendation
He, X., He, Z., Du, X., & Chua, T.-S. (2018) · The 41st International ACM SIGIR Conference on Research & Development in Information Retrieval · doi:10.1145/3209978.3209981 · Cited by 376
How Does NLP Benefit Legal System: A Summary of Legal Artificial Intelligence
Zhong, H., Xiao, C., Tu, C., Zhang, T., Liu, Z., & Sun, M. (2020) · Proceedings of the 58th Annual Meeting of the Association for Computational Linguistics · doi:10.18653/v1/2020.acl-main.466 · Cited by 367
Deep Item-based Collaborative Filtering for Top-N Recommendation
Xue, F., He, X., Wang, X., Xu, J., Liu, K., & Hong, R. (2019) · ACM Transactions on Information Systems · doi:10.1145/3314578 · Cited by 339
Evaluation of session-based recommendation algorithms
Ludewig, M., & Jannach, D. (2018) · User Modeling and User-Adapted Interaction · doi:10.1007/s11257-018-9209-6 · Cited by 336
Hierarchical Gating Networks for Sequential Recommendation
Ma, C., Kang, P., & Liu, X. (2019) · Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining · doi:10.1145/3292500.3330984 · Cited by 322
Deep Learning for Sequential Recommendation: Algorithms, Influential Factors, and Evaluations
Fang, H., Zhang, D., Shu, Y., & Guo, G. (2021) · ACM Transactions on Information Systems · doi:10.1145/3426723 · Cited by 287
MGAT: Multimodal Graph Attention Network for Recommendation
Tao, Z., Wei, Y., Wang, X., He, X., Huang, X., & Chua, T.-S. (2020) · Information Processing & Management · doi:10.1016/j.ipm.2020.102277 · Cited by 277
Collaborative Memory Network for Recommendation Systems
Ebesu, T., Shen, B., & Fang, Y. (2018) · The 41st International ACM SIGIR Conference on Research & Development in Information Retrieval · doi:10.1145/3209978.3209991 · Cited by 275
Model-Agnostic Counterfactual Reasoning for Eliminating Popularity Bias in Recommender System
Wei, T., Feng, F., Chen, J., Wu, Z., Yi, J., & He, X. (2021) · Proceedings of the 27th ACM SIGKDD Conference on Knowledge Discovery & Data Mining · doi:10.1145/3447548.3467289 · Cited by 274
Hierarchical Reinforcement Learning for Course Recommendation in MOOCs
Zhang, J., Hao, B., Chen, B., Li, C., Chen, H., & Sun, J. (2019) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v33i01.3301435 · Cited by 196
“Among all the item-to-item 3https://github.com/jerryhao66/HRL based collaborative filtering methods, FISM and GRU perform worse than the others, as they make equal treatments on all the historical enrolled courses and thus the preference representation ability is limited.”
MethodInfluentialReducing Controversy by Connecting Opposing Views
Garimella, K., De Francisci Morales, G., Gionis, A., & Mathioudakis, M. (2017) · Proceedings of the Tenth ACM International Conference on Web Search and Data Mining · doi:10.1145/3018661.3018703 · Cited by 165
Learning to recommend with multiple cascading behaviors
Gao, C., He, X., Gan, D., Chen, X., Feng, F., Li, Y., Chua, T.-S., Yao, L., Song, Y., & Jin, D. (2021) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2019.2958808 · Cited by 136
Personalised Reranking of Paper Recommendations Using Paper Content and User Behavior
Li, X., Chen, Y., Pettit, B., & Rijke, M. D. (2019) · ACM Transactions on Information Systems · doi:10.1145/3312528 · Cited by 46
A Generic Federated Recommendation Framework via Fake Marks and Secret Sharing
Lin, Z., Pan, W., Yang, Q., & Ming, Z. (2023) · ACM Transactions on Information Systems · doi:10.1145/3548456 · Cited by 44
Bayesian Personalized Feature Interaction Selection for Factorization Machines
Chen, Y., Ren, P., Wang, Y., & de Rijke, M. (2019) · Proceedings of the 42nd International ACM SIGIR Conference on Research and Development in Information Retrieval · doi:10.1145/3331184.3331196 · Cited by 26
User Consented Federated Recommender System Against Personalized Attribute Inference Attack
Hu, Q., & Song, Y. (2024) · Proceedings of the 17th ACM International Conference on Web Search and Data Mining · doi:10.1145/3616855.3635830 · Cited by 17
Metadata
- Authors
- Kabbur, S., Ning, X., & Karypis, G.
- Venue
- Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining
- Publisher
- ACM
- Published
- 2013-08-11
- Pages
- 659-667
- OpenAlex
- W2108920354
- Cited by
- 651
- References
- 14
- FWCI
- 13.72
- 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.