Top-N recommendation through belief propagation
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Ha, Jiwoon | - |
dc.contributor.author | Kwon, Soon-Hyoung | - |
dc.contributor.author | Kim, Sang-Wook | - |
dc.contributor.author | Faloutsos, Christos | - |
dc.contributor.author | Park, Sunju | - |
dc.date.accessioned | 2022-07-16T13:24:43Z | - |
dc.date.available | 2022-07-16T13:24:43Z | - |
dc.date.created | 2021-05-13 | - |
dc.date.issued | 2012-10 | - |
dc.identifier.issn | 0000-0000 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/164503 | - |
dc.description.abstract | The top-n recommendation focuses on finding the top-n items that the target user is likely to purchase rather than predicting his/her ratings on individual items. In this paper, we propose a novel method that provides top-n recommendation by probabilistically determining the target user's preference on items. This method models the purchasing relationships between users and items as a bipartite graph and employs Belief Propagation to compute the preference of the target user on items. We analyze the proposed method in detail by examining the changes in recommendation accuracy under different parameter settings. We also show that the proposed method is up to 40% more accurate than an existing method by comparing it with an RWR-based method via extensive experiments. | - |
dc.language | 영어 | - |
dc.language.iso | en | - |
dc.publisher | Association for Computing Machinary, Inc. | - |
dc.title | Top-N recommendation through belief propagation | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | Kim, Sang-Wook | - |
dc.identifier.doi | 10.1145/2396761.2398636 | - |
dc.identifier.scopusid | 2-s2.0-84871098012 | - |
dc.identifier.bibliographicCitation | ACM International Conference Proceeding Series, pp.2343 - 2346 | - |
dc.relation.isPartOf | ACM International Conference Proceeding Series | - |
dc.citation.title | ACM International Conference Proceeding Series | - |
dc.citation.startPage | 2343 | - |
dc.citation.endPage | 2346 | - |
dc.type.rims | ART | - |
dc.type.docType | Conference Paper | - |
dc.description.journalClass | 1 | - |
dc.description.isOpenAccess | N | - |
dc.description.journalRegisteredClass | scopus | - |
dc.subject.keywordPlus | Belief propagation | - |
dc.subject.keywordPlus | Bipartite graphs | - |
dc.subject.keywordPlus | Method model | - |
dc.subject.keywordPlus | Parameter setting | - |
dc.subject.keywordPlus | Recommendation accuracy | - |
dc.subject.keywordPlus | top-n recommendation | - |
dc.subject.keywordPlus | Computer applications | - |
dc.subject.keywordPlus | Data mining | - |
dc.subject.keywordPlus | Knowledge management | - |
dc.subject.keywordAuthor | belief propagation | - |
dc.subject.keywordAuthor | data mining | - |
dc.subject.keywordAuthor | top-n recommendation | - |
dc.identifier.url | https://dl.acm.org/doi/10.1145/2396761.2398636 | - |
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.