ACFC: ant colony with fuzzy clustering algorithm for community detection in social networks Online publication date: Fri, 17-May-2019
by Ehsan Noveiri; Marjan Naderan; Seyed Enayatollah Alavi
International Journal of Ad Hoc and Ubiquitous Computing (IJAHUC), Vol. 31, No. 1, 2019
Abstract: In this paper, we suggest a bipartite algorithm, based on ant colony with fuzzy clustering, namely ACFC, for finding communities in social networks. First, we use artificial ants to traverse the network modelled by a graph based on a set of rules to find a 'good region' of edges. Next, we construct the communities after which local optimisation methods are used to further improve the solution quality. Finally, we use the fuzzy C-means (FCM) clustering algorithm to fine tune the result. In our method ants are only used to identify good regions of the search space and construction methods are used to build the final solution. Experimental results on several synthetic graphs and four real world social networks compared to six other well known methods show that our ACFC algorithm is very competitive against current state-of-the-art techniques for community detection and it is more accurate than existing algorithms as it performs well across many different types of networks.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Ad Hoc and Ubiquitous Computing (IJAHUC):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook