The DOI matches its Crossref record; 6 of the 6 references it cites were found in a registry or an index.
A Survey of Topological Machine Learning Methods
Open accessAbstract
The last decade saw an enormous boost in the field of computational topology: methods and concepts from algebraic and differential topology, formerly confined to the realm of pure mathematics, have demonstrated their utility in numerous areas such as computational biology personalised medicine, and time-dependent data analysis, to name a few. The newly-emerging domain comprising topology-based techniques is often referred to as topological data analysis (TDA). Next to their applications in the aforementioned areas, TDA methods have also proven to be effective in supporting, enhancing, and augmenting both classical machine learning and deep learning models. In this paper, we review the state of the art of a nascent field we refer to as “topological machine learning,” i.e., the successful symbiosis of topology-based methods and machine learning algorithms, such as deep neural networks. We identify common threads, current applications, and future challenges.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Detecting strange attractors in turbulence
Takens, F. (1981) · Lecture Notes in Mathematics · doi:10.1007/bfb0091924 · Cited by 10,459 · cited 1×
“The method is based on the fundamental embedding theorem by Takens (1981) and is combined with a sliding window approach.”
MethodFrom time series to complex networks: the visibility graph
Lacasa, L., Luque, B., Ballesteros, F., Luque, J., & Nuño, J. C. (2008) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0709247105 · Cited by 1,826
Zomorodian, A., & Carlsson, G. (2005) · Discrete & Computational Geometry · doi:10.1007/s00454-004-1146-y · Cited by 1,591
Stability of Persistence Diagrams
Cohen-Steiner, D., Edelsbrunner, H., & Harer, J. (2007) · Discrete & Computational Geometry · doi:10.1007/s00454-006-1276-5 · Cited by 1,280
Testing the manifold hypothesis
Fefferman, C., Mitter, S., & Narayanan, H. (2016) · Journal of the American Mathematical Society · doi:10.1090/jams/852 · Cited by 430 · cited 2×
“The topological evaluation of GANs is motivated by the manifold hypothesis (Fefferman et al., 2013), which poses that a data distribution P data is sampled from an underlying manifold M data .”
BackgroundLipschitz Functions Have L p -Stable Persistence
Cohen-Steiner, D., Edelsbrunner, H., Harer, J., & Mileyko, Y. (2010) · Foundations of Computational Mathematics · doi:10.1007/s10208-010-9060-6 · Cited by 284
Cited by
An Introduction to Topological Data Analysis: Fundamental and Practical Aspects for Data Scientists
Chazal, F., & Michel, B. (2021) · Frontiers in Artificial Intelligence · doi:10.3389/frai.2021.667963 · Cited by 581
Topological Graph Neural Networks
Horn, M., De Brouwer, E., Moor, M., Moreau, Y., Rieck, B., & Borgwardt, K. (2021) · arXiv · doi:10.48550/arxiv.2102.07835 · Cited by 31
Self-citation
Metadata
- Authors
- Hensel, F., Moor, M., & Rieck, B.
- Venue
- Frontiers in Artificial Intelligence
- Publisher
- Frontiers Media SA
- Published
- 2021-05-26
- Volume
- 4
- Pages
- 681108-681108
- ISSN
- 2624-8212 (ISSN-L)
- OpenAlex
- W3165474212
- Cited by
- 207
- References
- 6
- FWCI
- 15.00
- Type
- journal article
- Language
- en
- Open access
- gold
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: A Survey of Topological Machine Learning Methods. https://app.cochat.ai/papers/10.3389/frai.2021.681108
- The paper
- Hensel, F., Moor, M., & Rieck, B. (2021). A Survey of Topological Machine Learning Methods. Frontiers in Artificial Intelligence. https://doi.org/10.3389/frai.2021.681108
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.