Community detection in social networks with genetic algorithms

Authors:
Clara Pizzuti
Affiliations:
ICAR-CNR, RENDE (Cosenza), Italy
Venue:
Proceedings of the 10th annual conference on Genetic and evolutionary computation
Year:
2008

Citing 0
Cited 10

Community mining on dynamic weighted directed graphs

Proceedings of the 1st ACM international workshop on Complex networks meet information & knowledge management
Guiding users within trust networks using swarm algorithms

CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
A novel algorithm for hierarchical community structure detection in complex networks

ADMA'10 Proceedings of the 6th international conference on Advanced data mining and applications: Part I
Adaptable swarm intelligence framework

Proceedings of the 2nd International Conference on Web Intelligence, Mining and Semantics
A multiobjective hybrid evolutionary algorithm for clustering in social networks

Proceedings of the 14th annual conference companion on Genetic and evolutionary computation
A posteriori approach for community detection

Journal of Computer Science and Technology - Special issue on Community Analysis and Information Recommendation
A Hybrid Evolutionary Algorithm Based on HSA and CLS for Multi-objective Community Detection in Complex Networks

ASONAM '12 Proceedings of the 2012 International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2012)
A multiobjective evolutionary programming framework for graph-based data mining

Information Sciences: an International Journal
Community Detection in Complex Networks: Multi-objective Enhanced Firefly Algorithm

Knowledge-Based Systems
Evaluating community detection using a bi-objective optimization

ICIC'13 Proceedings of the 9th international conference on Intelligent Computing Theories

Quantified Score

Hi-index	0.00

Visualization

Abstract

A new genetic algorithm to detect communities in social networks is presented. The algorithm uses a fitness function able to identify groups of nodes in the network having dense intra-connections, and sparse inter-connections. The variation operators employed are suitably adapted to take into account the actual links among the nodes. These modified operators makes the method efficient because the space of possible solutions is sensibly reduced. Experiments on a real life network show the capability of the method to successfully identify the network structure.