TrustWalker: a random walk model for combining trust-based and item-based recommendation
The DOI matches its Crossref record; 17 of the 17 references it cites were found in a registry or an index.
Abstract
Collaborative filtering is the most popular approach to build recommender systems and has been successfully employed in many applications. However, it cannot make recommendations for so-called cold start users that have rated only a very small number of items. In addition, these methods do not know how confident they are in their recommendations. Trust-based recommendation methods assume the additional knowledge of a trust network among users and can better deal with cold start users, since users only need to be simply connected to the trust network. On the other hand, the sparsity of the user item ratings forces the trust-based approach to consider ratings of indirect neighbors that are only weakly trusted, which may decrease its precision. In order to find a good trade-off, we propose a random walk model combining the trust-based and the collaborative filtering approach for recommendation. The random walk model allows us to define and to measure the confidence of a recommendation. We performed an evaluation on the Epinions dataset and compared our model with existing trust-based and collaborative filtering methods.
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
Social Network Analysis: Methods and Applications
Wasserman, S., & Faust, K. (1994) · doi:10.1017/cbo9780511815478 · Cited by 17,557
The anatomy of a large-scale hypertextual Web search engine
Brin, S., & Page, L. (1998) · Computer Networks and ISDN Systems · doi:10.1016/s0169-7552(98)00110-x · Cited by 16,004
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 15×
“Hence, to compute the similarity of two items, we use the Pearson Correlation of ratings expressed for both items, as used in [15].”
MethodResultInfluential(2017) · The SAGE Encyclopedia of Communication Research Methods · doi:10.4135/9781483381411.n575 · Cited by 6,008
The small-world problem: (400002009-005)
Milgram, S. (1967) · PsycEXTRA Dataset · doi:10.1037/e400002009-005 · Cited by 4,790
Using collaborative filtering to weave an information tapestry
Goldberg, D., Nichols, D., Oki, B. M., & Terry, D. (1992) · Communications of the ACM · doi:10.1145/138859.138867 · Cited by 4,066
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
Mining knowledge-sharing sites for viral marketing
Richardson, M., & Domingos, P. (2002) · Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/775047.775057 · Cited by 1,612
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
Trust-aware recommender systems
Massa, P., & Avesani, P. (2007) · Proceedings of the 2007 ACM conference on Recommender systems · doi:10.1145/1297231.1297235 · Cited by 1,190
Computing and applying trust in web-based social networks
Golbeck, J., & Hendler, J. (2005) · University Libraries (University of Maryland) · Cited by 946
O'Donovan, J., & Smyth, B. (2005) · Proceedings of the 10th international conference on Intelligent user interfaces · doi:10.1145/1040830.1040870 · Cited by 865
Feedback effects between similarity and social influence in online communities
Crandall, D., Cosley, D., Huttenlocher, D., Kleinberg, J., & Suri, S. (2008) · Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1401890.1401914 · Cited by 603
Modeling relationships at multiple scales to improve accuracy of large recommender systems
Bell, R., Koren, Y., & Volinsky, C. (2007) · Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1281192.1281206 · Cited by 368
Trust-based recommendation systems: an axiomatic approach
Andersen, R., Borgs, C., Chayes, J., Feige, U., Flaxman, A., Kalai, A., Mirrokni, V., & Tennenholtz, M. (2008) · Proceedings of the 17th international conference on World Wide Web · doi:10.1145/1367497.1367525 · Cited by 208
A random walk method for alleviating the sparsity problem in collaborative filtering
Yildirim, H., & Krishnamoorthy, M. S. (2008) · Proceedings of the 2008 ACM conference on Recommender systems · doi:10.1145/1454008.1454031 · Cited by 183
Towards Decentralized Recommender Systems
Ziegler, C.-N. (2005) · FreiDok plus (Universitätsbibliothek Freiburg) · Cited by 84
Cited by
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
Self-citationExploiting geographical influence for collaborative point-of-interest recommendation
Ye, M., Yin, P., Lee, W.-C., & Lee, D.-L. (2011) · Proceedings of the 34th international ACM SIGIR conference on Research and development in Information Retrieval · doi:10.1145/2009916.2009962 · Cited by 1,111
A Survey on Knowledge Graph-Based Recommender Systems
Guo, Q., Zhuang, F., Qin, C., Zhu, H., Xie, X., Xiong, H., & He, Q. (2022) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2020.3028705 · Cited by 926
Shi, Y., Larson, M., & Hanjalic, A. (2014) · ACM Computing Surveys · doi:10.1145/2556270 · Cited by 806
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
Metadata
- Authors
- Jamali, M., & Ester, M.
- Venue
- Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining
- Publisher
- ACM
- Published
- 2009-06-28
- Pages
- 397-406
- OpenAlex
- W2084527756
- Cited by
- 771
- References
- 17
- FWCI
- 24.16
- 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.