M-BPR: A novel approach to improving BPR for recommendation with multi-type pair-wise preferences
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Lee, Yeon-Chang | - |
dc.contributor.author | Kim, Taeho | - |
dc.contributor.author | Choi, Jaeho | - |
dc.contributor.author | He, Xiangnan | - |
dc.contributor.author | Kim, Sang-Wook | - |
dc.date.accessioned | 2022-07-07T01:00:19Z | - |
dc.date.available | 2022-07-07T01:00:19Z | - |
dc.date.created | 2021-05-11 | - |
dc.date.issued | 2021-02 | - |
dc.identifier.issn | 0020-0255 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/142411 | - |
dc.description.abstract | In this paper, we examine the two assumptions of the Bayesian personalized ranking (BPR), a well-known pair-wise method for one-class collaborative filtering (OCCF): (1) a user with the same degree of negative preferences for all her unrated items; and (2) a user always preferring her rated items to all her unrated items. We claim that (A1) and (A2) cause recommendation errors because they do not always hold in practice. To address these problems, we first define fine-grained multi-type pair-wise preferences (PPs), which are more sophisticated than the single-type PP used in BPR. Then, we propose a novel pair-wise approach called M-BPR, which exploits multi-type PPs together in learning users' more detailed preferences. Furthermore, we refine M-BPR by employing the concept of item groups to reduce the uncertainty of a user's a single item-level preference. Through extensive experiments using four real-life datasets, we demonstrate that our approach addresses the problems of the original BPR effectively and also outperforms seven state-of-the-art OCCF (i.e., four pair-wise and three point-wise) methods significantly. | - |
dc.language | 영어 | - |
dc.language.iso | en | - |
dc.publisher | ELSEVIER SCIENCE INC | - |
dc.title | M-BPR: A novel approach to improving BPR for recommendation with multi-type pair-wise preferences | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | Kim, Sang-Wook | - |
dc.identifier.doi | 10.1016/j.ins.2020.08.027 | - |
dc.identifier.scopusid | 2-s2.0-85090121347 | - |
dc.identifier.wosid | 000590678600015 | - |
dc.identifier.bibliographicCitation | INFORMATION SCIENCES, v.547, pp.255 - 270 | - |
dc.relation.isPartOf | INFORMATION SCIENCES | - |
dc.citation.title | INFORMATION SCIENCES | - |
dc.citation.volume | 547 | - |
dc.citation.startPage | 255 | - |
dc.citation.endPage | 270 | - |
dc.type.rims | ART | - |
dc.type.docType | Article | - |
dc.description.journalClass | 1 | - |
dc.description.isOpenAccess | N | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalResearchArea | Computer Science | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Information Systems | - |
dc.subject.keywordPlus | Artificial intelligence | - |
dc.subject.keywordPlus | Software engineering | - |
dc.subject.keywordPlus | Bayesian | - |
dc.subject.keywordPlus | Fine grained | - |
dc.subject.keywordPlus | Item-level | - |
dc.subject.keywordPlus | Point wise | - |
dc.subject.keywordPlus | Real life datasets | - |
dc.subject.keywordPlus | State of the art | - |
dc.subject.keywordPlus | Collaborative filtering | - |
dc.subject.keywordAuthor | Recommender systems | - |
dc.subject.keywordAuthor | One-class collaborative filtering | - |
dc.subject.keywordAuthor | Bayesian personalized ranking | - |
dc.subject.keywordAuthor | Pair-wise preferences | - |
dc.identifier.url | https://www.sciencedirect.com/science/article/pii/S0020025520307945?via%3Dihub | - |
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.