Corpus ID: 231846381

Classification based on Topological Data Analysis

@article{Kindelan2021ClassificationBO,
  title={Classification based on Topological Data Analysis},
  author={Rolando Kindelan and Jos{\'e} Fr{\'i}as and Mauricio Cerda and Nancy Hitschfeld-Kahler},
  journal={ArXiv},
  year={2021},
  volume={abs/2102.03709}
}
Topological Data Analysis (TDA) is an emergent field that aims to discover topological information hidden in a dataset. TDA tools have been commonly used to create filters and topological descriptors to improve Machine Learning (ML) methods. This paper proposes an algorithm that applies TDA directly to multi-class classification problems, even imbalanced datasets, without any further ML stage. The proposed algorithm built a filtered simplicial complex on the dataset. Persistent homology is then… Expand
A Topological Data Analysis Based Classifier
TLDR
This paper proposes an algorithm that applies TDA directly to multi-class classification problems, without any further ML stage, showing advantages for imbalanced datasets. Expand

References

SHOWING 1-10 OF 42 REFERENCES
Preliminary results on classification based on Topological Data Analysis[(1)](Submitted to 36th SoCG-Zürich, Switzerland-June 23-26, 2020)
1 In recent years, algebraic topology techniques have been applied to data analysis, giving rise to an 2 emerging research field called Topological Data Analysis (TDA). TDA tools are useful forExpand
Deep Learning with Topological Signatures
TLDR
This work proposes a technique that enables us to input topological signatures to deep neural networks and learn a task-optimal representation during training, realized as a novel input layer with favorable theoretical properties. Expand
A topological data analysis based classification method for multiple measurements
TLDR
This algorithm and software can be beneficial for repeated measurement data common in biological sciences, as both an accurate classifier and a feature selection tool. Expand
On Time-Series Topological Data Analysis: New Data and Opportunities
TLDR
This work considers stability with respect to time series length, the approximation accuracy of sparse filtration methods, and the discriminating ability of persistence diagrams as a feature for learning in the end-toend TDA processing pipeline for persistent homology applied to time-delay embeddings of time series. Expand
Clustering and classification of time series using topological data analysis with applications to finance
TLDR
RF-TDA is seen to perform quite well in the two experiments based on real-life stock-price data, which implies that the topological features of the time series of stock prices in the different sectors are not identical and have distinctive features that can be discerned through the use of TDA. Expand
A Topology Layer for Machine Learning
TLDR
A differentiable topology layer that computes persistent homology based on level set Filtrations and distance-bases filtrations is presented that can serve as a regularizer directly on data or the weights of machine learning models. Expand
Model Selection for Simplicial Approximation
TLDR
In this article, an adequate statistical framework is first proposed for the choice of a simplicial complex among a parametrized family, and a least-squares penalized criterion is introduced to choose a complex. Expand
A roadmap for the computation of persistent homology
TLDR
A friendly introduction to PH is given, the pipeline for the computation of PH is navigated with an eye towards applications, and a range of synthetic and real-world data sets are used to evaluate currently available open-source implementations for the computations of PH. Expand
Barcodes: The persistent topology of data
This article surveys recent work of Carlsson and collaborators on applications of computational algebraic topology to problems of feature detection and shape recognition in high-dimensional data. TheExpand
The Compressed Annotation Matrix: An Efficient Data Structure for Computing Persistent Cohomology
TLDR
An implementation of a recently introduced algorithm for persistent cohomology that attaches annotation vectors with the simplices and introduces a new data structure for maintaining the annotation matrix, which is more compact and reduces substantially the amount of matrix operations. Expand
...
1
2
3
4
5
...