Skip to main content

An Innovative Approach to Genetic Programming—based Clustering

  • Conference paper
Book cover Applied Soft Computing Technologies: The Challenge of Complexity

Part of the book series: Advances in Soft Computing ((AINSC,volume 34))

Abstract

Most of the classical clustering algorithms are strongly dependent on, and sensitive to, parameters such as number of expected clusters and resolution level. To overcome this drawback, a Genetic Programming framework, capable of performing an automatic data clustering, is presented. Moreover, a novel way of representing clusters which provides intelligible information on patterns is introduced together with an innovative clustering process. The effectiveness of the implemented partitioning system is estimated on a medical domain by means of evaluation indices.

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 259.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 329.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. Fayyad U M, Piatetsky-Shapiro G, Smith P (1996) From data mining to knowledge discovery: an overview. In: Fayyad U M et al. (eds) Advances in knowledge discovery and data mining. AAAI/MIT Press, 1–34

    Google Scholar 

  2. Hand D J, Mannila H, Smyth P (1988) Principles of data mining. MIT Press

    Google Scholar 

  3. Han J, Kamber M 2001) Data mining: concepts and techniques. Morgan Kaufmann

    Google Scholar 

  4. Zhang T, Ramakrishnan R, Livny M. (1996) BIRCH: an efficient data clustering method for very large databases. Proceedings of the ACM SIGMOD Int. Conf. on Management of Data, 103–114

    Google Scholar 

  5. Guha S, Rastogi R, Shim K (1998) CURE: an efficient clustering algorithm for large databases. Proceedings of the ACM SIGMOD Int. Conf. on Management of Data, 73–84

    Google Scholar 

  6. Aggarwal C, Yu P S (2000) Finding generalized projected clusters in high dimensional spaces. Proceedings of the ACM SIGMOD Int. Conf. on Management of Data, 70–81

    Google Scholar 

  7. Bock H H (1996) Probability models in partitional cluster analysis. In: Ferligoj A, Kramberger A (eds) Developments in data analysis, 3–25

    Google Scholar 

  8. Fraley C, Raftery A (1998) How many clusters? Which clustering method? Answers via model–based cluster analysis. The Computer Journal 41 (8): 578–588

    Article  MATH  Google Scholar 

  9. Lee C Y, Antonsson E K (2000) Dynamic partitional clustering using evolutionary strategies. Proceedings of the 3rd Asia–Pacific Conference on Simulated Evolution and Learning. IEEE Press, Nagoya, Japan

    Google Scholar 

  10. Jain A K, Murty M N, Flynn P J (1999) Data clustering: a review. ACM Computing Surveys 31 (3): 264–323

    Article  Google Scholar 

  11. Hall L O, Ozyurt B, Bezdek J C (1999) Clustering with a genetically optimized approach. IEEE Trans, on Evolutionary Computation 3(2):103–112

    Article  Google Scholar 

  12. Sarafis I, Zalzala A M S, Trinder P W (2002) A genetic rule–based data clustering toolkit. Proceedings of the IEEE Congress on Evolutionary Computation, 1238–1243. Honolulu, Hawaii, USA

    Google Scholar 

  13. Cristofor D, Simovici D A (2002) An information–theoretical approach to clustering categorical databases using genetic algorithms. Proceedings of the Second SIAM International Conference on Data Mining, 37–46. Washington

    Google Scholar 

  14. Babu G P, Marty M N (1994) Clustering with evolutionary strategies Pattern Recognition 27(2): 321–329

    Google Scholar 

  15. Koza J R (1992) Genetic Programming: on programming computers by means of natural selection and genetics. The MIT Press, Cambridge, MA

    Google Scholar 

  16. Yip A M (2002) A scale dependent data clustering model by direct maximization of homogeneity and separation. Proceedings of the Mathematical challenges in scientific data mining IPAM, 14–18 January, www.ipam.ucla.edu/publications/sdm2002/sdm2002_ayip.pdf

    Google Scholar 

  17. Murphy P M, Aha D W UCI Repository of machine learning databases. University of California, Department of Information and Computer Science, www.ics.uci.edu/~mlearn/MLRepository.html

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer

About this paper

Cite this paper

De Falco, I., Tarantino, E., Cioppa, A., Fontanella, F. (2006). An Innovative Approach to Genetic Programming—based Clustering. In: Abraham, A., de Baets, B., Köppen, M., Nickolay, B. (eds) Applied Soft Computing Technologies: The Challenge of Complexity. Advances in Soft Computing, vol 34. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-31662-0_4

Download citation

  • DOI: https://doi.org/10.1007/3-540-31662-0_4

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-31649-7

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

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics