Fuzzy c-Means Clustering for Persistence Diagrams
arXiv:2006.02796
Abstract
Persistence diagrams concisely represent the topology of a point cloud whilst having strong theoretical guarantees, but the question of how to best integrate this information into machine learning workflows remains open. In this paper we extend the ubiquitous Fuzzy c-Means (FCM) clustering algorithm to the space of persistence diagrams, enabling unsupervised learning that automatically captures the topological structure of data without the topological prior knowledge or additional processing of persistence diagrams that many other techniques require. We give theoretical convergence guarantees that correspond to the Euclidean case, and empirically demonstrate the capability of our algorithm to capture topological information via the fuzzy RAND index. We end with experiments on two datasets that utilise both the topological and fuzzy nature of our algorithm: pre-trained model selection in machine learning and lattices structures from materials science. As pre-trained models can perform well on multiple tasks, selecting the best model is a naturally fuzzy problem; we show that fuzzy clustering persistence diagrams allows for model selection using the topology of decision boundaries. In materials science, we classify transformed lattice structure datasets for the first time, whilst the probabilistic membership values let us rank candidate lattices in a scenario where further investigation requires expensive laboratory time and expertise.
arXiv commentVersion 4
References in corpus (17)
- Fashion-MNIST: a Novel Image Dataset for Benchmarking Machine Learning Algorithms
- Statistical topological data analysis using persistence landscapes
- Fast Computation of Wasserstein Barycenters
- A Topological Loss Function for Deep-Learning based Image Segmentation using Persistent Homology
- Electronic and optical properties of novel carbon allotropes
- Deep Learning with Topological Signatures
- Sliced Wasserstein Kernel for Persistence Diagrams
- Topology-Preserving Deep Image Segmentation
- End to end learning and optimization on graphs
- Neural Persistence: A Complexity Measure for Deep Neural Networks Using Algebraic Topology
- On Characterizing the Capacity of Neural Networks using Algebraic Topology
- Persistence Fisher Kernel: A Riemannian Manifold Kernel for Persistence Diagrams
- A Topology Layer for Machine Learning
- Progressive Wasserstein Barycenters of Persistence Diagrams
- Topological Machine Learning with Persistence Indicator Functions
- Embeddings of Persistence Diagrams into Hilbert Spaces
- On the Metric Distortion of Embedding Persistence Diagrams into separable Hilbert spaces