Abstract
In this paper a new hierarchical clustering technique is presented. This approach is similar to two popular hierarchical clustering algorithms, i.e. single-link and complete-link. These hierarchical methods play an important role in clustering data and allow to create well-separable clusters, whenever the clusters exist. The proposed method has been used to clustering artificial and real data sets. Obtained results confirm very good performances of the method. © 2012 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Starczewski, A. (2012). A new hierarchical clustering algorithm. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7268 LNAI, pp. 175–180). Springer Verlag. https://doi.org/10.1007/978-3-642-29350-4_21
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
