Detecting the Community Structure and Activity Patterns of Temporal Networks: A Non-Negative Tensor Factorization Approach

被引:157
作者
Gauvin, Laetitia [1 ]
Panisson, Andre [1 ]
Cattuto, Ciro [1 ]
机构
[1] ISI Fdn, Data Sci Lab, Turin, Italy
关键词
DECOMPOSITIONS;
D O I
10.1371/journal.pone.0086028
中图分类号
O [数理科学和化学]; P [天文学、地球科学]; Q [生物科学]; N [自然科学总论];
学科分类号
07 ; 0710 ; 09 ;
摘要
The increasing availability of temporal network data is calling for more research on extracting and characterizing mesoscopic structures in temporal networks and on relating such structure to specific functions or properties of the system. An outstanding challenge is the extension of the results achieved for static networks to time-varying networks, where the topological structure of the system and the temporal activity patterns of its components are intertwined. Here we investigate the use of a latent factor decomposition technique, non-negative tensor factorization, to extract the community-activity structure of temporal networks. The method is intrinsically temporal and allows to simultaneously identify communities and to track their activity over time. We represent the time-varying adjacency matrix of a temporal network as a three-way tensor and approximate this tensor as a sum of terms that can be interpreted as communities of nodes with an associated activity time series. We summarize known computational techniques for tensor decomposition and discuss some quality metrics that can be used to tune the complexity of the factorized representation. We subsequently apply tensor factorization to a temporal network for which a ground truth is available for both the community structure and the temporal activity patterns. The data we use describe the social interactions of students in a school, the associations between students and school classes, and the spatio-temporal trajectories of students over time. We show that non-negative tensor factorization is capable of recovering the class structure with high accuracy. In particular, the extracted tensor components can be validated either as known school classes, or in terms of correlated activity patterns, i.e., of spatial and temporal coincidences that are determined by the known school activity schedule.
引用
收藏
页数:13
相关论文
共 36 条
[1]   Seeking an appropriate alternative least squares algorithm for nonnegative tensor factorizations [J].
Anh Huy Phan ;
Cichocki, Andrzej .
NEURAL COMPUTING & APPLICATIONS, 2012, 21 (04) :623-637
[2]  
[Anonymous], 2005, P 22 INT C MACH LEAR, DOI DOI 10.1145/1102351.1102451
[3]  
[Anonymous], ARXIV13037226
[4]   Efficient MATLAB computations with sparse and factored tensors [J].
Bader, Brett W. ;
Kolda, Tamara G. .
SIAM JOURNAL ON SCIENTIFIC COMPUTING, 2007, 30 (01) :205-231
[5]   Robust detection of dynamic community structure in networks [J].
Bassett, Danielle S. ;
Porter, Mason A. ;
Wymbs, Nicholas F. ;
Grafton, Scott T. ;
Carlson, Jean M. ;
Mucha, Peter J. .
CHAOS, 2013, 23 (01)
[6]  
Bertsekas DP., 2008, NONLINEAR PROGRAMMIN
[7]   Fast unfolding of communities in large networks [J].
Blondel, Vincent D. ;
Guillaume, Jean-Loup ;
Lambiotte, Renaud ;
Lefebvre, Etienne .
JOURNAL OF STATISTICAL MECHANICS-THEORY AND EXPERIMENT, 2008,
[8]   A new efficient method for determining the number of components in PARAFAC models [J].
Bro, R ;
Kiers, HAL .
JOURNAL OF CHEMOMETRICS, 2003, 17 (05) :274-286
[9]   ANALYSIS OF INDIVIDUAL DIFFERENCES IN MULTIDIMENSIONAL SCALING VIA AN N-WAY GENERALIZATION OF ECKART-YOUNG DECOMPOSITION [J].
CARROLL, JD ;
CHANG, JJ .
PSYCHOMETRIKA, 1970, 35 (03) :283-&
[10]   Dynamics of Person-to-Person Interactions from Distributed RFID Sensor Networks [J].
Cattuto, Ciro ;
Van den Broeck, Wouter ;
Barrat, Alain ;
Colizza, Vittoria ;
Pinton, Jean-Francois ;
Vespignani, Alessandro .
PLOS ONE, 2010, 5 (07)