Ant Colony Optimization for Detecting Communities from Bipartite network
Lists
Only you see this
Abstract
In this paper, an algorithm based on ant colony optimization for community detection from bipartite networks is presented. The algorithm establishes a model graph for the ants’ searching. Each ant chooses its path according to the pheromone and heuristic information on each edge to construct a solution. Experimental results show that our algorithm can not only accurately identify the number of communities of a network, but also obtain higher quality of community detection.
BibTeX
@article{xu2013ant,
author = {Yongcheng Xu and Ling Chen and Sheng-Rong Zou},
title = {{Ant Colony Optimization for Detecting Communities from Bipartite network}},
journal = {Journal of Software},
year = {2013},
doi = {10.4304/jsw.8.11.2930-2935},
}Loading related content...