Bi-Objective Community Detection (BOCD) in Networks using Genetic Algorithm
arXiv:1109.3650 · doi:10.1007/978-3-642-22606-9_5
Abstract
A lot of research effort has been put into community detection from all corners of academic interest such as physics, mathematics and computer science. In this paper I have proposed a Bi-Objective Genetic Algorithm for community detection which maximizes modularity and community score. Then the results obtained for both benchmark and real life data sets are compared with other algorithms using the modularity and MNI performance metrics. The results show that the BOCD algorithm is capable of successfully detecting community structure in both real life and synthetic datasets, as well as improving upon the performance of previous techniques.
11 pages, 3 Figures, 3 Tables. arXiv admin note: substantial text overlap with arXiv:0906.0612
References in corpus (8)
- Finding and evaluating community structure in networks
- Modularity and community structure in networks
- Fast algorithm for detecting community structure in networks
- Cooperative Game Theory Approaches for Network Partitioning
- Benchmark graphs for testing community detection algorithms
- Comparing community structure identification
- Detecting the overlapping and hierarchical community structure of complex networks
- Community Detection in Complex Networks Using Genetic Algorithms