The essential role of time in network-based recommendation

Abstract

Random walks on bipartite networks have been used extensively to design personalized recommendation methods. While aging has been identified as a key component in the growth of information networks, most research has focused on the networks' structural properties and neglected the often available time information. Time has been largely ignored both by the investigated recommendation methods as well as by the methodology used to evaluate them. We show that this time-unaware approach overestimates the methods' recommendation performance. Motivated by microscopic rules of network growth, we propose a time-aware modification of an existing recommendation method and show that by combining the temporal and structural aspects, it outperforms the existing methods. The performance improvements are particularly striking in systems with fast aging.

7 pages, 3 figures, 2 tables

References in corpus (6)

• Power-law distributions in empirical data
• Robust dynamic classes revealed by measuring the response function of a social system
• Attention decay in science
• Network-based recommendation algorithms: A review
• Identification of milestone papers through time-balanced network centrality
• Do recommender systems benefit users?

Cited by in corpus (5)

• Ranking in evolving complex networks
• Recommender systems based on graph embedding techniques: A comprehensive review
• From Relational Data to Graphs: Inferring Significant Links using Generalized Hypergeometric Ensembles
• Randomizing growing networks with a time-respecting null model
• Enhancing countries' fitness with recommender systems on the international trade network