IRSep 27, 2013

A Random Walk Model for Item Recommendation in Folksonomies

arXiv:1310.7957v14 citations
Originality Incremental advance
AI Analysis

This addresses the performance limitation in recommender systems for Web2.0 applications due to sparse user-tag-item data, representing an incremental improvement.

The paper tackled the sparsity problem in tag-based collaborative filtering for item recommendation in folksonomies by proposing a random-walk-based algorithm with smoothing strategies, resulting in empirically demonstrated efficacy on real-world datasets.

Social tagging, as a novel approach to information organization and discovery, has been widely adopted in many Web2.0 applications. The tags provide a new type of information that can be exploited by recommender systems. Nevertheless, the sparsity of ternary <user, tag, item> interaction data limits the performance of tag-based collaborative filtering. This paper proposes a random-walk-based algorithm to deal with the sparsity problem in social tagging data, which captures the potential transitive associations between users and items through their interaction with tags. In particular, two smoothing strategies are presented from both the user-centric and item-centric perspectives. Experiments on real-world data sets empirically demonstrate the efficacy of the proposed algorithm.

Foundations

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

Your Notes