M-BPR: A novel approach to improving BPR for recommendation with multi-type pair-wise preferences
- Authors
- Lee, Yeon-Chang; Kim, Taeho; Choi, Jaeho; He, Xiangnan; Kim, Sang-Wook
- Issue Date
- Feb-2021
- Publisher
- ELSEVIER SCIENCE INC
- Keywords
- Recommender systems; One-class collaborative filtering; Bayesian personalized ranking; Pair-wise preferences
- Citation
- INFORMATION SCIENCES, v.547, pp.255 - 270
- Indexed
- SCIE
SCOPUS
- Journal Title
- INFORMATION SCIENCES
- Volume
- 547
- Start Page
- 255
- End Page
- 270
- URI
- https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/142411
- DOI
- 10.1016/j.ins.2020.08.027
- ISSN
- 0020-0255
- 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.
- Files in This Item
-
Go to Link
- Appears in
Collections - 서울 공과대학 > 서울 컴퓨터소프트웨어학부 > 1. Journal Articles
![qrcode](https://api.qrserver.com/v1/create-qr-code/?size=55x55&data=https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/142411)
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.