Abstract
The problem of community detection has a long tradition in the area of data mining research and has many challenging aspects, particularly with regard to community detection in a time-varying context. Temporal smoothness is an important concept in this domain treated specifically by Evolutionary clustering. However, this approach is mostly designed for networks with low changes during different time steps. In this research, we present a new dynamic community detection algorithm in a representative-based category called ARTISON, which is inspired by the Adaptive Resonance Theory technique- a famous adaptive clustering model in neural networks. The proposed model is able to capture both low and high changes in the networks in binary. Further, our approach recognizes the number of communities automatically in both weighted and binary networks. Detailed experiments utilizing the MATLAB platform have yielded encouraging results for different measures and further motivate the application of such bio-inspired models in a dynamic social networking context.
Similar content being viewed by others
References
Fortunato S (2010) Community detection in graphs. Phys Rep 486(3):75–174
Karsai M, Perra N, Vespignani A (2014) Time varying networks and the weakness of strong ties. Scientific reports:4
Nguyen NP, Dinh TN, Shen Y, Thai MT (2014) Dynamic social community detection and its applications. PloS one 9(4):e91431
Takaffoli M, Sangi F, Fagnan J (2011) Zaiane OR MODEC—Modeling and detecting evolutions of communities. In: Fifth international AAAI conference on weblogs and social media
Chakrabarti D, Kumar R, Tomkins A (2006) Evolutionary clustering. In: Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining. ACM, pp 554–560
Conti M, Mordacchini M, Passarella A (2013) Design and performance evaluation of data dissemination systems for opportunistic networks based on cognitive heuristics. ACM Trans Autom Adaptive Systems (TAAS) 8 (3):12
Plantié M, Crampes M (2013) Survey on social community detection. In: Social media retrieval. Springer, pp 65–85
Palla G, Barabási A-L, Vicsek T (2007) Quantifying social group evolution. Nature 446(7136):664–667
Sun J, Faloutsos C, Papadimitriou S, Yu PS (2007) Graphscope: parameter-free mining of large time-evolving graphs. In: Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining. ACM, pp 687–696
Asur S, Parthasarathy S, Ucar D (2007) An event-based framework for characterizing the evolutionary behavior of interaction graphs. In: Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining. ACM, pp 913–921
Xu KS, Kliger M, Hero Iii AO (2014) Adaptive evolutionary clustering. Data Min Knowl Discov 28(2):304–336
Görke R, Maillard P, Schumm A, Staudt C, Wagner D (2013) Dynamic graph clustering combining modularity and smoothness. J Exp Algorithmics (JEA) 18(1):1.5
Chi Y, Song X, Zhou D, Hino K, Tseng BL (2009) On evolutionary spectral clustering. ACM Transactions on Knowledge Discovery from Data (TKDD) 3(4):17
Lin Y-R, Chi Y, Zhu S, Sundaram H, Tseng BL (2009) Analyzing communities and their evolutions in dynamic social networks. ACM Trans Knowl Discov from Data (TKDD) 3(2):8
Wu X, Kumar V, Quinlan JR, Ghosh J, Yang Q, Motoda H, McLachlan GJ, Ng A, Liu B, Philip SY (2008) Top 10 algorithms in data mining. Knowl Inf Syst 14(1):1–37
Wu X, Kumar V (2009) The top ten algorithms in data mining. CRC Press
Jain AK (2010) Data clustering: 50 years beyond K-means. Pattern Recogn Lett 31(8):651–666
Newman ME (2006) Finding community structure in networks using the eigenvectors of matrices. Phys Rev E 74(3):036104
Blondel VD, Guillaume J-L, Lambiotte R, Lefebvre E (2008) Fast unfolding of communities in large networks. J Stat Mech Theory Experiment 2008(10):P10008
Lancichinetti A, Fortunato S (2011) Limits of modularity maximization in community detection. Phys Rev E 84(6):066122
Steinhaeuser K, Chawla NV (2010) Identifying and evaluating community structure in complex networks. Pattern Recogn Lett 31(5):413–421
Von Luxburg U (2007) A tutorial on spectral clustering. Stat Comput 17(4):395–416
Xie J, Szymanski BK (2013) Labelrank: a stabilized label propagation algorithm for community detection in networks. In: Network science workshop (NSW), 2013 IEEE 2nd. IEEE, pp 138–143
Xie J, Chen M, Szymanski BK (2013) LabelrankT: incremental community detection in dynamic networks via label propagation. arXiv:13052006
Rosvall M, Bergstrom CT (2008) Maps of random walks on complex networks reveal community structure. Proc Natl Acad Sci 105(4):1118–1123
De Domenico M, Lancichinetti A, Arenas A, Rosvall M (2015) Identifying modular flows on multilayer networks reveals highly overlapping organization in interconnected systems. Phys Rev X 5(1):011027
Yang T, Chi Y, Zhu S, Gong Y, Jin R (2011) Detecting communities and their evolutions in dynamic social networks—a Bayesian approach. Mach Learn 82(2):157–189
Aynaud T, Fleury E, Guillaume J-L, Wang Q (2013) Communities in evolving networks: Definitions, detection, and analysis techniques. In: Dynamics on and of complex networks, vol 2. Springer, pp 159–200
Papadopoulos S, Kompatsiaris Y, Vakali A, Spyridonos P (2012) Community detection in social media. Data Min Knowl Disc 24(3):515–554
Grossberg S (2013) Adaptive resonance theory: how a brain learns to consciously attend, learn, and recognize a changing world. Neural Netw 37:1–47
de Araújo GRF, Ralha CG (2012) Using ART1 Neural Networks for Clustering Computer Forensics Documents. The International Journal of FORENSIC COMPUTER SCIENCE (IJoFCS) 1:24–41
Skovajsová L, Rojček M (2011) Soft clustering algorithms based on neural networks. In: 2011 IEEE 12th international symposium on computational intelligence and informatics (CINTI). IEEE, pp 439–442
Li Z, Wang R-S, Chen L (2009) Extracting community structure of complex networks by self-organizing maps. In: Proceedings of the third international symposium on optimization and systems biology (OSB’09). Citeseer, Zhangjiajie, pp 48–56
Okamoto H (2015) Local detection of communities by attractor neural-network dynamics. In: Artificial neural networks. Springer, pp 115–125
Orman GK, Labatut V, Cherifi H (2011) On accuracy of community structure discovery algorithms. J Converg Inf Technol 6(11):283–292
Leberknight C, Inaltekin H, Chiang M, Poor H (2012) The evolution of online social networks: a tutorial survey. IEEE Signal Proc Mag 2(29):41–52
Edelman R (2010) Edelman trust barometer 2010
Greene D, Doyle D, Cunningham P (2010) Tracking the evolution of communities in dynamic social networks. In: 2010 international conference on advances in social networks analysis and mining (ASONAM). IEEE, pp 176–183
Eagle N, Pentland AS, Lazer D (2009) Inferring friendship network structure by using mobile phone data. Proc Natl Acad Sci 106(36):15274–15278
Lin Y-R, Chi Y, Zhu S, Sundaram H, Tseng BL (2008) Facetnet: a framework for analyzing communities and their evolutions in dynamic networks. In: Proceedings of the 17th international conference on World Wide Web. ACM, pp 685–694
Kaufman L, Rousseeuw PJ (2009) Finding groups in data: an introduction to cluster analysis, vol 344. Wiley
Rand WM (1971) Objective criteria for the evaluation of clustering methods. J Am Stat Assoc 66(336):846–850
Yao Y (2003) Information-theoretic measures for knowledge discovery and data mining. In: Entropy measures, maximum entropy principle and emerging applications. Springer, pp 115–136
Lancichinetti A, Fortunato S (2009) Benchmarks for testing community detection algorithms on directed and weighted graphs with overlapping communities. Phys Rev E 80(1):016118
More J, Lingam C (2013) Current trends in reality mining. IRJES
Rousseeuw PJ (1987) Silhouettes: a graphical aid to the interpretation and validation of cluster analysis. J Comput Appl Math 20:53–65
Takaffoli M, Fagnan J, Sangi F, Zaïane OR (2011) Tracking changes in dynamic information networks. In: International conference on computational aspects of social networks (CASoN), vol 2011. IEEE, pp 94–101
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Cheraghchi, H.S., Zakerolhosseini, A. Toward a novel art inspired incremental community mining algorithm in dynamic social network. Appl Intell 46, 409–426 (2017). https://doi.org/10.1007/s10489-016-0838-3
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10489-016-0838-3