IRAIApr 6, 2017

Conformative Filtering for Implicit Feedback Data

arXiv:1704.01889v25 citations
Originality Incremental advance
AI Analysis

This addresses the challenge of inaccurate negative assumptions in implicit feedback for recommendation systems, though it appears incremental as it builds on clustering methods.

The paper tackled the problem of lacking negative examples in implicit feedback for recommendation by proposing Conformative Filtering, which uses clustering to identify user taste groups and achieved superior performance on two real-world datasets compared to baselines.

Implicit feedback is the simplest form of user feedback that can be used for item recommendation. It is easy to collect and is domain independent. However, there is a lack of negative examples. Previous work tackles this problem by assuming that users are not interested or not as much interested in the unconsumed items. Those assumptions are often severely violated since non-consumption can be due to factors like unawareness or lack of resources. Therefore, non-consumption by a user does not always mean disinterest or irrelevance. In this paper, we propose a novel method called Conformative Filtering (CoF) to address the issue. The motivating observation is that if there is a large group of users who share the same taste and none of them have consumed an item before, then it is likely that the item is not of interest to the group. We perform multidimensional clustering on implicit feedback data using hierarchical latent tree analysis (HLTA) to identify user `tastes' groups and make recommendations for a user based on her memberships in the groups and on the past behavior of the groups. Experiments on two real-world datasets from different domains show that CoF has superior performance compared to several common baselines.

Code Implementations1 repo
Foundations

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

Your Notes