Community detection using intelligent water drops optimisation algorithm
by Saba ElMustafa; Ameera Jaradat; Iyad Abu Doush; Nahed Mansour
International Journal of Reasoning-based Intelligent Systems (IJRIS), Vol. 9, No. 1, 2017

Abstract: Community structure means the existence of densely connected subgroups in the networks. It is a surprising property that appears in complex and naturally constructed networks. We are proposing a novel heuristic approach to the community detection problem. In this paper, the community detection problem is solved using the intelligent water drop heuristic on a group of real life networks. The proposed heuristic succeeded in grouping the nodes in the network into sets of densely connected subgroups. Our approach uses the modularity value as an optimisation criterion. The quality of the resulting division in the network was proven using measures like modularity and NMI. The experimental results verify that our algorithm is highly efficient at discovering quality community structure.

Online publication date: Sun, 27-Aug-2017

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
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 Reasoning-based Intelligent Systems (IJRIS):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your 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