摘要：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.
关键词：ant colony optimization; community detection; bipartite network
