Skip to main content

Exploration and Exploitation Operators for Genetic Graph Clustering Algorithm

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 7661))

Abstract

In this paper, two evolutionary algorithms for clustering in the domain of directed weighted graphs are proposed. Several genetic operators are analyzed with respect to maintaining the balance between exploration and exploitation properties. The approach is extensively tested on medium-sized random graphs.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Gaertler, M.: Clustering. In: Brandes, U., Erlebach, T. (eds.) Network Analysis. LNCS, vol. 3418, pp. 178–215. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  2. Dias, C.R., Ochi, L.S.: Efficient evolutionary algorithms for the clustering problems in directed graphs. In: Proc. of the IEEE Congress on Evolutionary Computation, pp. 983–988. IEEE Computer Press (2003)

    Google Scholar 

  3. Brandes, U., Gaertler, M., Wagner, D.: Experiments on Graph Clustering Algorithms. In: Di Battista, G., Zwick, U. (eds.) ESA 2003. LNCS, vol. 2832, pp. 568–579. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  4. Hruschka, E., Campello, R., Freitas, A., de Carvalho, A.: A survey of evolutionary algorithms for clustering. IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews (2009)

    Google Scholar 

  5. Kohout, J., Neruda, R.: Two genetic graph clustering algoritms. Technical Report V-1161, Institute of Computer Science, Academy of Sciences of the Czech Republic (2012)

    Google Scholar 

  6. Kohout, J.: Graph clusterizer web page (2012), http://sourceforge.net/projects/gclusterizer/

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kohout, J., Neruda, R. (2012). Exploration and Exploitation Operators for Genetic Graph Clustering Algorithm. In: Chen, L., Felfernig, A., Liu, J., Raś, Z.W. (eds) Foundations of Intelligent Systems. ISMIS 2012. Lecture Notes in Computer Science(), vol 7661. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-34624-8_10

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-34624-8_10

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-34623-1

  • Online ISBN: 978-3-642-34624-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics