Robust anisotropic power-functions-based filtrations for clustering
Abstract
We consider robust power-distance functions that approximate the distance function to a compact set, from a noisy sample. We pay particular interest to robust power-distance functions that are anisotropic, in the sense that their sublevel sets are unions of ellipsoids, and not necessarily unions of balls. Using persistence homology on such power-distance functions provides robust clustering schemes. We investigate such clustering schemes and compare the different procedures on synthetic and real datasets. In particular, we enhance the good performance of the anisotropic method for some cases for which classical methods fail.
Fichier principal
robust_hierarchical_clustering_version_longue (1).pdf (1.19 Mo)
Télécharger le fichier
Material_for_numerical_illustrations_R_software.zip (129.45 Ko)
Télécharger le fichier
Origin : Files produced by the author(s)
Format : Other
Comment : Implementation of the algorithm. Sources for the experiments. (with the R software
Comment : Implementation of the algorithm. Sources for the experiments. (with the R software
Loading...