MultiDendrograms: Variable-Group Agglomerative Hierarchical Clusterings
From MaRDI portal
Publication:6230129
arXiv1201.1623MaRDI QIDQ6230129FDOQ6230129
Authors: Sergio Gomez, Justo Montiel, David Torres, Alberto Fernandez 
Publication date: 8 January 2012
Abstract: MultiDendrograms is a Java-written application that computes agglomerative hierarchical clusterings of data. Starting from a distances (or weights) matrix, MultiDendrograms is able to calculate its dendrograms using the most common agglomerative hierarchical clustering methods. The application implements a variable-group algorithm that solves the non-uniqueness problem found in the standard pair-group algorithm. This problem arises when two or more minimum distances between different clusters are equal during the agglomerative process, because then different output clusterings are possible depending on the criterion used to break ties between distances. MultiDendrograms solves this problem implementing a variable-group algorithm that groups more than two clusters at the same time when ties occur.
Has companion code repository: https://github.com/sergio-gomez/MultiDendrograms
This page was built for publication: MultiDendrograms: Variable-Group Agglomerative Hierarchical Clusterings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6230129)
