l -Injection: Toward Effective Collaborative Filtering Using Uninteresting Items
- Authors
- Lee, Jongwuk; Hwang, Won-Seok; Parc, Juan; Lee, Youngnam; Kim, Sang-Wook; Lee, Dongwon
- Issue Date
- Jan-2019
- Publisher
- IEEE COMPUTER SOC
- Keywords
- Recommender systems; collaborative filtering; data sparsity; uninteresting items; pre-use preference; post-use preference
- Citation
- IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, v.31, no.1, pp.3 - 16
- Indexed
- SCIE
SCOPUS
- Journal Title
- IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING
- Volume
- 31
- Number
- 1
- Start Page
- 3
- End Page
- 16
- URI
- https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/148481
- DOI
- 10.1109/TKDE.2017.2698461
- ISSN
- 1041-4347
- Abstract
- We develop a novel framework, named as iota-injection, to address the sparsity problem of recommender systems. By carefully injecting low values to a selected set of unrated user-item pairs in a user-item matrix, we demonstrate that top-N recommendation accuracies of various collaborative filtering (CF) techniques can be significantly and consistently improved. We first adopt the notion of pre-use preferences of users toward a vast amount of unrated items. Using this notion, we identify uninteresting items that have not been rated yet but are likely to receive low ratings from users, and selectively impute them as low values. As our proposed approach is method-agnostic, it can be easily applied to a variety of CF algorithms. Through comprehensive experiments with three real-life datasets (e.g., Movielens, Ciao, and Watcha), we demonstrate that our solution consistently and universally enhances the accuracies of existing CF algorithms (e.g., item-based CF, SVD-based CF, and SVD++) by 2.5 to 5 times on average. Furthermore, our solution improves the running time of those CF methods by 1.2 to 2.3 times when its setting produces the best accuracy.
- 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.