How to impute missing ratings?: Claims, solution, and its application to collaborative filteringopen access
- Authors
- Lee, Youngnam; Kim, Sang-Wook; Park, Sunju; Xie,Xing
- Issue Date
- Apr-2018
- Publisher
- Association for Computing Machinery, Inc
- Keywords
- Collaborative filtering; Data imputation; Data sparsity; Recommender systems
- Citation
- The Web Conference 2018 - Proceedings of the World Wide Web Conference, WWW 2018, pp.783 - 792
- Indexed
- SCOPUS
- Journal Title
- The Web Conference 2018 - Proceedings of the World Wide Web Conference, WWW 2018
- Start Page
- 783
- End Page
- 792
- URI
- https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/150235
- DOI
- 10.1145/3178876.3186159
- Abstract
- Data sparsity is one of the biggest problems faced by collaborative filtering used in recommender systems. Data imputation alleviates the data sparsity problem by inferring missing ratings and imputing them to the original rating matrix. In this paper, we identify the limitations of existing data imputation approaches and suggest three new claims that all data imputation approaches should follow to achieve high recommendation accuracy. Furthermore, we propose a deep-learning based approach to compute imputed values that satisfies all three claims. Based on our hypothesis that most pre-use preferences (e.g., impressions) on items lead to their post-use preferences (e.g., ratings), our approach tries to understand via deep learning how pre-use preferences lead to post-use preferences differently depending on the characteristics of users and items. Through extensive experiments on real-world datasets, we verify our three claims and hypothesis, and also demonstrate that our approach significantly outperforms existing state-of-the-art approaches.
- 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/150235)
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.