Skip to main content

Comparing Modifcation Operators Used in Clustering Algorithm Based on a Sequence of Discriminant Rules

  • Conference paper
Computer Recognition Systems

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

  • 1499 Accesses

Abstract

Clustering as a data exploration technique is very widely applied. It is based on clustering algorithms whose usefulness depends strictly on the form and style of the incoming data. The following article comparing operator in evolutionary algorithms used to clustering of symbolic data. Clustering methods is based on list of decision rules.

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. C. L. Blake and C. J. Merz. UCI repository of machine learning databases, 1998

    Google Scholar 

  2. P. Cichosz. Systemy uczace sie. WNT, Warszawa, 2000

    Google Scholar 

  3. P. Clark and T. Niblett. The CN2 induction algorithm. Machine Learning, 3:261–283, 1989

    Google Scholar 

  4. R. O. Duda and P. E. Hart. Pattern Classification and Scene Analysis. Wiley, New York, 1973

    MATH  Google Scholar 

  5. D. Fisher. Iterative optimization and simpliFIcation of hierarchical clusterings. Journal of Artificial Intelligence Research, 4:147–180, 1996

    MATH  Google Scholar 

  6. D. Mazur. Clustering algorithm based on a sequence of discriminant rules. In T. Burczyński, W. Cholewa, and W. Moczulski, editors, Methods of Artificial Intelligence, Gliwice, 2003. AI-METH Series.

    Google Scholar 

  7. D. Mazur. Clustering based on genetics algorithm. In T. Burczyński, W. Cholewa, and W. Moczulski, editors, Methods of Artificial Intelligence, Gliwice, 2004. AI-METH Series

    Google Scholar 

  8. R. T. Ng and J. Han. Effcient and effective clustering methods for spatial data mining. In J. Bocca, M. Jarke, and C. Zaniolo, editors, 20th International Conference on Very Large Data Bases, pages 144–155, Los Altos, USA, 1994. Morgan Kaufmann Publishers

    Google Scholar 

  9. M. Perkowitz and O. Etzioni. Towards adaptive Web sites: conceptual framework and case study. Computer Networks (Amsterdam, Netherlands: 1999), 31(11–16):1245–1258, 1999

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Mazur, D. (2005). Comparing Modifcation Operators Used in Clustering Algorithm Based on a Sequence of Discriminant Rules. In: Kurzyński, M., Puchała, E., Woźniak, M., żołnierek, A. (eds) Computer Recognition Systems. Advances in Soft Computing, vol 30. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-32390-2_29

Download citation

  • DOI: https://doi.org/10.1007/3-540-32390-2_29

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-25054-8

  • Online ISBN: 978-3-540-32390-7

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics