Papers
Topics
Authors
Recent
Search
2000 character limit reached

Exploiting Hierarchy for Ranking-based Recommendation

Published 23 Dec 2015 in cs.IR and cs.SI | (1512.07444v1)

Abstract: The purpose of this master's thesis is to study and develop a new algorithmic framework for collaborative filtering (CF) to generate recommendations. The method we propose is based on the exploitation of the hierarchical structure of the item space and intuitively "stands" on the property of Near Complete Decomposability (NCD) which is inherent in the structure of the majority of hierarchical systems. Building on the intuition behind the NCDawareRank algorithm and its related concept of NCD proximity, we model our system in a way that illuminates its endemic characteristics and we propose a new algorithmic framework for recommendations, called HIR. We focus on combining the direct with the NCD "neighborhoods" of items to achieve better characterization of the inter-item relations, in order to improve the quality of recommendations and alleviate sparsity related problems.

Authors (1)
Citations (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.