MultiDendrograms: Variable-Group Agglomerative Hierarchical Clustering

Details MultiDendrograms: Variable-Group Agglomerative Hierarchical Clustering MultiDendrograms: Variable-Group Agglomerative Hierarchical Clustering

2012-01-08

arxiv.org/abs/1201.1623v1

Computer Science

Information Retrieval

MultiDendrograms software available at http://deim.urv.cat/~sgomez/multidendrograms.php

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

MultiDendrograms: Variable-Group Agglomerative Hierarchical Clustering does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with MultiDendrograms: Variable-Group Agglomerative Hierarchical Clustering, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and MultiDendrograms: Variable-Group Agglomerative Hierarchical Clustering will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-290