Abstract
A common analysis performed on dynamic networks is community structure detection, a challenging problem that aims to track the temporal evolution of network modules. An emerging area in this field is evolutionary clustering, where the community structure of a network snapshot is identified by taking into account both its current state as well as previous time points. Based on this concept, we have developed a mixed integer non-linear programming (MINLP) model, SeqMod, that sequentially clusters each snapshot of a dynamic network. The modularity metric is used to determine the quality of community structure of the current snapshot and the historical cost is accounted for by optimising the number of node pairs co-clustered at the previous time point that remain so in the current snapshot partition. Our method is tested on social networks of interactions among high school students, college students and members of the Brazilian Congress. We show that, for an adequate parameter setting, our algorithm detects the classes that these students belong more accurately than partitioning each time step individually or by partitioning the aggregated snapshots. Our method also detects drastic discontinuities in interaction patterns across network snapshots. Finally, we present comparative results with similar community detection methods for time-dependent networks from the literature. Overall, we illustrate the applicability of mathematical programming as a flexible, adaptable and systematic approach for these community detection problems.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
M. Girvan, M.E.J. Newman, Proc. Natl. Acad. Sci. USA 99, 7821 (2002)
R. Guimera, L.A.N. Amaral, Nature 433, 895 (2005)
T.M. Przytycka, M. Singh, D.K. Slonim, Briefings in Bioinformatics 11, 15 (2010)
T. Aynaud, J.L. Guillaume, in Fifth SNA-KDD Workshop Social Network Mining and Analysis in conjunction with the 17th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining – KDD 2011 (2011), Vol. 11
A. Lancichinetti, S. Fortunato, Sci. Rep. 2, 336 (2012)
L. Bennett, A. Kittas, G. Muirhead, L.G. Papageorgiou, S. Tsoka, Sci. Rep. 5, 10345 (2015)
G. Palla, A.L. Barabási, T. Vicsek, Nature 446, 664 (2007)
C. Tantipathananandh, T. Berger-Wolf, D. Kempe, A framework for community identification in dynamic social networks, in Proc. 13th ACM SIGKDD international conference on Knowledge discovery and data mining – KDD ’07 (ACM Press, New York, 2007), pp. 717–726
D.J. Fenn, M.A. Porter, M. McDonald, S. Williams, N.F. Johnson, N.S. Jones, Chaos 19, 1 (2009)
J. Kauffman, A. Kittas, L. Bennett, S. Tsoka, PLoS ONE 9, e101357 (2014)
J. Sun, P.S. Yu, C. Faloutsos, in Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining (2007), pp. 687–696
S. Asur, S. Parthasarathy, D. Ucar, ACM Trans. Knowl. Discov. Data 3, 1 (2009)
D. Chakrabarti, R. Kumar, A. Tomkins, Evolutionary clustering, in Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining – KDD ’06 (ACM Press, New York, 2006), pp. 554–560
Y. Chi, X. Song, D. Zhou, K. Hino, B.L. Tseng, Evolutionary spectral clustering by incorporating temporal smoothness, in Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining – KDD ’07 (ACM Press, New York, 2007), pp. 153–162
M.S. Kim, J. Han, in Proceedings of the VLDB Endowment (2009), Vol. 2, pp. 622–633
Y.R. Lin, Y. Chi, S. Zhu, H. Sundaram, B.L. Tseng, ACM Trans. Knowl. Discov. Data 3, 1 (2009)
N.P. Nguyen, T.N. Dinh, Y. Xuan, M.T. Thai, Adaptive algorithms for detecting community structure in dynamic social networks, in Proceedings IEEE INFOCOM (2011), pp. 2282–2290
R. Görke, P. Maillard, A. Schumm, C. Staudt, D. Wagner, J. Exp. Algorithmics 18, 1 (2011)
V. Kawadia, S. Sreenivasan, Sci. Rep. 2, 794 (2012)
F. Folino, C. Pizzuti, IEEE Trans. Knowl. Data Eng. 26, 1838 (2014)
N.P. Nguyen, T.N. Dinh, Y. Shen, M.T. Thai, PloS ONE 9, e91431 (2014)
G. Xu, S. Tsoka, L.G. Papageorgiou, Eur. Phys. J. B 60, 231 (2007)
G. Agarwal, D. Kempe, Eur. Phys. J. B 66, 409 (2008)
G. Xu, L. Bennett, L.G. Papageorgiou, S. Tsoka, Algorithms Mol. Biol. 5, 1 (2010)
D. Aloise, S. Cafieri, G. Caporossi, P. Hansen, S. Perron, L. Liberti, Phys. Rev. E 82, 046112 (2010)
S. Cafieri, P. Hansen, L. Liberti, Phys. Rev. E 83, 056105 (2011)
L. Bennett, S. Liu, L.G. Papageorgiou, S. Tsoka, Adv. Complex Syst. 15, 1150023 (2012)
D. Aloise, G. Caporossi, P. Hansen, L. Liberti, S. Perron, M. Ruiz, Modularity maximization in networks by variable neighborhood search, in Proceedings of the 10th DIMACS implementation challenge workshop (American Mathematical Society (AMS), Atlanta, 2013), pp. 113–127
L. Bennett, A. Kittas, S. Liu, L.G. Papageorgiou, S. Tsoka, PLoS ONE 9, e112821 (2014)
M.E.J. Newman, M. Girvan, Phys. Rev. E 69, 026113 (2004)
U. Brandes, D. Delling, M. Gaertler, R. Gorke, M. Hoefer, Z. Nikoloski, D. Wagner, IEEE Trans. Knowl. Data Eng. 20, 172 (2008)
R.E. Rosenthal, GAMS A User’s Guide (2014), www.gams.com/mccarl/mccarlhtml/
D.S. Bassett, M.A. Porter, N.F. Wymbs, S.T. Grafton, J.M. Carlson, P.J. Mucha, Chaos 23, 013142 (2013)
J. Fournet, A. Barrat, PloS ONE 9, e107878 (2014)
W. Dong, B. Lepri, A. Pentland, Modeling the co-evolution of behaviors and social relationships using mobile phone data, in Proceedings of the 10th International Conference on Mobile and Ubiquitous Multimedia – MUM ’11 (ACM Press, New York, 2011), pp. 134–143
V. Baptista, F. Brito, J. Brasileiro, A.N. Duarte, E.P. Bezerra, F. Almeida, P. Lima, S. Guimaraes, Uma ferramenta para analisar mudanças na coesão entre parlamentares em votações nominais, in III Brazilian Workshop on Social Network Analysis and Mining (2014), pp. 1–7
P.J. Mucha, T. Richardson, K. Macon, M.A. Porter, J.P. Onnela, Science 328, 876 (2010)
L. Hubert, P. Arabie, J. Classification 2, 193 (1985)
M. Meil, J. Multivariate Anal. 98, 873 (2007)
C. Fraley, A.E. Raftery, T.B. Murphy, L. Scrucca, mclust Version 4 for R: Normal Mixture Modeling for Model-Based Clustering, Classification, and Density Estimation, Technical Report No. 597 (2012)
V.D. Blondel, J.L. Guillaume, R. Lambiotte, E. Lefebvre, J. Stat. Mech.: Theor. Exp. 2008, P10008 (2008)
K.S. Xu, M. Kliger, A.O. Hero, Evolutionary spectral clustering with adaptive forgetting factor, in 2010 IEEE International Conference on Acoustics, Speech and Signal Processing (IEEE, 2010), pp. 2174–2177
The Guardian, Petrobras scandal: Brazilian oil executives among 35 charged, http://goo.gl/fqUaqY, accessed: 2015-10-06
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Open Access This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (https://creativecommons.org/licenses/by/4.0), which permits use, duplication, adaptation, distribution, and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.
About this article
Cite this article
Silva, J., Bennett, L., Papageorgiou, L. et al. A mathematical programming approach for sequential clustering of dynamic networks. Eur. Phys. J. B 89, 39 (2016). https://doi.org/10.1140/epjb/e2015-60656-5
Received:
Revised:
Published:
DOI: https://doi.org/10.1140/epjb/e2015-60656-5