Clustering of Complex Networks and Community Detection Using Group Search Optimization

07/04/2013
by   G. Kishore Kumar, et al.
0

Group Search Optimizer(GSO) is one of the best algorithms, is very new in the field of Evolutionary Computing. It is very robust and efficient algorithm, which is inspired by animal searching behaviour. The paper describes an application of GSO to clustering of networks. We have tested GSO against five standard benchmark datasets, GSO algorithm is proved very competitive in terms of accuracy and convergence speed.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/05/2021

Uso de GSO cooperativos com decaimentos de pesos para otimizacao de redes neurais

Training of Artificial Neural Networks is a complex task of great import...
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
09/26/2019

Military Dog Based Optimizer and its Application to Fake Review

Over the last three decades more then sixty meta-heuristic algorithms ha...
research
07/25/2022

Minimax Rates for Robust Community Detection

In this work, we study the problem of community detection in the stochas...
research
09/30/2020

A Coevolutionary Variable Neighborhood Search Algorithm for Discrete Multitasking (CoVNS): Application to Community Detection over Graphs

The main goal of the multitasking optimization paradigm is to solve mult...
research
09/06/2013

Projection onto the probability simplex: An efficient algorithm with a simple proof, and an application

We provide an elementary proof of a simple, efficient algorithm for comp...
research
10/05/2018

Ockham's Razor in Memetic Computing: Three Stage Optimal Memetic Exploration

Memetic Computing is a subject in computer science which considers compl...

Please sign up or login with your details

Forgot password? Click here to reset