The DOI matches its Crossref record; 36 of the 36 references it cites were found in a registry or an index.
Detecting the Community Structure and Activity Patterns of Temporal Networks: A Non-Negative Tensor Factorization Approach
Open accessAbstract
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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Fast unfolding of communities in large networks
Blondel, V. D., Guillaume, J.-L., Lambiotte, R., & Lefebvre, E. (2008) · Journal of Statistical Mechanics: Theory and Experiment · doi:10.1088/1742-5468/2008/10/p10008 · Cited by 21,424
Learning the parts of objects by non-negative matrix factorization
Lee, D. D., & Seung, H. S. (1999) · Nature · doi:10.1038/44565 · Cited by 13,868
Bertsekas, D. P. (1997) · Journal of the Operational Research Society · doi:10.1038/sj.jors.2600425 · Cited by 11,726
Fortunato, S. (2010) · Physics Reports · doi:10.1016/j.physrep.2009.11.002 · Cited by 11,293
Tensor Decompositions and Applications
Kolda, T. G., & Bader, B. W. (2009) · SIAM Review · doi:10.1137/07070111x · Cited by 10,301
ALGORITHMS FOR NON-NEGATIVE MATRIX FACTORIZATION
Lee, D. D., & Seung, H. S. (2000) · neural information processing systems · Cited by 9,878
Paatero, P., & Tapper, U. (1994) · Environmetrics · doi:10.1002/env.3170050203 · Cited by 6,023
ALGORITHMS FOR NON-NEGATIVE MATRIX FACTORIZATION
Seung, D., & Lee, L.-W. (2001) · Cited by 4,753
Carroll, J. D., & Chang, J.-J. (1970) · Psychometrika · doi:10.1007/bf02310791 · Cited by 4,678
Maps of random walks on complex networks reveal community structure
Rosvall, M., & Bergstrom, C. T. (2008) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0706851105 · Cited by 4,583
Holme, P., & Saramäki, J. (2012) · Physics Reports · doi:10.1016/j.physrep.2012.03.001 · Cited by 2,736 · cited 1×
“availability of time-resolved network data sources, e.g., from socio-technical systems and on-line social networks, has brought to the forefront the need to study and understand time-varying networks [2]. Although it is always possible to create static network representations by aggregating over the temporal evolution…”
BackgroundWeik, M. H. (2000) · Computer Science and Communications Dictionary · doi:10.1007/1-4020-0613-6_12436 · Cited by 2,570
Harshman, R. A. (1970) · Cited by 2,255
Community Structure in Time-Dependent, Multiscale, and Multiplex Networks
Mucha, P. J., Richardson, T., Macon, K., Porter, M. A., & Onnela, J.-P. (2010) · Science · doi:10.1126/science.1184819 · Cited by 2,123
Computing Communities in Large Networks Using Random Walks
Pons, P., & Latapy, M. (2005) · Lecture Notes in Computer Science · doi:10.1007/11569596_31 · Cited by 2,048
A Three-Way Model for Collective Learning on Multi-Relational Data
Nickel, M., Volker Tresp, C., & Kriegel, H. (2011) · Cited by 1,806
Cichocki, A., Zdunek, R., Phan, A. H., & Amari, S. (2009) · doi:10.1002/9780470747278 · Cited by 1,540
A new efficient method for determining the number of components in PARAFAC models
Bro, R., & Kiers, H. A. L. (2003) · Journal of Chemometrics · doi:10.1002/cem.801 · Cited by 1,257
Finding Statistically Significant Communities in Networks
Lancichinetti, A., Radicchi, F., Ramasco, J. J., & Fortunato, S. (2011) · PLoS ONE · doi:10.1371/journal.pone.0018961 · Cited by 1,187
Mathematical formulation of multilayer networks
De Domenico, M., Solé-Ribalta, A., Cozzo, E., Kivelä, M., Moreno, Y., Porter, M. A., Gómez, S., & Arenas, A. (2016) · LA Referencia (Red Federada de Repositorios Institucionales de Publicaciones Científicas) · Cited by 939
Mathematical Formulation of Multilayer Networks
De Domenico, M., Solé-Ribalta, A., Cozzo, E., Kivelä, M., Moreno, Y., Porter, M. A., Gómez, S., & Arenas, A. (2013) · Physical Review X · doi:10.1103/physrevx.3.041022 · Cited by 930
Overlapping community detection at scale: a nonnegative matrix factorization approach
Yang, J., & Leskovec, J. (2013) · Proceedings of the sixth ACM international conference on Web search and data mining · doi:10.1145/2433396.2433471 · Cited by 852
High-Resolution Measurements of Face-to-Face Contact Patterns in a Primary School
Stehlé, J., Voirin, N., Barrat, A., Cattuto, C., Isella, L., Pinton, J.-F., Quaggiotto, M., Van den Broeck, W., Régis, C., Lina, B., et al. (2011) · PLoS ONE · doi:10.1371/journal.pone.0023176 · Cited by 831
Self-citationDynamics of Person-to-Person Interactions from Distributed RFID Sensor Networks
Cattuto, C., Van den Broeck, W., Barrat, A., Colizza, V., Pinton, J.-F., & Vespignani, A. (2010) · PLoS ONE · doi:10.1371/journal.pone.0011596 · Cited by 821
Self-citationTracking the Evolution of Communities in Dynamic Social Networks
Greene, D., Doyle, D., & Cunningham, P. (2010) · 2010 International Conference on Advances in Social Networks Analysis and Mining · doi:10.1109/asonam.2010.17 · Cited by 537
Non-negative tensor factorization with applications to statistics and computer vision
Shashua, A., & Hazan, T. (2005) · Proceedings of the 22nd international conference on Machine learning - ICML '05 · doi:10.1145/1102351.1102451 · Cited by 490
Beyond streams and graphs: dynamic tensor analysis
Sun, J., Tao, D., & Faloutsos, C. (2006) · Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1150402.1150445 · Cited by 462
Community discovery using nonnegative matrix factorization
Wang, F., Li, T., Wang, X., Zhu, S., & Ding, C. (2011) · Data Mining and Knowledge Discovery · doi:10.1007/s10618-010-0181-y · Cited by 446
Robust detection of dynamic community structure in networks
Bassett, D. S., Porter, M. A., Wymbs, N. F., Grafton, S. T., Carlson, J. M., & Mucha, P. J. (2013) · Chaos: An Interdisciplinary Journal of Nonlinear Science · doi:10.1063/1.4790830 · Cited by 425
Robust detection of dynamic community structure in networks
Bassett, D. S., Porter, M. A., Wymbs, N. F., Grafton, S. T., Carlson, J. M., & Mucha, P. J. (2013) · Oxford University Research Archive (ORA) (University of Oxford) · Cited by 411
Tracking evolving communities in large linked networks
Hopcroft, J., Khan, O., Kulis, B., & Selman, B. (2004) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0307750100 · Cited by 299
Applications of tensor (multiway array) factorizations and decompositions in data mining
Mørup, M. (2011) · WIREs Data Mining and Knowledge Discovery · doi:10.1002/widm.1 · Cited by 244
Fast Nonnegative Tensor Factorization with an Active-Set-Like Method
Kim, J., & Park, H. (2012) · Springer eBooks · doi:10.1007/978-1-4471-2437-5_16 · Cited by 68
Detection of hidden structures for arbitrary scales in complex physical systems
Ronhovde, P., Chakrabarty, S., Hu, D., Sahu, M., Sahu, K. K., Kelton, K. F., Mauro, N. A., & Nussinov, Z. (2012) · Scientific Reports · doi:10.1038/srep00329 · Cited by 62
A non-negative tensor factorization model for selectional preference induction
de Cruys, T. V. (2010) · Natural Language Engineering · doi:10.1017/s1351324910000148 · Cited by 48
Detecting Overlapping Temporal Community Structure in Time-Evolving NetworksPreprint
Chen, Y., Kawadia, V., & Urgaonkar, R. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1303.7226 · Cited by 30
Cited by
Kivela, M., Arenas, A., Barthelemy, M., Gleeson, J. P., Moreno, Y., & Porter, M. A. (2014) · Journal of Complex Networks · doi:10.1093/comnet/cnu016 · Cited by 3,235
Modern temporal network theory: a colloquium
Holme, P. (2015) · The European Physical Journal B · doi:10.1140/epjb/e2015-60657-4 · Cited by 734
The physics of spreading processes in multilayer networks
De Domenico, M., Granell, C., Porter, M. A., & Arenas, A. (2016) · Nature Physics · doi:10.1038/nphys3865 · Cited by 649
Betzel, R. F., & Bassett, D. S. (2017) · NeuroImage · doi:10.1016/j.neuroimage.2016.11.006 · Cited by 587
Community Discovery in Dynamic Networks: A Survey
Rossetti, G., & Cazabet, R. (2019) · ACM Computing Surveys · doi:10.1145/3172867 · Cited by 468
Metadata
- Authors
- Gauvin, L., Panisson, A., & Cattuto, C.
- Venue
- PLoS ONE
- Publisher
- Public Library of Science (PLoS)
- Published
- 2014-01-31
- Volume
- 9
- Issue
- 1
- Pages
- e86028
- ISSN
- 1932-6203 (ISSN-L)
- OpenAlex
- W2005941514
- Cited by
- 272
- References
- 36
- FWCI
- 15.16
- Type
- journal article
- Language
- en
- Open access
- gold
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.