The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Trust-based recommendation systems: an axiomatic approach
Abstract
High-quality, personalized recommendations are a key feature in many online systems. Since these systems often have explicit knowledge of social network structures, the recommendations may incorporate this information. This paper focuses on networks that represent trust and recommendation systems that incorporate these trust relationships. The goal of a trust-based recommendation system is to generate personalized recommendations by aggregating the opinions of other users in the trust network.In analogy to prior work on voting and ranking systems, we use the axiomatic approach from the theory of social choice. We develop a set of five natural axioms that a trust-based recommendation system might be expected to satisfy. Then, we show that no system can simultaneously satisfy all the axioms. However, for any subset of four of the five axioms we exhibit a recommendation system that satisfies those axioms. Next we consider various ways of weakening the axioms, one of which leads to a unique recommendation system based on random walks. We consider other recommendation systems, including systems based on personalized PageRank, majority of majorities, and minimum cuts, and search for alternative axiomatizations that uniquely characterize these systems.Finally, we determine which of these systems are incentive compatible, meaning that groups of agents interested in manipulating recommendations can not induce others to share their opinion by lying about their votes or modifying their trust links. This is an important property for systems deployed in a monetized environment.
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
Resnick, P., Kuwabara, K., Zeckhauser, R., & Friedman, E. (2000) · Communications of the ACM · doi:10.1145/355112.355122 · Cited by 2,190 · cited 1×
“Ranking, reputation, recommendation, and trust systems have become essential ingredients of web-based multi-agent systems (e.g. [16] [22] [8] [25] [11]).”
BackgroundHaveliwala, T. H. (2002) · Proceedings of the 11th international conference on World Wide Web · doi:10.1145/511446.511513 · Cited by 1,567
Cited by
Exploiting 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
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
TrustWalker: a random walk model for combining trust-based and item-based recommendation
Jamali, M., & Ester, M. (2009) · Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1557019.1557067 · Cited by 771
A survey of trust in social networks
Sherchan, W., Nepal, S., & Paris, C. (2013) · ACM Computing Surveys · doi:10.1145/2501654.2501661 · Cited by 671
Chen (2010) · doi:10.1145/1753326.1753503 · Cited by 416
Metadata
- Authors
- Andersen, R., Borgs, C., Chayes, J., Feige, U., Flaxman, A., Kalai, A., Mirrokni, V., & Tennenholtz, M.
- Venue
- Proceedings of the 17th international conference on World Wide Web
- Publisher
- ACM
- Published
- 2008-04-21
- Pages
- 199-208
- OpenAlex
- W2164361866
- Cited by
- 208
- References
- 2
- FWCI
- 82.15
- 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.