Using the Clustering Coefficient to Guide a Genetic-Based Communities Finding Algorithm
Finding communities in networks is a hot topic in several research areas like social network, graph theory or sociology among others. This work considers the community finding problem as a clustering problem where an evolutionary approach can provide a new method to find overlapping and stable communities in a graph. We apply some clustering concepts to search for new solutions that use new simple fitness functions which combine network properties with the clustering coefficient of the graph. Finally, our approach has been applied to the Eurovision contest dataset, a well-known social-based data network, to show how communities can be found using our method.
Keywordsclustering coefficient social networks community finding genetic algorithms
Unable to display preview. Download preview PDF.
- 2.Bello, G., Cajias, R., Camacho, D.: Study on the impact of crowd-based voting schemes in the eurovision european contest. In: 1st International Conference on Web Intelligence, Mining and Semantics (WIMS 2011). ACM press, New York (2011)Google Scholar
- 4.Derényi, I., Palla, G., Vicsek, T.: Clique Percolation in Random Networks. Physical Review Letters 94(16), 160202-1–160202-4, (April 2005)Google Scholar
- 6.Gonzalez Pardo, A., Granados, A., Camacho, D., Rodruez, F.D.: Influence of music representation on compression based clustering. In: IEEE World Congress on Computational Intelligence, pp. 2988–2995. IEEE, Los Alamitos (2010)Google Scholar
- 7.Macqueen, J.B.: Some methods of classification and analysis of multivariate observations. In: Proceedings of the Fifth Berkeley Symposium on Mathematical Statistics and Probability, pp. 281–297 (1967)Google Scholar