Pseudo-Implicit Feedback for Alleviating Data Sparsity in Top-K Recommendation

January 03, 2019 ยท Entered Twilight ยท ๐Ÿ› Industrial Conference on Data Mining

๐ŸŒ… TWILIGHT: Old Age
Predates the code-sharing era โ€” a pioneer of its time

"Last commit was 7.0 years ago (โ‰ฅ5 year threshold)"

Evidence collected by the PWNC Scanner

Repo contents: Data, PsiRec, README.md

Authors Yun He, Haochen Chen, Ziwei Zhu, James Caverlee arXiv ID 1901.00597 Category cs.IR: Information Retrieval Cross-listed cs.SI Citations 8 Venue Industrial Conference on Data Mining Repository https://github.com/heyunh2015/PsiRecICDM2018 โญ 6 Last Checked 1 month ago
Abstract
We propose PsiRec, a novel user preference propagation recommender that incorporates pseudo-implicit feedback for enriching the original sparse implicit feedback dataset. Three of the unique characteristics of PsiRec are: (i) it views user-item interactions as a bipartite graph and models pseudo-implicit feedback from this perspective; (ii) its random walks-based approach extracts graph structure information from this bipartite graph, toward estimating pseudo-implicit feedback; and (iii) it adopts a Skip-gram inspired measure of confidence in pseudo-implicit feedback that captures the pointwise mutual information between users and items. This pseudo-implicit feedback is ultimately incorporated into a new latent factor model to estimate user preference in cases of extreme sparsity. PsiRec results in improvements of 21.5% and 22.7% in terms of Precision@10 and Recall@10 over state-of-the-art Collaborative Denoising Auto-Encoders. Our implementation is available at https://github.com/heyunh2015/PsiRecICDM2018.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

๐Ÿ“œ Similar Papers

In the same crypt โ€” Information Retrieval