We investigate how to address the shortcomings of the popular One-Class Collaborative Filtering (OCCF) methods in handling challenging “sparse” dataset in one-class setting (e.g., clicked or bookmarked), and propose a novel graph-theoretic OCCF approach, named as gOCCF, by exploiting both positive preferences (derived from rated items) as well as negative preferences (derived from unrated items). In capturing both positive and negative preferences as a bipartite graph, further, we apply the graph shattering theory to determine the right amount of negative preferences to use. Then, we develop a suite of novel graph-based OCCF methods based on the random walk with restart and belief propagation methods. Through extensive experiments using 3 real-life datasets, we show that our gOCCF effectively addresses the sparsity challenge and significantly outperforms all of 8 competing methods in accuracy on very sparse datasets while providing comparable accuracy to the best performing OCCF methods on less sparse datasets.
The datasets and implementations used in the empirical validation are available for access:
1. Datasets
MovieLens 100K [Download1] [Download2]
CiteULike [Download]
For Watcha dataset, we cannot publicly disclose the dataset due to some restrictions.
2. Implementations
WRMF for inferring the degree of interestingness [Download]
ShatterPlot for determining the number of U-items [Download]
gOCCF for graph-based recommendation [Download]
gOCCF: Graph-Theoretic One-Class Collaborative Filtering Based on Uninteresting Items
Yeon-Chang Lee, Sang-Wook Kim, Dongwon Lee
AAAI Int'l Conf. on Artificial Intelligence (AAAI), Feb. 2-7, 2018
Graph-Theoretic One-Class Collaborative Filtering using Signed Random Walk with Restart
Yeon-Chang Lee, Daeyoung Park, Jiwon Son, Taeho Kim, and Sang-Wook Kim
IEEE Int'l Conf. on Big Data and Smart Computing (BigComp), Feb. 19-22, 2020
Exploiting Uninteresting Items for Effective Graph-Based One-Class Collaborative Filtering
Yeon-Chang Lee, Jiwon Son, Taeho Kim, Daeyoung Park, and Sang-Wook Kim
The Journal of Supercomputing, Vol. , pp. , 2021 (online first)
We encourage you to cite our paper if you have used the code in your work. You can use the following BibTex citation:
@inproceedings{DBLP:conf/aaai/LeeK018,
author = {Yeon{-}Chang Lee and
Sang{-}Wook Kim and
Dongwon Lee},
title = {gOCCF: Graph-Theoretic One-Class Collaborative Filtering Based on Uninteresting Items},
booktitle = {Proceedings of the Thirty-Second {AAAI} Conference on Artificial Intelligence (AAAI)},
pages = {3448--3456},
year = {2018}
}