LGIRMLJan 15, 2019

DeepCF: A Unified Framework of Representation Learning and Matching Function Learning in Recommender System

arXiv:1901.04704v1166 citations
Originality Incremental advance
AI Analysis

This work addresses a core challenge in recommender systems for improving recommendation accuracy, though it appears incremental as it builds on and integrates existing approaches.

The paper tackles the problem of matching users and items in recommender systems by proposing DeepCF, a unified framework that combines representation learning and matching function learning to overcome limitations of existing methods, achieving improved performance on four datasets.

In general, recommendation can be viewed as a matching problem, i.e., match proper items for proper users. However, due to the huge semantic gap between users and items, it's almost impossible to directly match users and items in their initial representation spaces. To solve this problem, many methods have been studied, which can be generally categorized into two types, i.e., representation learning-based CF methods and matching function learning-based CF methods. Representation learning-based CF methods try to map users and items into a common representation space. In this case, the higher similarity between a user and an item in that space implies they match better. Matching function learning-based CF methods try to directly learn the complex matching function that maps user-item pairs to matching scores. Although both methods are well developed, they suffer from two fundamental flaws, i.e., the limited expressiveness of dot product and the weakness in capturing low-rank relations respectively. To this end, we propose a general framework named DeepCF, short for Deep Collaborative Filtering, to combine the strengths of the two types of methods and overcome such flaws. Extensive experiments on four publicly available datasets demonstrate the effectiveness of the proposed DeepCF framework.

Code Implementations2 repos
Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes