skip to main content


Title: Constructing compact and effective graphs for recommender systems via node and edge aggregations

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 naive 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 e ective graphs called Factor-Item bipartite graphs by aggregating nodes and edges of a log-metadata graph. Furthermore, 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.
 [1] ;  [2] ;  [3]
  1. Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States)
  2. Georgia Institute of Technology, Atlanta, GA (United States)
  3. Seoul National Univ. (Republic of Korea)
Publication Date:
Grant/Contract Number:
Accepted Manuscript
Journal Name:
Expert Systems with Applications
Additional Journal Information:
Journal Volume: 42; Journal Issue: 7; Journal ID: ISSN 0957-4174
Research Org:
Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States)
Sponsoring Org:
USDOE Laboratory Directed Research and Development (LDRD) Program
Country of Publication:
United States
97 MATHEMATICS AND COMPUTING; graph; heterogeneity; recommendation; aggregation; random-walk; ranking
OSTI Identifier:
Alternate Identifier(s):
OSTI ID: 1437067