Community detection in complex networks using extremal optimization.
暂无分享,去创建一个
We propose a method to find the community structure in complex networks based on an extremal optimization of the value of modularity. The method outperforms the optimal modularity found by the existing algorithms in the literature giving a better understanding of the community structure. We present the results of the algorithm for computer-simulated and real networks and compare them with other approaches. The efficiency and accuracy of the method make it feasible to be used for the accurate identification of community structure in large complex networks.
[1] G. G. Stokes. "J." , 1890, The New Yale Book of Quotations.
[2] Nils J. Nilsson,et al. Artificial Intelligence , 1974, IFIP Congress.
[3] Alfred V. Aho,et al. Data Structures and Algorithms , 1983 .
[4] David E. Goldberg,et al. Genetic Algorithms in Search Optimization and Machine Learning , 1988 .
[5] D. E. Goldberg,et al. Genetic Algorithms in Search , 1989 .
[6] 김삼묘,et al. “Bioinformatics” 특집을 내면서 , 2000 .