The DOI matches its Crossref record; 14 of the 14 references it cites were found in a registry or an index.
A persistence landscapes toolbox for topological statistics
Open accessAbstract
Topological data analysis provides a multiscale description of the geometry and topology of quantitative data. The persistence landscape is a topological summary that can be easily combined with tools from statistics and machine learning. We give efficient algorithms for calculating persistence landscapes, their averages, and distances between such averages. We discuss an implementation of these algorithms and some related procedures. These are intended to facilitate the combination of statistics and machine learning with topological data analysis. We present an experiment showing that the low-dimensional persistence landscapes of points sampled from spheres (and boxes) of varying dimensions differ.
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
Cortes, C., & Vapnik, V. (1995) · Machine Learning · doi:10.1007/bf00994018 · Cited by 59,421
Carlsson, G. (2009) · Bulletin of the American Mathematical Society · doi:10.1090/s0273-0979-09-01249-x · Cited by 2,302 · cited 1×
“We are motivated by topological data analysis [30, 8].”
MethodTopological Persistence and Simplification
Edelsbrunner, Letscher, & Zomorodian (2002) · Discrete & Computational Geometry · doi:10.1007/s00454-002-2885-2 · Cited by 1,779
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
Barcodes: the persistent topology of data
Ghrist, R. (2007) · Bulletin of the American Mathematical Society · doi:10.1090/s0273-0979-07-01191-3 · Cited by 1,236
All of Statistics: A Concise Course in Statistical Inference
Wasserman, L. (2004) · Springer Texts in Statistics · doi:10.1007/978-0-387-21736-9 · Cited by 1,090
On the Local Behavior of Spaces of Natural Images
Carlsson, G., Ishkhanov, T., de Silva, V., & Zomorodian, A. (2008) · International Journal of Computer Vision · doi:10.1007/s11263-007-0056-x · Cited by 477
Coverage in sensor networks via persistent homology
de Silva, V., & Ghrist, R. (2007) · Algebraic & Geometric Topology · doi:10.2140/agt.2007.7.339 · Cited by 422
Sliding Windows and Persistence: An Application of Topological Methods to Signal Analysis
Perea, J. A., & Harer, J. (2015) · Foundations of Computational Mathematics · doi:10.1007/s10208-014-9206-z · Cited by 306 · cited 1×
“Successful applications of topological data analysis include breast cancer data [39], sensor networks [20], orthodontic data [29], signal analysis [41], target tracking [4], and brain artery data [5].”
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
Probability measures on the space of persistence diagrams
Mileyko, Y., Mukherjee, S., & Harer, J. (2011) · Inverse Problems · doi:10.1088/0266-5611/27/12/124007 · Cited by 249 · cited 1×
“Notable progress has been made in this direction [10, 11, 12], however there still do not exist effective algorithms for computing means for a wide variety of examples.”
BackgroundFréchet Means for Distributions of Persistence Diagrams
Turner, K., Mileyko, Y., Mukherjee, S., & Harer, J. (2014) · Discrete & Computational Geometry · doi:10.1007/s00454-014-9604-7 · Cited by 207 · cited 1×
“te and separable, and thus provides a suitable setting for probability and statistics. Unfortunately the Frechet mean is not necessarily unique. For a slightly adjusted metric, there is an algorithm [37] that converges to an element of the Frechet mean set, though it does not have good computational properties. The di…”
MethodUsing persistent homology and dynamical distances to analyze protein binding
Kovacev-Nikolic, V., Bubenik, P., Nikolić, D., & Heo, G. (2016) · Statistical Applications in Genetics and Molecular Biology · doi:10.1515/sagmb-2015-0057 · Cited by 116
Self-citation
Cited by
A roadmap for the computation of persistent homology
Otter, N., Porter, M. A., Tillmann, U., Grindrod, P., & Harrington, H. A. (2017) · EPJ Data Science · doi:10.1140/epjds/s13688-017-0109-5 · Cited by 760
Topological data analysis of financial time series: Landscapes of crashes
Gidea, M., & Katz, Y. (2018) · Physica A: Statistical Mechanics and its Applications · doi:10.1016/j.physa.2017.09.028 · Cited by 263
Objective Morphological Classification of Neocortical Pyramidal Cells
Kanari, L., Ramaswamy, S., Shi, Y., Morand, S., Meystre, J., Perin, R., Abdellah, M., Wang, Y., Hess, K., & Markram, H. (2019) · Cerebral Cortex · doi:10.1093/cercor/bhy339 · Cited by 94
Metadata
- Authors
- Bubenik, P., & Dłotko, P.
- Venue
- Journal of Symbolic Computation
- Publisher
- Elsevier BV
- Published
- 2017-01
- Volume
- 78
- Pages
- 91-114
- ISSN
- 0747-7171 (ISSN-L)
- OpenAlex
- W1957046493
- Cited by
- 166
- References
- 14
- FWCI
- 11.31
- Type
- journal article
- Language
- en
- Open access
- bronze
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
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.