Deep community detection based on memetic algorithm
- 1 May 2015
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 1089778X,p. 648-655
Abstract
Deep community can be detected by removing noise nodes or edges from a network. A centrality measure, named local Fiedler vector centrality is proposed for deep community detection. Algorithms to optimize local Fiedler vector centrality are either with high computation complexity or difficult to find the optimal solution of local Fiedler vector centrality. In this paper, a novel memetic algorithm is proposed to maximize local Fiedler vector centrality for deep community detection. Experiments of our proposed memetic algorithm on four real world networks demonstrate that our algorithm can find optimal solution of local Fiedler vector centrality and is effective to discover deep communities.Keywords
This publication has 29 references indexed in Scilit:
- A Mixed-Integer Memetic Algorithm Applied to Batch Process OptimizationApplied Mechanics and Materials, 2013
- Memetic algorithm for community detection in networksPhysical Review E, 2011
- A classification for community discovery methods in complex networksStatistical Analysis and Data Mining: An ASA Data Science Journal, 2011
- Community detection in graphsPhysics Reports, 2010
- Modularity and community structure in networksProceedings of the National Academy of Sciences of the United States of America, 2006
- Ego network betweennessSocial Networks, 2005
- Detecting community structure in networksThe European Physical Journal B, 2004
- Normalized cuts and image segmentationIEEE Transactions on Pattern Analysis and Machine Intelligence, 2000
- A Set of Measures of Centrality Based on BetweennessSociometry, 1977
- The Centrality Index of a GraphPsychometrika, 1966