PIN-TRUST: Fast trust propagation exploiting positive, implicit, and negative information
- Authors
- Jang, Min-Hee; Faloutsos, Christos; Kim, Sang-Wook; Kang, U.; Ha, Jiwoon
- Issue Date
- Oct-2016
- Publisher
- Association for Computing Machinery
- Keywords
- Belief propagation; Graph mining; Trust prediction
- Citation
- International Conference on Information and Knowledge Management, Proceedings, v.24-28-October-2016, pp.629 - 638
- Indexed
- SCOPUS
- Journal Title
- International Conference on Information and Knowledge Management, Proceedings
- Volume
- 24-28-October-2016
- Start Page
- 629
- End Page
- 638
- URI
- https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/153826
- DOI
- 10.1145/2983323.2983753
- Abstract
- Given "who-trusts/distrusts-whom" information, how can we propagate the trust and distrust? With the appearance of fraudsters in social network sites, the importance of trust prediction has increased. Most such methods use only explicit and implicit trust information (e.g., if Smith likes several of Johnson's reviews, then Smith implicitly trusts Johnson), but they do not consider distrust. In this paper, we propose PIN-TRUST, a novel method to handle all three types of interaction information: explicit trust, implicit trust, and explicit distrust. The novelties of our method are the following: (a) it is carefully designed, to take into account positive, implicit, and negative information, (b) it is scalable (i.e., linear on the input size), (c) most importantly, it is effective and accurate. Our extensive experiments with a real dataset, Epinions.com data, of 100K nodes and 1M edges, confirm that PIN-TRUST is scalable and outperforms existing methods in terms of prediction accuracy, achieving up to 50.4 percentage relative improvement.
- Files in This Item
-
Go to Link
- Appears in
Collections - 서울 공과대학 > 서울 컴퓨터소프트웨어학부 > 1. Journal Articles
![qrcode](https://api.qrserver.com/v1/create-qr-code/?size=55x55&data=https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/153826)
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.