The DOI matches its Crossref record; 14 of the 14 references it cites were found in a registry or an index.
TrustSVD: Collaborative Filtering with Both the Explicit and Implicit Influence of User Trust and of Item Ratings
Open accessAbstract
Collaborative filtering suffers from the problems of data sparsity and cold start, which dramatically degrade recommendation performance. To help resolve these issues, we propose TrustSVD, a trust-based matrix factorization technique. By analyzing the social trust data from four real-world data sets, we conclude that not only the explicit but also the implicit influence of both ratings and trust should be taken into consideration in a recommendation model. Hence, we build on top of a state-of-the-art recommendation algorithm SVD++ which inherently involves the explicit and implicit influence of rated items, by further incorporating both the explicit and implicit influence of trusted users on the prediction of items for an active user. To our knowledge, the work reported is the first to extend SVD++ with social trust information. Experimental results on the four data sets demonstrate that our approach TrustSVD achieves better accuracy than other ten counterparts, and can better handle the concerned issues.
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
Probabilistic Matrix Factorization
Mnih, A., & Salakhutdinov, R. (2007) · UCL Discovery (University College London) · Cited by 4,517
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
A matrix factorization technique with trust propagation for recommendation in social networks
Jamali, M., & Ester, M. (2010) · Proceedings of the fourth ACM conference on Recommender systems · doi:10.1145/1864708.1864736 · Cited by 1,632
Recommender 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
SoRec: social recommendation using probabilistic matrix factorization
Ma, H., Yang, H., Lyu, M. R., & King, I. (2008) · Proceedings of the 17th ACM conference on Information and knowledge management · doi:10.1145/1458082.1458205 · Cited by 1,401
Probabilistic Matrix Factorization
Salakhutdinov, R., & Mnih, A. (2007) · Cited by 1,075
Learning to recommend with social trust ensemble
Ma, H., King, I., & Lyu, M. R. (2009) · Proceedings of the 32nd international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/1571941.1571978 · Cited by 859
Factor in the neighbors: Scalable and accurate collaborative filtering
Koren, Y. (2010) · ACM Transactions on Knowledge Discovery from Data · doi:10.1145/1644873.1644874 · Cited by 718
Social Collaborative Filtering by Trust
Yang, B., Lei, Y., Liu, J., & Li, W. (2017) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2016.2605085 · Cited by 671
Exploiting local and global social context for recommendation
Tang, J., Hu, X., Gao, H., & Liu, H. (2013) · Cited by 202
SoRec: Social recommendation using probabilistic matrix factorization
Ma, H., Yang, H., Lyu, M. R., & King, I. (2008) · doi:10.13025/15118 · Cited by 177
A Simple But Effective Method to Incorporate Trusted Neighbors in Recommender Systems
Guo, G., Zhang, J., & Thalmann, D. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-31454-4_10 · Cited by 117
Self-citationLeveraging Decomposed Trust in Probabilistic Matrix Factorization for Effective Recommendation
Fang, H., Bao, Y., & Zhang, J. (2014) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v28i1.8714 · Cited by 94
Self-citationModeling dual role preferences for trust-aware recommendation
Yao, W., He, J., Huang, G., & Zhang, Y. (2014) · Proceedings of the 37th international ACM SIGIR conference on Research & development in information retrieval · doi:10.1145/2600428.2609488 · Cited by 62
Cited by
Graph 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
A Neural Influence Diffusion Model for Social Recommendation
Wu, L., Sun, P., Fu, Y., Hong, R., Wang, X., & Wang, M. (2019) · Proceedings of the 42nd International ACM SIGIR Conference on Research and Development in Information Retrieval · doi:10.1145/3331184.3331214 · Cited by 589
Self-Supervised Multi-Channel Hypergraph Convolutional Network for Social Recommendation
Yu, J., Yin, H., Li, J., Wang, Q., Hung, N. Q. V., & Zhang, X. (2021) · Proceedings of the Web Conference 2021 · doi:10.1145/3442381.3449844 · Cited by 519
DiffNet++: A Neural Influence and Interest Diffusion Network for Social Recommendation
Wu, L., Li, J., Sun, P., Hong, R., Ge, Y., & Wang, M. (2022) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2020.3048414 · Cited by 373
How algorithmic confounding in recommendation systems increases homogeneity and decreases utility
Chaney, A. J. B., Stewart, B. M., & Engelhardt, B. E. (2018) · Proceedings of the 12th ACM Conference on Recommender Systems · doi:10.1145/3240323.3240370 · Cited by 331
Metadata
- Authors
- Guo, G., Zhang, J., & Yorke-Smith, N.
- Venue
- Proceedings of the AAAI Conference on Artificial Intelligence
- Published
- 2015-02-09
- Volume
- 29
- Issue
- 1
- ISSN
- 2159-5399 (ISSN-L)
- 2374-3468
- OpenAlex
- W2244405900
- Cited by
- 573
- References
- 14
- FWCI
- 44.44
- Type
- conference paper
- Language
- en
- Open access
- diamond
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.