IFIBA   22255
INSTITUTO DE FISICA DE BUENOS AIRES
Unidad Ejecutora - UE
artículos
Título:
Modeling the evolution of item-rating networks using time domain preferential attachment
Autor/es:
EDMUNDO LAVIA; CHERNOMORETZ, ARIEL; JAVIER MARTIN BULDU; MASSIMILIANO ZANIN; BALENZUELA, PABLO
Revista:
INTERNATIONAL JOURNAL OF BIFURCATION AND CHAOS
Editorial:
WORLD SCIENTIFIC PUBL CO PTE LTD
Referencias:
Lugar: London, UK; Año: 2012 vol. 22 p. 1250180 - 1250192
ISSN:
0218-1274
Resumen:
The understanding of the structure and dynamics of the intricate network of connections among people that consumes products through Internet appears as an extremely useful asset in order to improve the performance of personal recommendation algorithms. In this contribution we analyzed five-years records ofmovie-rating transactions provided by Netflix, a movie rental platform where users rate movies from an on-line catalog. This dataset can be studied as a bipartite user-item network whose structure evolves in time. Even though several topological properties from subsets of this bipartite network have been reported with a model that combines random and preferential attachment mechanisms, there are still many aspects worth to be explored, as they are connected to relevant phenomena underlying the evolution of the network. In this work, we test the hypothesis that bursty human behavior is essential in  order to describe how a  bipartite user-item network evolves in time. To that end, we propose a novel model that combines, for user nodes, a network growing prescription based on a preferential attachment mechanism acting not only in the topological domain (i.e. based on node degrees) but also in  time domain.In the case of items, the model mixes degree preferential attachment and random selection. With these ingredients we are able to reproduce the asymptotic degree distribution, showing an excellent agreement with the Netflix data in several time-dependent topological properties. Finally, we discuss its implications in the design of recommendation algorithms based in real data coming from rating networks.