Exploiting uninteresting items for effective graph-based one-class collaborative filtering
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Lee, Yeon-Chang | - |
dc.contributor.author | Son, Jiwon | - |
dc.contributor.author | Kim, Taeho | - |
dc.contributor.author | Park, Daeyoung | - |
dc.contributor.author | Kim, Sang-Wook | - |
dc.date.accessioned | 2022-07-06T16:30:02Z | - |
dc.date.available | 2022-07-06T16:30:02Z | - |
dc.date.created | 2021-05-11 | - |
dc.date.issued | 2021-07 | - |
dc.identifier.issn | 0920-8542 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/141591 | - |
dc.description.abstract | The goal of recommender systems is to identify the items appealing to a target user by analyzing her/his past preferences. Collaborative filtering is one of the most popular recommendation methods that use the similarity between users' past behaviors such as explicit user ratings (i.e., multi-class setting) or implicit click logs (i.e., one-class setting). Graph-theoretic one-class collaborative filtering (gOCCF) has been successful in dealing with sparse datasets in one-class settings (e.g., clicked or bookmarked). In this paper, we point out the problem that gOCCF requires long processing time compared to existing OCCF methods. To overcome the limitation of the original gOCCF, we propose a new gOCCF approach based on signed random walk with restart (SRWR). Using SRWR, the proposed approach accurately and efficiently captures users' preferences by analyzing not only the positive preferences from rated items but also the negative preferences from uninteresting items. We also perform an in-depth analysis to further understand the effect of employing uninteresting items in OCCF. Toward this end, we employ the following well-known graph properties: (1) effective diameter, (2) number of reachable pairs, (3) number of nodes in the largest connected component, (4) clustering coefficient, (5) singular values, and (6) signed butterfly. From this comprehensive analysis, we demonstrate that signed graphs with uninteresting items have properties similar to real-life signed graphs. Lastly, through extensive experiments using real-life datasets, we verify that the proposed approach improves the accuracy and decreases the processing time of the original gOCCF. | - |
dc.language | 영어 | - |
dc.language.iso | en | - |
dc.publisher | SPRINGER | - |
dc.title | Exploiting uninteresting items for effective graph-based one-class collaborative filtering | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | Kim, Sang-Wook | - |
dc.identifier.doi | 10.1007/s11227-020-03573-8 | - |
dc.identifier.scopusid | 2-s2.0-85098983403 | - |
dc.identifier.wosid | 000604819500003 | - |
dc.identifier.bibliographicCitation | JOURNAL OF SUPERCOMPUTING, v.77, no.7, pp.6832 - 6851 | - |
dc.relation.isPartOf | JOURNAL OF SUPERCOMPUTING | - |
dc.citation.title | JOURNAL OF SUPERCOMPUTING | - |
dc.citation.volume | 77 | - |
dc.citation.number | 7 | - |
dc.citation.startPage | 6832 | - |
dc.citation.endPage | 6851 | - |
dc.type.rims | ART | - |
dc.type.docType | Article; Early Access | - |
dc.description.journalClass | 1 | - |
dc.description.isOpenAccess | N | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalResearchArea | Computer Science | - |
dc.relation.journalResearchArea | Engineering | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Hardware & Architecture | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Theory & Methods | - |
dc.relation.journalWebOfScienceCategory | Engineering, Electrical & Electronic | - |
dc.subject.keywordPlus | Graph algorithms | - |
dc.subject.keywordPlus | Graph theory | - |
dc.subject.keywordPlus | Graphic methods | - |
dc.subject.keywordPlus | Clustering coefficient | - |
dc.subject.keywordPlus | Comprehensive analysis | - |
dc.subject.keywordPlus | Effective diameter | - |
dc.subject.keywordPlus | In-depth analysis | - |
dc.subject.keywordPlus | Largest connected component | - |
dc.subject.keywordPlus | Random walk with restart | - |
dc.subject.keywordPlus | Real life datasets | - |
dc.subject.keywordPlus | Recommendation methods | - |
dc.subject.keywordPlus | Collaborative filtering | - |
dc.subject.keywordAuthor | One-class collaborative filtering | - |
dc.subject.keywordAuthor | Uninteresting items | - |
dc.subject.keywordAuthor | Graph-based recommendations | - |
dc.identifier.url | https://link.springer.com/article/10.1007/s11227-020-03573-8 | - |
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.