Multi-level fuzzy overlapping community detection algorithm for weighted networks Online publication date: Sat, 22-Feb-2020
by Ali Choumane; Ali Harkous
International Journal of Data Science (IJDS), Vol. 4, No. 4, 2019
Abstract: To understand the hierarchical structure of large networks we propose a multi-level community detection algorithm. Each level consists of a set of fuzzy overlapping communities where a node can belong to multiple communities associated with belonging membership degrees. Our algorithm works for weighted and unweighted networks as well. For each level of hierarchy, it identifies the centres of potential communities and iteratively expands them to form the final communities. A new vector representation of the nodes is proposed and used in the centre's expansion process and in the computation of the belonging degrees. Communities detected at a given level serve as super nodes while identifying the overlapping communities of a higher level. Experiments achieved on the well-known LFR benchmark showed high performance which is measured by the normalised mutual information (NMI). Unlike existing methods, our algorithm shows good and stable performance when varying the number of communities of the overlapping nodes.
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 Data Science (IJDS):
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