Hausdorff clustering
- 28 October 2008
- journal article
- research article
- Published by American Physical Society (APS) in Physical Review E
- Vol. 78 (4), 046112
- https://doi.org/10.1103/physreve.78.046112
Abstract
A clustering algorithm based on the Hausdorff distance is analyzed and compared to the single, complete, and average linkage algorithms. The four clustering procedures are applied to a toy example and to the time series of financial data. The dendrograms are scrutinized and their features compared. The Hausdorff linkage relies on firm mathematical grounds and turns out to be very effective when one has to discriminate among complex structures.Keywords
This publication has 24 references indexed in Scilit:
- Interaction ruling animal collective behavior depends on topological rather than metric distance: Evidence from a field studyProceedings of the National Academy of Sciences of the United States of America, 2008
- Hausdorff clustering of financial time seriesPhysica A: Statistical Mechanics and its Applications, 2007
- Cluster validation techniques for genome expression dataSignal Processing, 2003
- Data clusteringACM Computing Surveys, 1999
- Data Clustering Using a Model Granular MagnetNeural Computation, 1997
- Pairwise data clustering by deterministic annealingIeee Transactions On Pattern Analysis and Machine Intelligence, 1997
- Comparing images using the Hausdorff distanceIeee Transactions On Pattern Analysis and Machine Intelligence, 1993
- Clustering, coding, switching, hierarchical ordering, and control in a network of chaotic elementsPhysica D: Nonlinear Phenomena, 1990
- Chaotic but regular posi-nega switch among coded attractors by cluster-size variationPhysical Review Letters, 1989
- Ultrametricity for physicistsReviews of Modern Physics, 1986