Bi-Objective Community Detection (BOCD) in Networks using Genetic Algorithm

09/16/2011
by   Rohan Agrawal, et al.
0

A lot of research effort has been put into community detection from all corners of academic interest such as physics, mathematics and computer science. In this paper I have proposed a Bi-Objective Genetic Algorithm for community detection which maximizes modularity and community score. Then the results obtained for both benchmark and real life data sets are compared with other algorithms using the modularity and MNI performance metrics. The results show that the BOCD algorithm is capable of successfully detecting community structure in both real life and synthetic datasets, as well as improving upon the performance of previous techniques.

READ FULL TEXT
research
09/30/2021

Transfer Learning Based Multi-Objective Genetic Algorithm for Dynamic Community Detection

Dynamic community detection is the hotspot and basic problem of complex ...
research
11/14/2018

SCORE+ for Network Community Detection

SCORE is a recent approach to network community detection proposed by Ji...
research
09/01/2016

From Community Detection to Community Deception

The community deception problem is about how to hide a target community ...
research
01/19/2014

Evolving Accuracy: A Genetic Algorithm to Improve Election Night Forecasts

In this paper, we apply genetic algorithms to the field of electoral stu...
research
01/24/2022

Detecting Communities in Complex Networks using an Adaptive Genetic Algorithm and node similarity-based encoding

Detecting communities in complex networks can shed light on the essentia...
research
11/30/2021

Descriptive vs. inferential community detection: pitfalls, myths and half-truths

Community detection is one of the most important methodological fields o...
research
04/30/2014

A Bi-clustering Framework for Consensus Problems

We consider grouping as a general characterization for problems such as ...

Please sign up or login with your details

Forgot password? Click here to reset