AuToMATo: A Parameter-Free Persistence-Based Clustering Algorithm
<|reference_start|>AuToMATo: A Parameter-Free Persistence-Based Clustering Algorithm: We present AuToMATo, a novel parameter-free clustering algorithm based on persistent homology. AuToMATo combines the existing ToMATo clustering algorithm with a bootstrapping procedure in order to separate significant peaks of an estimated density function from non-significant ones. We perform a thorough comparison of AuToMATo against many other state-of-the-art clustering algorithms. We find that not only that AuToMATo compares favorably against other parameter-free clustering algorithms, but in many instances also significantly outperforms even the best selection of parameters for other algorithms. AuToMATo is motivated by applications in topological data analysis, in particular the Mapper algorithm, where it is desirable to work with a parameter-free clustering algorithm. Indeed, we provide evidence that AuToMATo performs well when used with Mapper. Finally, we provide an open-source implementation of AuToMATo in Python that is fully compatible with the standardscikit-learn architecture.<|reference_end|>
@article{huber2024automato:,
    title={AuToMATo: An Out-Of-The-Box Persistence-Based Clustering Algorithm},
    author={Marius Huber, Sara Kalisnik and Patrick Schnider},
    journal={arXiv preprint arXiv:2408.06958},
    year={2024},
    archivePrefix={arXiv},
    eprint={2408.06958},
    primaryClass={cs.LG stat.ML}
}