doi: 10.4304/jsw.8.11.2930-2935
Ant Colony Optimization for Detecting Communities from Bipartite Network
2State Key Lab of Novel Software Tech, Nanjing University, Nanjing, 210093, China
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.
Index Terms—Ant colony optimization, community detection, bipartite network.
Cite: Yongcheng Xu, Ling Chen and Shengrong Zou, "Ant Colony Optimization for Detecting Communities from Bipartite Network," Journal of Software vol. 8, no. 11, pp. 2930-2935, 2013.
General Information
ISSN: 1796-217X (Online)
Abbreviated Title: J. Softw.
Frequency: Quarterly
APC: 500USD
DOI: 10.17706/JSW
Editor-in-Chief: Prof. Antanas Verikas
Executive Editor: Ms. Cecilia Xie
Abstracting/ Indexing: DBLP, EBSCO,
CNKI, Google Scholar, ProQuest,
INSPEC(IET), ULRICH's Periodicals
Directory, WorldCat, etcE-mail: jsweditorialoffice@gmail.com
-
Jun 12, 2024 News!
Vol 19, No 2 has been published with online version [Click]
-
Jan 04, 2024 News!
JSW will adopt Article-by-Article Work Flow
-
Apr 01, 2024 News!
Vol 14, No 4- Vol 14, No 12 has been indexed by IET-(Inspec) [Click]
-
Apr 01, 2024 News!
Papers published in JSW Vol 18, No 1- Vol 18, No 6 have been indexed by DBLP [Click]
-
Mar 01, 2024 News!
Vol 19, No 1 has been published with online version [Click]