A hierarchical clustering algorithm based on the Hungarian method

Authors:
Jacob Goldberger;Tamir Tassa
Affiliations:
School of Engineering, Bar-Ilan University, 52900 Ramat-Gan, Israel;Division of Computer Science, The Open University, 43107 Ra'anana, Israel
Venue:
Pattern Recognition Letters
Year:
2008

Citing 6
Cited 3

Normalized Cuts and Image Segmentation

IEEE Transactions on Pattern Analysis and Machine Intelligence
Pairwise Data Clustering by Deterministic Annealing

IEEE Transactions on Pattern Analysis and Machine Intelligence
Path-Based Clustering for Grouping of Smooth Curves and Texture Segmentation

IEEE Transactions on Pattern Analysis and Machine Intelligence
Take a walk and cluster genes: a TSP-based approach to optimal rearrangement clustering

ICML '04 Proceedings of the twenty-first international conference on Machine learning
Generating summaries and visualization for large collections of geo-referenced photographs

MIR '06 Proceedings of the 8th ACM international workshop on Multimedia information retrieval
Survey of clustering algorithms

IEEE Transactions on Neural Networks

SEP/COP: An efficient method to find the best partition in hierarchical clustering based on a new cluster validity index

Pattern Recognition
Research and applications on georeferenced multimedia: a survey

Multimedia Tools and Applications
Hierarchical clustering through bayesian inference

ICCCI'12 Proceedings of the 4th international conference on Computational Collective Intelligence: technologies and applications - Volume Part I

Quantified Score

Hi-index	0.10

Visualization

Abstract

We propose a novel hierarchical clustering algorithm for data-sets in which only pairwise distances between the points are provided. The classical Hungarian method is an efficient algorithm for solving the problem of minimal-weight cycle cover. We utilize the Hungarian method as the basic building block of our clustering algorithm. The disjoint cycles, produced by the Hungarian method, are viewed as a partition of the data-set. The clustering algorithm is formed by hierarchical merging. The proposed algorithm can handle data that is arranged in non-convex sets. The number of the clusters is automatically found as part of the clustering process. We report an improved performance of our algorithm in a variety of examples and compare it to the spectral clustering algorithm.