268 0

PIN-TRUST: Fast Trust Propagation Exploiting Positive, Implicit, and Negative Information

Title
PIN-TRUST: Fast Trust Propagation Exploiting Positive, Implicit, and Negative Information
Author
김상욱
Keywords
Belief propagation; graph mining; trust prediction
Issue Date
2016-10
Publisher
ACM CIKM2016
Citation
(International Conference on Information and Knowledge Management (2016), Page. 629-638
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.
URI
https://dl.acm.org/citation.cfm?doid=2983323.2983753https://repository.hanyang.ac.kr/handle/20.500.11754/81244
ISBN
978-1-45-034073-1
DOI
10.1145/2983323.2983753
Appears in Collections:
COLLEGE OF ENGINEERING[S](공과대학) > COMPUTER SCIENCE(컴퓨터소프트웨어학부) > Articles
Files in This Item:
There are no files associated with this item.
Export
RIS (EndNote)
XLS (Excel)
XML


qrcode

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

BROWSE