Skip to main content

An Evolutionary Clustering Algorithm

  • Conference paper
Artificial Intelligence and Soft Computing - ICAISC 2004 (ICAISC 2004)

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

Included in the following conference series:

  • 1314 Accesses

Abstract

There are many heuristic algorithms for clustering, from which the most important are the hierarchical methods of agglomeration, especially the Ward’s method. Among the iterative methods the most universally used is the C–means method and it’s generalizations. These methods have many advantages, but they are more or less dependent on the distribution of points in space and the shape of clusters. In this paper the problem of clustering is treated as a problem of optimization of a certain quality index. For that problem the author proposes two solutions: a hierarchical partitioning algorithm and an evolutionary algorithm.

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

Access this chapter

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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Arabas, J.: Lectures of evolutionary algorithms (in polish), WNT Warszawa (2001)

    Google Scholar 

  2. Bezdek, J.C.: Pattern Recognition with Fuzzy Objective Function Algorithms. Plenum Press, New York (1981)

    MATH  Google Scholar 

  3. Groenen, P.J.F., Jajuga, K.: Fuzzy clastering with squared Minkowski distances. Fuzzy Sets and Systems 120, 227–237 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  4. Jajuga, K.: Multivariate statistical analysis (in polish), PWN Warszawa (1993)

    Google Scholar 

  5. Piegat, A.: Fuzzy modeling and control. Springer, Heidelberg (2001)

    MATH  Google Scholar 

  6. Prim, R.C.: Shortest connection networks and some generalizations. Bell System Technical Journal 36, 1389–1401 (1957)

    Google Scholar 

  7. Sedgewick, R.: Algorithms. Addison-Weseley Co., London (1983)

    MATH  Google Scholar 

  8. Sneath, P., Sokal, R.R.: Numerical Taxonomy. W. Freeman & Co., San Fracisco (1973)

    MATH  Google Scholar 

  9. Ward, J.H.: Hierarchical grouping to optimize an objective function. Journal of the American Statistical Association 58, 236–244 (1963)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Korzeń, M. (2004). An Evolutionary Clustering Algorithm. In: Rutkowski, L., Siekmann, J.H., Tadeusiewicz, R., Zadeh, L.A. (eds) Artificial Intelligence and Soft Computing - ICAISC 2004. ICAISC 2004. Lecture Notes in Computer Science(), vol 3070. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24844-6_62

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-24844-6_62

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-22123-4

  • Online ISBN: 978-3-540-24844-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics