Skip to main content

On Perturbation Measure of Clusters: Application

  • Conference paper
Artificial Intelligence and Soft Computing (ICAISC 2013)

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

Included in the following conference series:

Abstract

In this paper we developed a new methodology for grouping objects described by nominal attributes. We introduced a measure of perturbation of one cluster by another cluster in order to create a junction of clusters. The developed method is hierarchical and agglomerative and can be characterized both by high speed of computation as well as surprising good accuracy of clustering. keywords cluster analysis, nominal attributes, sets theory.

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. Apostolico, R., Bock, M.E., Lonardi, S.: Monotony of surprise in large-scale quest for unusual words. In: Proceedings of the 6th International Conference on Research in Computational Molecular Biology, Washington, DC, April 18-21, pp. 22–31 (2002)

    Google Scholar 

  2. Gionis, A., Mannila, H.: Finding recurrent sources in sequences. In: Proceedings of the 7th International Conference on Research in Principles of Database Systems, Tucson, AZ, May 12-14, pp. 249–256 (2003)

    Google Scholar 

  3. Johnson, S.C.: Hierarchical Clustering Schemes. Psychometrika 2, 241–254 (1967)

    Article  Google Scholar 

  4. Krawczak, M., Szkatuła, G.: On time series envelopes for classification problem. In: Developments of Fuzzy Sets, Intuitionistic Fuzzy Sets, Generalized Nets, vol. II (2010)

    Google Scholar 

  5. Krawczak, M.: Szkatuła G, Time series envelopes for classification. In: Proceedings of the Conference: IEEE International Conference on Intelligent Systems, London, UK, July 7-9, pp. 156–161 (2010)

    Google Scholar 

  6. Krawczak, M., Szkatuła, G.: A hybrid approach to dimension reduction in classification. Control and Cybernetics 1(2), 527–551 (2011)

    Google Scholar 

  7. Lin, J., Keogh, E., Wei, L., Lonardi, S.: Experiencing SAX: a Novel Symbolic Representation of Time Series. Data Min Knowledge Disc 2(15), 107–144 (2007)

    Article  MathSciNet  Google Scholar 

  8. Wang, B.: A New Clustering Algorithm on Nominal Data Sets. In: Proceedings of International MultiConference of Engineers and Computer Scientists 2010 IMECS 2010, Hong Kong, March 17-19 (2010)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Krawczak, M., Szkatuła, G. (2013). On Perturbation Measure of Clusters: Application. In: Rutkowski, L., Korytkowski, M., Scherer, R., Tadeusiewicz, R., Zadeh, L.A., Zurada, J.M. (eds) Artificial Intelligence and Soft Computing. ICAISC 2013. Lecture Notes in Computer Science(), vol 7895. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38610-7_17

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-38610-7_17

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-642-38610-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics