Skip to main content

Refinement Properties in Agglomerative Hierarchical Clustering

  • Conference paper
  • 860 Accesses

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

Abstract

Refinement properties that means each cluster of a method is included in another cluster of another method in agglomerative clustering which was proposed by Miyamoto are further studied. Although we have simple conditions so that a method generates refinements of clusters of the single linkage method, whether or not generalizations hold when the single linkage is not used is unknown. Here three conditions for refinement properties for the single linkage are shown, while three counterexamples are shown for the average linkage and the complete linkage, which show the theory of refinements is far from trivial and future works are needed.

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. Anderberg, M.R.: Cluster Analysis for Applications. Academic Press, New York (1973)

    MATH  Google Scholar 

  2. Everitt, B.S.: Cluster Analysis, 3rd edn. Arnold, London (1993)

    Google Scholar 

  3. Miyamoto, S.: Fuzzy Sets in Information Retrieval and Cluster Analysis. Kluwer, Dordrecht (1990)

    MATH  Google Scholar 

  4. Miyamoto, S.: Introduction to Cluster Analysis: Theory and Applications of Fuzzy Clustering, Morikita-Shuppan, Tokyo (1990) (in Japanese)

    Google Scholar 

  5. Miyamoto, S.: Data Clustering Algorithms for Information Systems. In: An, A., Stefanowski, J., Ramanna, S., Butz, C.J., Pedrycz, W., Wang, G. (eds.) RSFDGrC 2007. LNCS (LNAI), vol. 4482, pp. 13–24. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  6. Pawlak, Z.: Rough Sets: Theoretical Aspects of Reasoning about Data. Kluwer, Dordrecht (1991)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Miyamoto, S. (2009). Refinement Properties in Agglomerative Hierarchical Clustering. In: Torra, V., Narukawa, Y., Inuiguchi, M. (eds) Modeling Decisions for Artificial Intelligence. MDAI 2009. Lecture Notes in Computer Science(), vol 5861. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04820-3_24

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-04820-3_24

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-04819-7

  • Online ISBN: 978-3-642-04820-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics