The DOI matches its Crossref record; 60 of the 60 references it cites were found in a registry or an index.
Complex Network Clustering by Multiobjective Discrete Particle Swarm Optimization Based on Decomposition
Abstract
The field of complex network clustering has been very active in the past several years. In this paper, a discrete framework of the particle swarm optimization algorithm is proposed. Based on the proposed discrete framework, a multiobjective discrete particle swarm optimization algorithm is proposed to solve the network clustering problem. The decomposition mechanism is adopted. A problem-specific population initialization method based on label propagation and a turbulence operator are introduced. In the proposed method, two evaluation objectives termed as kernel k-means and ratio cut are to be minimized. However, the two objectives can only be used to handle unsigned networks. In order to deal with signed networks, they have been extended to the signed version. The clustering performances of the proposed algorithm have been validated on signed networks and unsigned networks. Extensive experimental studies compared with ten state-of-the-art approaches prove that the proposed algorithm is effective and promising.
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
Kennedy, J., & Eberhart, R. (2002) · Proceedings of ICNN'95 - International Conference on Neural Networks · doi:10.1109/icnn.1995.488968 · Cited by 58,192
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
Collective dynamics of ‘small-world’ networks
Watts, D. J., & Strogatz, S. H. (1998) · Nature · doi:10.1038/30918 · Cited by 43,060
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
Fortunato, S. (2010) · Physics Reports · doi:10.1016/j.physrep.2009.11.002 · Cited by 11,293
MOEA/D: A Multiobjective Evolutionary Algorithm Based on Decomposition
Zhang, Q., & Li, H. (2007) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2007.892759 · Cited by 10,069
The particle swarm - explosion, stability, and convergence in a multidimensional complex space
Clerc, M., & Kennedy, J. (2002) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.985692 · Cited by 9,017
Finding community structure in very large networks
Clauset, A., Newman, M. E. J., & Moore, C. (2004) · Physical Review E · doi:10.1103/physreve.70.066111 · Cited by 7,390
Fast algorithm for detecting community structure in networks
Newman, M. E. J. (2004) · Physical Review E · doi:10.1103/physreve.69.066133 · Cited by 5,406
SPEA2: Improving the strength pareto evolutionary algorithm
Zitzler, E., Laumanns, M., & Thiele, L. (2001) · doi:10.3929/ethz-a-004284029 · Cited by 5,008
A discrete binary version of the particle swarm algorithm
Kennedy, J., & Eberhart, R. C. (2002) · 1997 IEEE International Conference on Systems, Man, and Cybernetics. Computational Cybernetics and Simulation · doi:10.1109/icsmc.1997.637339 · Cited by 4,767
Finding community structure in networks using the eigenvectors of matrices
Newman, M. E. J. (2006) · Physical Review E · doi:10.1103/physreve.74.036104 · Cited by 4,761
An Information Flow Model for Conflict and Fission in Small Groups
Zachary, W. W. (1977) · Journal of Anthropological Research · doi:10.1086/jar.33.4.3629752 · Cited by 4,704
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
The structure of scientific collaboration networks
Newman, M. E. J. (2001) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.98.2.404 · Cited by 4,482
Handling multiple objectives with particle swarm optimization
Coello, C. A. C., Pulido, G. T., & Lechuga, M. S. (2004) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2004.826067 · Cited by 4,455
Diameter of the World-Wide Web
Albert, R., Jeong, H., & Barabási, A.-L. (1999) · Nature · doi:10.1038/43601 · Cited by 4,260
Comprehensive learning particle swarm optimizer for global optimization of multimodal functions
Liang, J. J., Qin, A. K., Suganthan, P. N., & Baskar, S. (2006) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2005.857610 · Cited by 3,743
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
Broder, A., Kumar, R., Maghoul, F., Raghavan, P., Rajagopalan, S., Stata, R., Tomkins, A., & Wiener, J. (2000) · Computer Networks · doi:10.1016/s1389-1286(00)00083-9 · Cited by 2,810
Defining and identifying communities in networks
Radicchi, F., Castellano, C., Cecconi, F., Loreto, V., & Parisi, D. (2004) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0400054101 · Cited by 2,450
MOPSO: a proposal for multiple objective particle swarm optimization
Coello Coello, C. A., & Lechuga, M. S. (2002) · Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600) · doi:10.1109/cec.2002.1004388 · Cited by 2,437
Approximating the Nondominated Front Using the Pareto Archived Evolution Strategy
Knowles, J. D., & Corne, D. W. (2000) · Evolutionary Computation · doi:10.1162/106365600568167 · Cited by 2,286
Lusseau, D., Schneider, K., Boisseau, O. J., Haase, P., Slooten, E., & Dawson, S. M. (2003) · Behavioral Ecology and Sociobiology · doi:10.1007/s00265-003-0651-y · Cited by 2,277
A Cooperative Approach to Particle Swarm Optimization
vandenBergh, F., & Engelbrecht, A. P. (2004) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2004.826069 · Cited by 2,120
Statistical mechanics of community detection
Reichardt, J., & Bornholdt, S. (2006) · Physical Review E · doi:10.1103/physreve.74.016110 · Cited by 2,048
Detecting the overlapping and hierarchical community structure in complex networks
Lancichinetti, A., Fortunato, S., & Kertész, J. (2009) · New Journal of Physics · doi:10.1088/1367-2630/11/3/033015 · Cited by 1,941
A Simulated Annealing-Based Multiobjective Optimization Algorithm: AMOSA
Bandyopadhyay, S., Saha, S., Maulik, U., & Deb, K. (2008) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2007.900837 · Cited by 852
From the Cover: The structure of scientific collaboration networks
Newman, M. E. J. (2001) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.021544898 · Cited by 837
Cooperatively Coevolving Particle Swarms for Large Scale Optimization
Li, X., & Yao, X. (2012) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2011.2112662 · Cited by 745
Particle swarm optimization method in multiobjective problems
Parsopoulos, K. E., & Vrahatis, M. N. (2002) · Proceedings of the 2002 ACM symposium on Applied computing · doi:10.1145/508791.508907 · Cited by 656
Strategies for finding good local guides in multi-objective particle swarm optimization (MOPSO)
Mostaghim, S., & Teich, J. (2004) · IEEE Swarm Intelligence Symposium · doi:10.1109/sis.2003.1202243 · Cited by 654
GA-Net: A Genetic Algorithm for Community Detection in Social Networks
Pizzuti, C. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-87700-4_107 · Cited by 481
Finding communities in linear time: a physics approach
Wu, F., & Huberman, B. A. (2004) · The European Physical Journal B - Condensed Matter · doi:10.1140/epjb/e2004-00125-x · Cited by 451
Analysis of the structure of complex networks at different resolution levels
Arenas, A., Fernández, A., & Gómez, S. (2008) · New Journal of Physics · doi:10.1088/1367-2630/10/5/053039 · Cited by 446
A discrete version of particle swarm optimization for flowshop scheduling problems
Liao, C.-J., Tseng, C.-T., & Luarn, P. (2007) · Computers & Operations Research · doi:10.1016/j.cor.2005.11.017 · Cited by 445
A Novel Set-Based Particle Swarm Optimization Method for Discrete Optimization Problems
Chen, W.-N., Zhang, J., Chung, H. S. H., Zhong, W.-L., Wu, W.-G., & Shi, Y.-H. (2010) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2009.2030331 · Cited by 423
Community Mining from Signed Social Networks
Yang, B., Cheung, W., & Liu, J. (2007) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2007.1061 · Cited by 383
Quantitative function for community detection
Li, Z., Zhang, S., Wang, R.-S., Zhang, X.-S., & Chen, L. (2008) · Physical Review E · doi:10.1103/physreve.77.036109 · Cited by 382
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
A partitioning approach to structural balance
Doreian, P., & Mrvar, A. (1996) · Social Networks · doi:10.1016/0378-8733(95)00259-6 · Cited by 297
Analysis of community structure in networks of correlated data
Gómez, S., Jensen, P., & Arenas, A. (2009) · Physical Review E · doi:10.1103/physreve.80.016114 · Cited by 260
Community detection in networks by using multiobjective evolutionary algorithm with decomposition
Gong, M., Ma, L., Zhang, Q., & Jiao, L. (2012) · Physica A: Statistical Mechanics and its Applications · doi:10.1016/j.physa.2012.03.021 · Cited by 242
Self-citationParticle swarm with extended memory for multiobjective optimization
Hu, X., Eberhart, R. C., & Shi, Y. (2004) · Proceedings of the 2003 IEEE Swarm Intelligence Symposium. SIS'03 (Cat. No.03EX706) · doi:10.1109/sis.2003.1202267 · Cited by 240
Cultures of the Central Highlands, New Guinea
Read, K. E. (1954) · Southwestern Journal of Anthropology · doi:10.1086/soutjanth.10.1.3629074 · Cited by 236
Memetic algorithm for community detection in networks
Gong, M., Fu, B., Jiao, L., & Du, H. (2011) · Physical Review E · doi:10.1103/physreve.84.056101 · Cited by 225
Self-citationMulti-objective community detection in complex networks
Shi, C., Yan, Z., Cai, Y., & Wu, B. (2012) · Applied Soft Computing · doi:10.1016/j.asoc.2011.10.005 · Cited by 185
Fuzzy discrete particle swarm optimization for solving traveling salesman problem
Pang, W., Wang, K., Zhou, C., & Dong, L.-J. (2004) · IEEE International Conference on Computer and Information Technology (CIT) · doi:10.1109/cit.2004.1357292 · Cited by 161
Zhao, S.-Z., Iruthayarajan, M. W., Baskar, S. S., & Suganthan, P. N. (2011) · Information Sciences · doi:10.1016/j.ins.2011.04.003 · Cited by 113
Spectral and dynamical properties in classes of sparse networks with mesoscopic inhomogeneities
Dankulov, M. M., & Tadić, B. (2009) · Physical Review E · doi:10.1103/physreve.80.026123 · Cited by 111
DNA Sequence Compression Using Adaptive Particle Swarm Optimization-Based Memetic Algorithm
Zhu, Z., Zhou, J., Ji, Z., & Shi, Y. (2011) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2011.2160399 · Cited by 110
Cultural-Based Multiobjective Particle Swarm Optimization
Daneshyari, M., & Yen, G. G. (2010) · IEEE Transactions on Systems Man and Cybernetics Part B (Cybernetics) · doi:10.1109/tsmcb.2010.2068046 · Cited by 107
Identification of network modules by optimization of ratio association
Angelini, L., Boccaletti, S., Marinazzo, D., Pellicoro, M., & Stramaglia, S. (2007) · Chaos An Interdisciplinary Journal of Nonlinear Science · doi:10.1063/1.2732162 · Cited by 76
An improved memetic algorithm for community detection in complex networks
Gong, M., Cai, Q., Li, Y., & Ma, J. (2012) · IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/cec.2012.6252971 · Cited by 75
Self-citationSolving multi objective optimization problems using particle swarm optimization
Zhang, L. B., Zhou, C., Liu, X. H., Ma, Z., Ma, M., & Liang, Y. (2004) · IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/cec.2003.1299388 · Cited by 66
Post-processing hierarchical community structures: Quality improvements and multi-scale view
Pons, P., & Matthieu Latapy, B. (2010) · Theoretical Computer Science · doi:10.1016/j.tcs.2010.11.041 · Cited by 52
Benameur, L., Chentoufi, J. A., & Imrani, A. E. (2009) · International Conference on Computational Intelligence, Modelling and Simulation · doi:10.1109/cssim.2009.42 · Cited by 18
A fast particle swarm algorithm for solving smooth and non-smooth economic dispatch problems
Cagnina, L., Esquivel, S. C., & Coello, C. A. C. (2010) · Engineering Optimization · doi:10.1080/0305215x.2010.497186 · Cited by 17
Cited by
A Comprehensive Review of Swarm Optimization Algorithms
Ab Wahab, M. N., Nefti-Meziani, S., & Atyabi, A. (2015) · PLOS ONE · doi:10.1371/journal.pone.0122827 · Cited by 547
Evolutionary Large-Scale Multi-Objective Optimization: A Survey
Tian, Y., Si, L., Zhang, X., Cheng, R., He, C., Tan, K. C., & Jin, Y. (2022) · ACM Computing Surveys · doi:10.1145/3470971 · Cited by 401
A novel multi-objective particle swarm optimization with multiple search strategies
Lin, Q., Li, J., Du, Z., Chen, J., & Ming, Z. (2015) · European Journal of Operational Research · doi:10.1016/j.ejor.2015.06.071 · Cited by 300
Improving Metaheuristic Algorithms With Information Feedback Models
Wang, G.-G., & Tan, Y. (2019) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2017.2780274 · Cited by 285
Metadata
- Authors
- Gong, M., Cai, Q., Chen, X., & Ma, L.
- Venue
- IEEE Transactions on Evolutionary Computation
- Published
- 2014-02
- Volume
- 18
- Issue
- 1
- Pages
- 82-97
- ISSN
- 1089-778X (ISSN-L)
- 1941-0026
- OpenAlex
- W2097464974
- Cited by
- 394
- References
- 60
- FWCI
- 18.89
- 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.