Rating augmentation with generative adversarial networks towards accurate collaborative filtering
- Authors
- Chae, Dong-Kyu; Kang, Jin-Soo; Kim, Sang-Wook; Choi, Jaeho
- Issue Date
- May-2019
- Publisher
- Association for Computing Machinery, Inc
- Keywords
- Collaborative filtering; Data augmentation; Data sparsity; Generative adversarial networks; Top-N recommendation
- Citation
- The Web Conference 2019 - Proceedings of the World Wide Web Conference, WWW 2019, pp.2616 - 2622
- Indexed
- SCOPUS
- Journal Title
- The Web Conference 2019 - Proceedings of the World Wide Web Conference, WWW 2019
- Start Page
- 2616
- End Page
- 2622
- URI
- https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/147841
- DOI
- 10.1145/3308558.3313413
- Abstract
- Generative Adversarial Networks (GAN) have not only achieved a big success in various generation tasks such as images, but also boosted the accuracy of classification tasks by generating additional labeled data, which is called data augmentation. In this paper, we propose a Rating Augmentation framework with GAN, named RAGAN, aiming to alleviate the data sparsity problem in collaborative filtering (CF), eventually improving recommendation accuracy significantly. We identify a unique challenge that arises when applying GAN to CF for rating augmentation: naive RAGAN tends to generate values biased towards high ratings. Then, we propose a refined version of RAGAN, named RAGANBT, which addresses this challenge successfully. Via our extensive experiments, we validate that our RAGANBT is really effective to solve the data sparsity problem, thereby providing existing CF models with great improvement in accuracy under various situations such as basic top-N recommendation, long-tail item recommendation, and recommendation to cold-start users. © 2019 IW3C2 (International World Wide Web Conference Committee), published under Creative Commons CC-BY 4.0 License.
- Files in This Item
-
Go to Link
- Appears in
Collections - 서울 공과대학 > 서울 컴퓨터소프트웨어학부 > 1. Journal Articles
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.