The DOI matches its Crossref record; 44 of the 44 references it cites were found in a registry or an index.
An Evolutionary Multiobjective Approach for Community Discovery in Dynamic Networks
Abstract
The discovery of evolving communities in dynamic networks is an important research topic that poses challenging tasks. Evolutionary clustering is a recent framework for clustering dynamic networks that introduces the concept of temporal smoothness inside the community structure detection method. Evolutionary-based clustering approaches try to maximize cluster accuracy with respect to incoming data of the current time step, and minimize clustering drift from one time step to the successive one. In order to optimize both these two competing objectives, an input parameter that controls the preference degree of a user towards either the snapshot quality or the temporal quality is needed. In this paper the detection of communities with temporal smoothness is formulated as a multiobjective problem and a method based on genetic algorithms is proposed. The main advantage of the algorithm is that it automatically provides a solution representing the best trade-off between the accuracy of the clustering obtained, and the deviation from one time step to the successive. Experiments on synthetic data sets show the very good performance of the method when compared with state-of-the-art approaches.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
A fast and elitist multiobjective genetic algorithm: NSGA-II
Deb, K., Pratap, A., Agarwal, S., & Meyarivan, T. (2002) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.996017 · Cited by 50,053
Genetic algorithms in search, optimization, and machine learning
(1989) · Choice Reviews Online · doi:10.5860/choice.27-0936 · Cited by 49,010
Holland, J. H. (1992) · The MIT Press eBooks · doi:10.7551/mitpress/1090.001.0001 · Cited by 47,002
Genetic Algorithms in Search, Optimization and Machine Learning
Goldberg, D. E., & Robson, D. (1988) · Cited by 18,391
Goldberg, D. E., & Shakespeare, W. (2002) · Cited by 16,088
Community structure in social and biological networks
Girvan, M., & Newman, M. E. J. (2002) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.122653799 · Cited by 15,502
Normalized cuts and image segmentation
Shi, J., & Malik, J. (2000) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.868688 · Cited by 15,502
Multi-Objective Optimization Using Evolutionary Algorithms
Deb, K., & Kalyanmoy, D. (2001) · Andalas University Repository (Andalas University) · Cited by 14,918
Finding and evaluating community structure in networks
Newman, M. E. J., & Girvan, M. (2004) · Physical Review E · doi:10.1103/physreve.69.026113 · Cited by 13,931
Muiltiobjective Optimization Using Nondominated Sorting in Genetic Algorithms
Srinivas, N., & Deb, K. (1994) · Evolutionary Computation · doi:10.1162/evco.1994.2.3.221 · Cited by 6,935
Evolutionary Algorithms for Solving Multi-Objective Problems
(2007) · Genetic and Evolutionary Computation Series · doi:10.1007/978-0-387-36797-2 · Cited by 5,686
Benchmark graphs for testing community detection algorithms
Lancichinetti, A., Fortunato, S., & Radicchi, F. (2008) · Physical Review E · doi:10.1103/physreve.78.046110 · Cited by 3,051
Resolution limit in community detection
Fortunato, S., & Barthélemy, M. (2007) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0605965104 · Cited by 3,024
Comparing community structure identification
Danon, L., Díaz-Guilera, A., Duch, J., & Arenas, A. (2005) · Journal of Statistical Mechanics: Theory and Experiment · doi:10.1088/1742-5468/2005/09/p09008 · Cited by 2,872
Holme, P., & Saramäki, J. (2012) · Physics Reports · doi:10.1016/j.physrep.2012.03.001 · Cited by 2,736 · cited 1×
“The MultiObjective Genetic Algorithm (MOGA) we used is the Nondominated Sorting Genetic Algorithm (NSGA-II) proposed by Srinivas and Deb in [31] and implemented in the Genetic Algorithm and Direct Search Toolbox of MATLAB.”
Method(2005) · Springer eBooks · doi:10.1007/3-540-27659-9 · Cited by 2,370
Graphs over time: densification laws, shrinking diameters and possible explanations
Leskovec, J., Kleinberg, J., & Faloutsos, C. (2005) · Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining · doi:10.1145/1081870.1081893 · Cited by 2,281
Community detection algorithms: A comparative analysis
Lancichinetti, A., & Fortunato, S. (2009) · Physical Review E · doi:10.1103/physreve.80.056117 · Cited by 2,177
(2017) · Encyclopedia of Machine Learning and Data Mining · doi:10.1007/978-1-4899-7687-1_100317 · Cited by 2,127
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
Introduction to Algorithms, Second Edition
Rivest, R. L., Leiserson, C. E., Cormen, T. H., & Stein, C. (2001) · Cited by 1,984
Quantifying social group evolution
Palla, G., Barabási, A.-L., & Vicsek, T. (2007) · Nature · doi:10.1038/nature05670 · Cited by 1,668
Structure and evolution of online social networks
Kumar, R., Novak, J., & Tomkins, A. (2006) · Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1150402.1150476 · Cited by 1,084
Empirical comparison of algorithms for network community detection
Leskovec, J., Lang, K. J., & Mahoney, M. (2010) · Proceedings of the 19th international conference on World wide web · doi:10.1145/1772690.1772755 · Cited by 918
Radhakrishnan, S., Kolippakkam, D., & Mathura, V. S. (2008) · Bioinformatics: A Concept-Based Introduction · doi:10.1007/978-0-387-84870-9_3 · Cited by 842
On clusterings: Good, bad and spectral
Kannan, R., Vempala, S., & Vetta, A. (2004) · Journal of the ACM · doi:10.1145/990308.990313 · Cited by 834
An Evolutionary Approach to Multiobjective Clustering
Handl, J., & Knowles, J. (2007) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2006.877146 · Cited by 717
Chakrabarti, D., Kumar, R., & Tomkins, A. (2006) · Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1150402.1150467 · Cited by 661
Tracking 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
GraphScope: parameter-free mining of large time-evolving graphs
Sun, J., Faloutsos, C., Papadimitriou, S., & Yu, P. S. (2007) · Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1281192.1281266 · Cited by 532
Reducing the Run-Time Complexity of Multiobjective EAs: The NSGA-II and Other Algorithms
Jensen, M. T. (2003) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2003.817234 · Cited by 458
A framework for community identification in dynamic social networks
Tantipathananandh, C., Berger-Wolf, T., & Kempe, D. (2007) · Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1281192.1281269 · Cited by 443
A Multiobjective Genetic Algorithm to Find Communities in Complex Networks
Pizzuti, C. (2012) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2011.2161090 · Cited by 346
Self-citationThe Enron Email Dataset Database Schema and Brief Statistical Report
Shetty, J., & Adibi, J. (2004) · Cited by 315
Analyzing communities and their evolutions in dynamic social networks
Lin, Y.-R., Chi, Y., Zhu, S., Sundaram, H., & Tseng, B. L. (2009) · ACM Transactions on Knowledge Discovery from Data · doi:10.1145/1514888.1514891 · Cited by 296
An event-based framework for characterizing the evolutionary behavior of interaction graphs
Asur, S., Parthasarathy, S., & Ucar, D. (2009) · ACM Transactions on Knowledge Discovery from Data · doi:10.1145/1631162.1631164 · Cited by 291
Community evolution in dynamic multi-mode networks
Tang, L., Liu, H., Zhang, J., & Nazeri, Z. (2008) · Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1401890.1401972 · Cited by 245
A particle-and-density based evolutionary clustering method for dynamic networks
Kim, M.-S., & Han, J. (2009) · Proceedings of the VLDB Endowment · doi:10.14778/1687627.1687698 · Cited by 243
On evolutionary spectral clustering
Chi, Y., Song, X., Zhou, D., Hino, K., & Tseng, B. L. (2009) · ACM Transactions on Knowledge Discovery from Data · doi:10.1145/1631162.1631165 · Cited by 147
Identifying Evolving Groups in Dynamic Multimode Networks
Tang, L., Liu, H., & Zhang, J. (2011) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2011.159 · Cited by 98
Parameter Tuning of Evolutionary Algorithms: Generalist vs. Specialist
Smit, S. K., & Eiben, A. E. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-12239-2_56 · Cited by 90
Evolutionary Clustering by Hierarchical Dirichlet Process with Hidden Markov State
Xu, T., Zhang, Z. M., Yu, P. S., & Long, B. (2008) · Proceedings · doi:10.1109/icdm.2008.24 · Cited by 59
A Multiobjective and Evolutionary Clustering Method for Dynamic Networks
Folino, F., & Pizzuti, C. (2010) · IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM) · doi:10.1109/asonam.2010.23 · Cited by 56
Self-citationDynamic Community Identification
Berger-Wolf, T. Y., Tantipathananandh, C., & Kempe, D. (2010) · Springer eBooks · doi:10.1007/978-1-4419-6515-8_12 · Cited by 15
Cited by
Modern temporal network theory: a colloquium
Holme, P. (2015) · The European Physical Journal B · doi:10.1140/epjb/e2015-60657-4 · Cited by 734
Community Discovery in Dynamic Networks: A Survey
Rossetti, G., & Cazabet, R. (2019) · ACM Computing Surveys · doi:10.1145/3172867 · Cited by 468
Community detection in social networks
Bedi, P., & Sharma, C. (2016) · WIREs Data Mining and Knowledge Discovery · doi:10.1002/widm.1178 · Cited by 346
Metadata
- Authors
- Folino, F., & Pizzuti, C.
- Venue
- IEEE Transactions on Knowledge and Data Engineering
- Published
- 2014-08
- Volume
- 26
- Issue
- 8
- Pages
- 1838-1852
- ISSN
- 1041-4347 (ISSN-L)
- OpenAlex
- W2022651954
- Cited by
- 265
- References
- 44
- FWCI
- 10.52
- Type
- journal article
- Language
- en
- Open access
- closed
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.