Exploiting implicit and explicit signed trust relationships for effective recommendations
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Ali, Irfan | - |
dc.contributor.author | Hong, Jiwon | - |
dc.contributor.author | Kim, Sang-Wook | - |
dc.date.accessioned | 2022-07-14T07:27:20Z | - |
dc.date.available | 2022-07-14T07:27:20Z | - |
dc.date.created | 2021-05-13 | - |
dc.date.issued | 2017-04 | - |
dc.identifier.issn | 0000-0000 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/152567 | - |
dc.description.abstract | Trust networks have been widely used to mitigate the data sparsity and cold-start problems of collaborative filtering. Recently, some approaches have been proposed which exploit explicit signed trust relationships, i.e., trust and distrust relationships. These approaches ignore the fact that users despite trusting/distrusting each other in a trust network may have different preferences in real-life. Most of these approaches also handle the notion of the transitivity of distrust as well as trust. However, other existing work observed that trust is transitive while distrust is intransitive. Moreover, explicit signed trust relationships are fairly sparse and may not contribute to infer true preferences of users. In this paper, we propose to create implicit signed trust relationships and exploit them along with explicit signed trust relationship to solve sparsity problem of trust relationships. We also confirm the similarity (resp. dissimilarity) of implicit and explicit trust (resp. distrust) relationships by using the similarity score between users so that users' true preferences can be inferred. In addition to these strategies, we also propose a matrix factorization model that simultaneously exploits implicit and explicit signed trust relationships along with rating information and also handles transitivity of trust and intransitivity of distrust. Extensive experiments on Epinions dataset show that the proposed approach outperforms existing approaches in terms of accuracy. | - |
dc.language | 영어 | - |
dc.language.iso | en | - |
dc.publisher | Association for Computing Machinery | - |
dc.title | Exploiting implicit and explicit signed trust relationships for effective recommendations | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | Kim, Sang-Wook | - |
dc.identifier.doi | 10.1145/3019612.3019666 | - |
dc.identifier.scopusid | 2-s2.0-85020876498 | - |
dc.identifier.bibliographicCitation | Proceedings of the ACM Symposium on Applied Computing, v.Part F128005, pp.804 - 810 | - |
dc.relation.isPartOf | Proceedings of the ACM Symposium on Applied Computing | - |
dc.citation.title | Proceedings of the ACM Symposium on Applied Computing | - |
dc.citation.volume | Part F128005 | - |
dc.citation.startPage | 804 | - |
dc.citation.endPage | 810 | - |
dc.type.rims | ART | - |
dc.type.docType | Conference Paper | - |
dc.description.journalClass | 1 | - |
dc.description.isOpenAccess | N | - |
dc.description.journalRegisteredClass | scopus | - |
dc.subject.keywordPlus | Factorization | - |
dc.subject.keywordPlus | Recommender systems | - |
dc.subject.keywordPlus | Cold start problems | - |
dc.subject.keywordPlus | Explicit trusts | - |
dc.subject.keywordPlus | Matrix factorizations | - |
dc.subject.keywordPlus | Rating information | - |
dc.subject.keywordPlus | Similarity scores | - |
dc.subject.keywordPlus | Sparsity problems | - |
dc.subject.keywordPlus | Trust relationship | - |
dc.subject.keywordPlus | Trust-aware | - |
dc.subject.keywordPlus | Collaborative filtering | - |
dc.subject.keywordAuthor | Collaborative filtering | - |
dc.subject.keywordAuthor | Recommender systems | - |
dc.subject.keywordAuthor | Trust-aware recommendations | - |
dc.identifier.url | https://dl.acm.org/doi/10.1145/3019612.3019666 | - |
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.