2023
DOI: 10.1080/23746149.2023.2202331
|View full text |Cite
|
Sign up to set email alerts
|

Topological data analysis and machine learning

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
4
0

Year Published

2023
2023
2024
2024

Publication Types

Select...
4
1
1

Relationship

1
5

Authors

Journals

citations
Cited by 7 publications
(4 citation statements)
references
References 109 publications
0
4
0
Order By: Relevance
“…Using TDA, we were able to overcome the limitation of the parameter S d to characterize generated lattices. One can build several metrics to describe persistence diagrams, which can be used as simpler descriptors of the topology of data sets or as inputs of more refined machine learning based models. , In this work, we use two statistical descriptors based on lattices’ persistence diagrams in order to describe both the typical distance between each point of the lattices and their positional disorder. The first numerical descriptor is normalized structural heterogeneity of degree 0 (n SH 0 ) and is the sum of the lifetime of the topological features of homology 0, the connected components, divided by the number of points of the lattice, N : normaln S H 0 = 1 N ( b , d ) H 0 scriptD d b with b and d the birth and death of each topological feature of degree 0, H 0 , of the persistence diagram scriptD .…”
Section: Resultsmentioning
confidence: 99%
“…Using TDA, we were able to overcome the limitation of the parameter S d to characterize generated lattices. One can build several metrics to describe persistence diagrams, which can be used as simpler descriptors of the topology of data sets or as inputs of more refined machine learning based models. , In this work, we use two statistical descriptors based on lattices’ persistence diagrams in order to describe both the typical distance between each point of the lattices and their positional disorder. The first numerical descriptor is normalized structural heterogeneity of degree 0 (n SH 0 ) and is the sum of the lifetime of the topological features of homology 0, the connected components, divided by the number of points of the lattice, N : normaln S H 0 = 1 N ( b , d ) H 0 scriptD d b with b and d the birth and death of each topological feature of degree 0, H 0 , of the persistence diagram scriptD .…”
Section: Resultsmentioning
confidence: 99%
“…As a result, datasets that might be initially hard to describe can have their descriptions condensed into several key features of the latent manifold which allow for easier visualization and effective learning. Within the context of many-body physics, a few recent works have applied dimensionality reduction techniques from machine learning for facilitating ground-state searches and identifying distinct phases of spin models [17][18][19][20][21][22][23].…”
Section: Introductionmentioning
confidence: 99%
“…Topological data analysis (TDA) has witnessed many important advances over the last twenty years that aim to unravel and provide insight to the "shape" of the data (Edelsbrunner et al, 2002;Edelsbrunner and Harer, 2008;Wasserman, 2018;Chazal and Michel, 2021). The development of TDA tools such as barcodes and persistence diagrams (Ghrist, 2008;Bubenik, 2015;Adams et al, 2017) have opened many new perspectives for analyzing various types of data (Umeda, 2017;Gholizadeh and Zadrozny, 2018;Motta, 2018;Xu et al, 2021;Leykam and Angelakis, 2023). These tools enable practitioners to grasp the topological characteristics inherent in high-dimensional data, which often remain beyond the reach of classical data analysis methods.…”
Section: Introductionmentioning
confidence: 99%