Solving non-uniqueness in agglomerative hierarchical clustering using multidendrograms

From MaRDI portal
Publication:734362

DOI10.1007/S00357-008-9004-XzbMATH Open1260.62042arXivcs/0608049OpenAlexW2051779798WikidataQ55934586 ScholiaQ55934586MaRDI QIDQ734362FDOQ734362


Authors: Alberto Fernández, Sergio Gomez Edit this on Wikidata


Publication date: 13 October 2009

Published in: Journal of Classification (Search for Journal in Brave)

Abstract: In agglomerative hierarchical clustering, pair-group methods suffer from a problem of non-uniqueness when two or more distances between different clusters coincide during the amalgamation process. The traditional approach for solving this drawback has been to take any arbitrary criterion in order to break ties between distances, which results in different hierarchical classifications depending on the criterion followed. In this article we propose a variable-group algorithm that consists in grouping more than two clusters at the same time when ties occur. We give a tree representation for the results of the algorithm, which we call a multidendrogram, as well as a generalization of the Lance and Williams' formula which enables the implementation of the algorithm in a recursive way.


Full work available at URL: https://arxiv.org/abs/cs/0608049




Recommendations




Cites Work


Cited In (8)





This page was built for publication: Solving non-uniqueness in agglomerative hierarchical clustering using multidendrograms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q734362)