International Journal of Science and Research (IJSR)

International Journal of Science and Research (IJSR)
Call for Papers | Fully Refereed | Open Access | Double Blind Peer Reviewed

ISSN: 2319-7064


Downloads: 85

Research Paper | Biological Engineering | India | Volume 3 Issue 8, August 2014


Benchmarks for Overlapping Community Detection Algorithms

Dr. M. Nagaratna [2] | S. Swarajya Lakshmi


Abstract: Recent studies on networks obtained from different domains such as social networking sites, internet / web-pages, protein-protein interaction networks etc. , have shown that they share many common properties. One of the common properties of all these real networks is that they follow a community structure where the set of nodes with common interest are grouped together. The nodes within a group interact with each other very frequently and have relatively less interaction with the nodes of the other groups. The other essential property observed about these communities is that they have an overlapping nature, where some nodes can be members of more than one community. Several overlapping community detection algorithms like GCE and CFinder were proposed to detect the overlapping nature of communities of a given network. This requires performance comparison of these algorithms on a set of networks with known community structure or in other words a set of benchmark networks. There are different types of benchmark networks. In this work we studied the existing commonly used benchmark, namely, the LFR benchmark. The actual problem of this LFR benchmark is that it can create a network in which every node belongs to at least one community i. e, membership is at least one. But in real networks such as social or biological or computer networks, some nodes may not belong to any community (i. e. , zero membership) but still have sparse interactions with the other nodes that are either members of any community or nodes like them (these are actually called the homeless nodes or orphan nodes). We have extended the presently existing LFR benchmark with orphan nodes. In our experiments we have observed that in some cases extended LFR benchmark (benchmark with orphan nodes or ELFR) is 5 % better than the normal LFR benchmark.


Keywords: community, overlapping, LFR, GCE, CFinder


Edition: Volume 3 Issue 8, August 2014,


Pages: 1690 - 1693


How to Download this Article?

You Need to Register Your Email Address Before You Can Download the Article PDF


How to Cite this Article?

Dr. M. Nagaratna, S. Swarajya Lakshmi, "Benchmarks for Overlapping Community Detection Algorithms", International Journal of Science and Research (IJSR), Volume 3 Issue 8, August 2014, pp. 1690-1693, https://www.ijsr.net/get_abstract.php?paper_id=2015616

Similar Articles with Keyword 'community'

Downloads: 80

Review Papers, Biological Engineering, China, Volume 3 Issue 4, April 2014

Pages: 800 - 807

Techniques for Tracking Microbial Community Structure and Function in Natural Environment and Engineered Systems

Baba Ngom | Xueduan Liu

Share this Article

Downloads: 107

Research Proposals or Synopsis, Biological Engineering, India, Volume 8 Issue 2, February 2019

Pages: 2135 - 2139

Physiological Parameter Monitoring using RFID and GSM based Automated Alert System

K Ramya Krishnaveni | S Swathi

Share this Article
Top