PIN-TRUST: Fast trust propagation exploiting positive, implicit, and negative information
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Jang, Min-Hee | - |
dc.contributor.author | Faloutsos, Christos | - |
dc.contributor.author | Kim, Sang-Wook | - |
dc.contributor.author | Kang, U. | - |
dc.contributor.author | Ha, Jiwoon | - |
dc.date.accessioned | 2022-07-15T05:33:41Z | - |
dc.date.available | 2022-07-15T05:33:41Z | - |
dc.date.created | 2021-05-13 | - |
dc.date.issued | 2016-10 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/153826 | - |
dc.description.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. | - |
dc.language | 영어 | - |
dc.language.iso | en | - |
dc.publisher | Association for Computing Machinery | - |
dc.title | PIN-TRUST: Fast trust propagation exploiting positive, implicit, and negative information | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | Kim, Sang-Wook | - |
dc.identifier.doi | 10.1145/2983323.2983753 | - |
dc.identifier.scopusid | 2-s2.0-84996598242 | - |
dc.identifier.bibliographicCitation | International Conference on Information and Knowledge Management, Proceedings, v.24-28-October-2016, pp.629 - 638 | - |
dc.relation.isPartOf | International Conference on Information and Knowledge Management, Proceedings | - |
dc.citation.title | International Conference on Information and Knowledge Management, Proceedings | - |
dc.citation.volume | 24-28-October-2016 | - |
dc.citation.startPage | 629 | - |
dc.citation.endPage | 638 | - |
dc.type.rims | ART | - |
dc.type.docType | Conference Paper | - |
dc.description.journalClass | 1 | - |
dc.description.isOpenAccess | N | - |
dc.description.journalRegisteredClass | scopus | - |
dc.subject.keywordPlus | Forecasting | - |
dc.subject.keywordPlus | Belief propagation | - |
dc.subject.keywordPlus | Graph mining | - |
dc.subject.keywordPlus | Interaction information | - |
dc.subject.keywordPlus | Negative information | - |
dc.subject.keywordPlus | Prediction accuracy | - |
dc.subject.keywordPlus | Social Network Sites | - |
dc.subject.keywordPlus | Trust predictions | - |
dc.subject.keywordPlus | Trust propagation | - |
dc.subject.keywordPlus | Knowledge management | - |
dc.subject.keywordAuthor | Belief propagation | - |
dc.subject.keywordAuthor | Graph mining | - |
dc.subject.keywordAuthor | Trust prediction | - |
dc.identifier.url | https://dl.acm.org/doi/10.1145/2983323.2983753 | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
222, Wangsimni-ro, Seongdong-gu, Seoul, 04763, Korea+82-2-2220-1365
COPYRIGHT © 2021 HANYANG UNIVERSITY.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.