Skip to main content
Log in

Asymmetric Agglomerative Hierarchical Clustering Algorithms and Their Evaluations

  • Published:
Journal of Classification Aims and scope Submit manuscript

Abstract

This paper presents asymmetric agglomerative hierarchical clustering algorithms in an extensive view point. First, we develop a new updating formula for these algorithms, proposing a general framework to incorporate many algorithms. Next we propose measures to evaluate the fit of asymmetric clustering results to data. Then we demonstrate numerical examples with real data, using the new updating formula and the indices of fit. Discussing empirical findings, through the demonstrative examples, we show new insights into the asymmetric clustering.

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

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Explore related subjects

Discover the latest articles and news from researchers in related subjects, suggested using machine learning.

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Takeuchi, A., Saito, T. & Yadohisa, H. Asymmetric Agglomerative Hierarchical Clustering Algorithms and Their Evaluations. Journal of Classification 24, 123–143 (2007). https://doi.org/10.1007/s00357-007-0002-1

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00357-007-0002-1

Keywords