ACM Home Page
Please provide us with feedback. Feedback
Community detection in social networks with genetic algorithms
Full text PdfPdf (261 KB)
Source
Genetic And Evolutionary Computation Conference archive
Proceedings of the 10th annual conference on Genetic and evolutionary computation table of contents
Atlanta, GA, USA
POSTER SESSION: Genetic algorithms posters table of contents
Pages 1137-1138  
Year of Publication: 2008
ISBN:978-1-60558-130-9
Author
Clara Pizzuti  ICAR-CNR, RENDE (Cosenza), Italy
Sponsors
ACM: Association for Computing Machinery
SIGEVO: ACM Special Interest Group on Genetic and Evolutionary Computation
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 6,   Downloads (12 Months): 96,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1389095.1389316
What is a DOI?

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.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
U. Brandes, M. Gaertler, and D. Wagner. Experiments on graph clustering algorithms. In Algorithms: ESA 2003, 11th Annual European Symposium, pages 568--579, 2003.
 
2
Aaron Clauset, M. E. J. Newman, and Cristopher Moore. Finding community structure in very large networks. Physical Review E, 70:066111, 2004.
 
3
L. Danon, J. Duch, A. Arenas, and A. Díaz-Guilera. Community structure identification. Large Scale Structure and Dynamics of Complex Networks: From Information Technology to Finance and Natural Science,World Scientific,, pages 93--113, 2007.
 
4
M. Girvan and M. E. J. Newman. Community structure in social and biological networks. In Proc. National. Academy of Science. USA 99, pages 7821--7826, 2002.
 
5
S. Lozano, J. Duch, and A. Arenas. Analysis of large social datasets by community detection. European Physical Journal ST, 143:257--259, 2007.
 
6
M. E. J. Newman and M. Girvan. Finding and evaluating community structure in networks. Physical Review E, 69:026113, 2004.
 
7
Y.J. Park and M.S. Song. A genetic algorithm for clustering problems. In Proc. of 3rd Annual Conference on Genetic Algorithms, pages 2--9, 1989.
 
8
Filippo Radicchi, Claudio Castellano, Federico Cecconi, Vittorio Loreto, and Domenico Parisi. Defining and identifying communities in networks. Proc. Natl. Acad.Sci. USA (PNAS'04), 101(9):2658--2663, 2004.