aalto1 untyped-item.component.html
Recovering Static and Time-Varying Communities Using Persistent Edges
Loading...
Access rights
openAccess
publishedVersion
URL
Journal Title
Journal ISSN
Volume Title
A1 Alkuperäisartikkeli tieteellisessä aikakauslehdessä
This publication is imported from Aalto University research portal.
View publication in the Research portal (opens in new window)
View/Open full text file from the Research portal (opens in new window)
View publication in the Research portal (opens in new window)
View/Open full text file from the Research portal (opens in new window)
Unless otherwise stated, all rights belong to the author. You may download, display and print this publication for Your own personal use. Commercial use is prohibited.
Date
Major/Subject
Mcode
Degree programme
Language
en
Pages
13
Series
IEEE Transactions on Network Science and Engineering, Volume 11, issue 2, pp. 2087-2099
Abstract
This article focuses on spectral methods for recovering communities in temporal networks. In the case of fixed communities, spectral clustering on the simple time-aggregated graph (i.e., the weighted graph formed by the sum of the interactions over all temporal snapshots) does not always produce satisfying results. To utilise information carried by temporal correlations, we propose to employ different weights on freshly appearing and persistent edges. We show that spectral clustering on such weighted graphs can be explained as a relaxation of the maximum likelihood estimator of an extension of the degree-corrected stochastic block model with Markov interactions. We also study the setting of evolving communities, for which we use the prediction at time t-1 as an oracle for inferring the community labels at time t. We demonstrate the accuracy of the proposed methods on synthetic and real data sets.
Description
Publisher Copyright: © 2013 IEEE.
Other note
Citation
Avrachenkov, K, Dreveton, M & Leskela, L 2024, 'Recovering Static and Time-Varying Communities Using Persistent Edges', IEEE Transactions on Network Science and Engineering, vol. 11, no. 2, pp. 2087-2099. https://doi.org/10.1109/TNSE.2023.3337281