%0 Conference Paper %1 Jang:2016:PFT:2983323.2983753 %A Jang, Min-Hee %A Faloutsos, Christos %A Kim, Sang-Wook %A Kang, U %A Ha, Jiwoon %B Proceedings of the 25th ACM International on Conference on Information and Knowledge Management %C New York, NY, USA %D 2016 %I ACM %K belief-propagation implicit-trust social-information-access trust-prediction %P 629--638 %R 10.1145/2983323.2983753 %T PIN-TRUST: Fast Trust Propagation Exploiting Positive, Implicit, and Negative Information %U http://doi.acm.org/10.1145/2983323.2983753 %X 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. %@ 978-1-4503-4073-1

@inproceedings{Jang:2016:PFT: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.}, acmid = {2983753}, added-at = {2017-02-08T15:52:05.000+0100}, address = {New York, NY, USA}, author = {Jang, Min-Hee and Faloutsos, Christos and Kim, Sang-Wook and Kang, U and Ha, Jiwoon}, biburl = {https://www.bibsonomy.org/bibtex/2418a3801c750507c320a0104d89e0f97/xianteng}, booktitle = {Proceedings of the 25th ACM International on Conference on Information and Knowledge Management}, description = {PIN-TRUST}, doi = {10.1145/2983323.2983753}, interhash = {81b4760e65e3b2817df9277d93a716a7}, intrahash = {418a3801c750507c320a0104d89e0f97}, isbn = {978-1-4503-4073-1}, keywords = {belief-propagation implicit-trust social-information-access trust-prediction}, location = {Indianapolis, Indiana, USA}, numpages = {10}, pages = {629--638}, publisher = {ACM}, series = {CIKM '16}, timestamp = {2017-02-08T15:52:05.000+0100}, title = {PIN-TRUST: Fast Trust Propagation Exploiting Positive, Implicit, and Negative Information}, url = {http://doi.acm.org/10.1145/2983323.2983753}, year = 2016 }