arXiv · 0801.0748
Hausdorff clustering
Abstract
A clustering algorithm based on the Hausdorff distance is introduced and compared to the single and complete linkage. The three clustering procedures are applied to a toy example and to the time series of financial data. The dendrograms are scrutinized and their features confronted. The Hausdorff linkage relies of firm mathematical grounds and turns out to be very effective when one has to discriminate among complex structures.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
N. Basalto, R. Bellotti, F. De Carlo, P. Facchi, E. Pantaleo, S. Pascazio. 2008-01-07. Hausdorff clustering. https://doi.org/10.1103/physreve.78.046112
Cite the original work for its findings. Save a collection to share your selection of sources.