Abstract
Core-periphery structure detection (CPSD) in complex networks is essential to reveal functional nodes in the complicated systems, e.g., influential nodes in a social network and central cells in a biological network. Some progress has been made in solving the CPSD problem with heuristic algorithms. However, CPSD is naturally an NP-hard optimization problem and the core-periphery structures (CPSs) in real networks usually are not clearly distinguishable. The majority of the existing CPSD methods are single-objective methods relying on some assumptions, preference, and/or prior knowledge. They can provide only one trade-off solution that is inevitably biased and lacks of flexibility in terms of resolution. To address this issue, this paper formulates the CPSD problem as a multi-objective optimization problem (MOP), i.e., minimizing the core-node size and maximizing the core-node capacity of the CPSs, simultaneously. Solving the MOP can provide more accurate CPSs and allow one to explore the network structure at different preferred resolutions. A multi-objective memetic algorithm (called MOMA-PCLS) is accordingly proposed to solve the formulated problem. A new plateau-climbing local search (PCLS) method incorporating the information of the heavy-tailed distribution of the node capacity is introduced to fine-tune the individual solutions in MOMA-PCLS. By combining the evolutionary operations and PCLS, MOMA-PCLS manages to improve the search efficiency significantly. Experimental results on both synthetic and real-world data show the superiority of MOMA-PCLS to other state-of-the-art algorithms in detecting CPSs of complex networks.
Similar content being viewed by others
References
Amaya JE, Cotta C, Fernández AJ, García-Sánchez P (2020) Deep memetic models for combinatorial optimization problems: application to the tool switching problem. Memetic Comput 12(1):3–22
Borgatti SP, Everett MG (2000) Models of core/periphery structures. Social Netw 21(4):375–395
Chen X, Ong YS, Lim MH, Tan KC (2011) A multi-facet survey on memetic computation. IEEE Trans Evol Comput 15(5):591–607
Cheng F, Cui T, Su Y, Niu Y, Zhang X (2018) A local information based multi-objective evolutionary algorithm for community detection in complex networks. Appl Soft Comput 69(1):357–367
Cucuringu M, Rombach P, Lee SH, Porter MA (2016) Detection of core-periphery structure in networks using spectral methods and geodesic paths. Eur J Appl Math 27(6):846–887
Da Silva MR, Ma H, Zeng AP (2008) Centrality, network capacity, and modularity as parameters to analyze the core-periphery structure in metabolic networks. Proc IEEE 96(8):1411–1420
Fasino D, Rinaldi F (2020) A fast and exact greedy algorithm for the core-periphery problem. Symmetry 12(1):94
Gabardo AC, Berretta R, Moscato P (2020) M-link: a link clustering memetic algorithm for overlapping community detection. Memetic Comput 12(2):87–99
Glover F (1986) Future paths for integer programming and links to artificial intelligence. Comput Oper Res 13(5):533–549
Gong M, Chen C, Xie Y, Wang S (2020) Community preserving network embedding based on memetic algorithm. IEEE Trans Emerg Top Comput Intell 4(2):108–118
Gu S, Xia CH, Ciric R, Moore TM, Gur RC, Gur RE, Satterthwaite TD, Bassett DS (2020) Unifying the notions of modularity and core-periphery structure in functional brain networks during youth. Cereb Cortex 30(3):1087–1102
Gupta A, Ong YS (2018) Memetic computation: the mainspring of knowledge transfer in a data-driven optimization era, vol 21. Springer, New York, NY, USA
Ibrahim AO, Shamsuddin SM, Abraham A, Qasem SN (2019) Adaptive memetic method of multi-objective genetic evolutionary algorithm for backpropagation neural network. Neural Comput Appl 31(9):4945–4962
de Jeude JV, Caldarelli G, Squartini C (2019) Detecting core-periphery structures by surprise. Europhys Lett 125(6):68001
Jia J, Benson AR (2019) Random spatial network models for core-periphery structure. In: Proceedings of the Twelfth ACM International Conference on Web Search and Data Mining WSDM, Feb 11-15, 2019, Melbourne, Australia, pp. 366–374
Kirkpatrick S, Gelatt CD, Vecchi MP (1983) Optimization by simulated annealing. Science 220(4598):671–680
Kojaku S, Masuda N (2018) Core-periphery structure requires something else in the network. New J Phys 20(4):43012–43012
Kojaku S, Xu M, Xia H, Masuda N (2019) Multiscale core-periphery structure in a global liner shipping network. Sci Rep 9(1):1–15
Li M, Liu J, Wu P, Teng X (2020) Evolutionary network embedding preserving both local proximity and community structure. IEEE Trans Evol Comput 24(3):523–535
Li W, Qiao M, Qin L, Zhang Y, Chang L, Lin X (2020) Scaling up distance labeling on graphs with core-periphery properties. In: Proceedings of the 2020 International Conference on Management of Data SIGMOD, June 14-19, 2020, Portland, OR, USA, pp. 1367–1381. ACM
Lierde HV, Chow TWS, Chen G (2020) Scalable spectral clustering for overlapping community detection in large-scale networks. IEEE Trans Knowl Data Eng 32(4):754–767
Ma L, Li J, Lin Q, Gong M, Coello CAC, Ming Z (2019) Cost-aware robust control of signed networks by using a memetic algorithm. IEEE Trans Cybern 50(10):4430–4443
Ma L, Li J, Lin Q, Gong M, Coello CAC, Ming Z (2019) Reliable link inference for network data with community structures. IEEE Trans Cybern 49(9):3347–3361
Ma X, Li X, Zhang Q, Tang K, Liang Z, Xie W, Zhu Z (2019) A survey on cooperative co-evolutionary algorithms. IEEE Trans Evol Comput 23(3):421–441
NetworkX: Configuration model (2021). Accessed 30 March 2021. https://networkx.org/documentation/stable/reference/generated/networkx.generators.degree_seq.configuration_model.html
Ong YS, Lim MH, Zhu N, Wong KW (2006) Classification of adaptive memetic algorithms: a comparative study. IEEE Trans Syst Man Cybern B 36(1):141–152
Pizzuti C, Socievole A (2019) Multiobjective optimization and local merge for clustering attributed graphs. IEEE Trans Cybern 49(1):1–13
Qiu J, Liu M, Zhang L, Li W, Cheng F (2019) A multi-level knee point based multi-objective evolutionary algorithm for AUC maximization. Memetic Comput 11(3):285–296
Riaza R (2018) Twin subgraphs and core-semiperiphery-periphery structures. Complexity 2018(1):1–17
Rombach P, Porter MA, Fowler JH, Mucha PJ (2017) Core-periphery structure in networks. SIAM Rev 59(3):619–646
Rossi RA, Ahmed NK (2015) The network data repository with interactive graph analytics and visualization. In: Proceedings of the Twenty-Ninth Conference on Artificial Intelligence AAAI, January 25-30, 2015, Austin, Texas, USA, pp. 4292–4293
Ruíz LGB, Capel MI, Pegalajar M (2019) Parallel memetic algorithm for training recurrent neural networks for the energy efficiency problem. Appl Soft Comput 76:356–368
Sarkar S, Sikdar S, Bhowmick S, Mukherjee A (2018) Using core-periphery structure to predict high centrality nodes in time-varying networks. Data Min Knowl Disc 32(5):1368–1396
SNAP: Ego-facebook network (2021). Accessed 30 March 2021. http://snap.stanford.edu/data/ego-Facebook.html
Tang W, Zhao L, Liu W, Liu Y, Yan B (2019) Recent advance on detecting core-periphery structure: a survey. CCF Trans Perva Comput Intera 1(3):175–189
Tudisco F, Higham DJ (2019) A nonlinear spectral method for core-periphery detection in networks. SIAM J Math Data Sci 1(2):269–292
Wang G, Cai X, Cui Z, Min G, Chen J (2020) High performance computing for cyber physical social systems by using evolutionary multi-objective optimization algorithm. IEEE Trans Emerg Top Comput 8(1):20–30
Wang R, Liu G, Wang C (2019) Identifying protein complexes based on an edge weight algorithm and core-attachment structure. BMC Bioinform 20(1):1–20
Wang S, Gong M, Liu W, Wu Y (2020) Preventing epidemic spreading in networks by community detection and memetic algorithm. Appl Soft Comput 89:106118
Wang S, Liu J (2019) Community robustness and its enhancement in interdependent networks. Appl Soft Comput 77:665–677
Xiang BB, Bao ZK, Ma C, Zhang X, Chen HS, Zhang HF (2018) A unified method of detecting core-periphery structure and community structure in networks. Chaos: Interdiscipl J Nonlinear Sci 28(1):013122
Yang J, Zhang M, Shen KN, Ju X, Guo X (2018) Structural correlation between communities and core-periphery structures in social networks: evidence from twitter data. Expert Syst. Appl. 111(1):91–99
Zhang X, Zhou K, Pan H, Zhang L, Zeng X, Jin Y (2020) A network reduction-based multiobjective evolutionary algorithm for community detection in large-scale complex networks. IEEE Trans. Cybern. 50(2):703–716
Zhou Z, Xiao Z, Deng W (2020) Improved community structure discovery algorithm based on combined clique percolation method and k-means algorithm. Peer Peer Netw. Appl. 13(6):2224–2233
Zhu Z, Ong YS, Dash M (2007) Markov blanket-embedded genetic algorithm for gene selection. Pattern Recogn. 40(11):3236–3248
Zhu Z, Ong YS, Dash M (2007) Wrapper-filter feature selection algorithm using a memetic framework. IEEE Trans. Syst. Man Cyber. B 37(1):70–76
Funding
This work was supported in part by National Natural Science Foundation of China [61871272 and 61803269], in part by the Guangdong Provincial Key Laboratory [2020B121201001 and 2020A1515010790 ], in part by the Shenzhen Fundamental Research Program [JCYJ20190808173617147 and JCYJ20190808174801673], and in part by the BGI-Research Shenzhen Open Funds [BGIRSZ20200002].
Author information
Authors and Affiliations
Corresponding authors
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Li, G., Zhu, Z., Ma, L. et al. Multi-objective memetic algorithm for core-periphery structure detection in complex network. Memetic Comp. 13, 285–306 (2021). https://doi.org/10.1007/s12293-021-00342-9
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s12293-021-00342-9