Using the Clustering Coefficient to Guide a Genetic-Based Communities Finding Algorithm

  • Gema Bello
  • Héctor Menéndez
  • David Camacho
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6936)

Abstract

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.

Keywords

clustering coefficient social networks community finding genetic algorithms 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Barrat, A., Barthélemy, M., Pastor-Satorras, R., Vespignani, A.: The architecture of complex weighted networks. Proceedings of the National Academy of Sciences of the United States of America 101(11), 3747–3752 (2004)CrossRefGoogle Scholar
  2. 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
  3. 3.
    Dempster, A.P., Laird, N.M., Rubin, D.B.: Maximum Likelihood from Incomplete Data via the EM Algorithm. Journal of the Royal Statistical Society. Series B (Methodological) 39(1), 1–38 (1977)MathSciNetMATHGoogle Scholar
  4. 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
  5. 5.
    Girvan, M., Newman, M.E.J.: Community structure in social and biological networks. Proceedings of the National Academy of Sciences of the United States of America 99(12), 7821–7826 (2002)MathSciNetCrossRefMATHGoogle Scholar
  6. 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. 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
  8. 8.
    Oussalah, M., Nefti, S.: On the use of divergence distance in fuzzy clustering. Fuzzy Optimization and Decision Making 7, 147–167 (2008)MathSciNetCrossRefMATHGoogle Scholar
  9. 9.
    Palla, G., Derenyi, I., Farkas, I., Vicsek, T.: Uncovering the overlapping community structure of complex networks in nature and society. Nature 435(7043), 814–818 (2005)CrossRefGoogle Scholar
  10. 10.
    Vose, M.D.: The Simple Genetic Algorithm: Foundations and Theory. MIT Press, Cambridge (1998)MATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Gema Bello
    • 1
  • Héctor Menéndez
    • 1
  • David Camacho
    • 1
  1. 1.Departamento de Ingeniería Informática, Escuela Politécnica SuperiorUniversidad Autónoma de MadridMadridSpain

Personalised recommendations