Constructing Compact and Effective Graphs for Recommender Systems via Node and Edge Aggregations

Information

Title Constructing Compact and Effective Graphs for Recommender Systems via Node and Edge Aggregations
Authors Sangkeun Lee, Minsuk Kahng, Sang-goo Lee
Year 2015 / 5
Keywords graph, heterogeneity, recommendation, aggregation, random-walk, ranking
Acknowledgement SRC
Publication Type International Journal
Publication Expert Systems with Applications (ESWA), Volume 42, Issue 7, pp. 3396–3409
Index SCIE
Link doi
File download

Abstract

Exploiting graphs for recommender systems has great potential to flexibly incorporate heterogeneous information for producing better recommendation results. As our baseline approach, we first introduce a naïve graph-based recommendation method, which operates with a heterogeneous log-metadata graph constructed from user log and content metadata databases. Although the naïve graph-based recommendation method is simple, it allows us to take advantages of heterogeneous information and shows promising flexibility and recommendation accuracy. However, it often leads to extensive processing time due to the sheer size of the graphs constructed from entire user log and content metadata databases. In this paper, we propose node and edge aggregation approaches to constructing compact and effective graphs called ‘Factor-Item bipartite graphs’ by aggregating nodes and edges of a log-metadata graph. Experimental results using real world datasets indicate that our approach can significantly reduce the size of graphs exploited for recommender systems without sacrificing the recommendation quality.