HackerPapers

arXiv:1207.6437math.AT

Statistical topological data analysis using persistence landscapes

Peter Bubenik

Early discovery. Linked by one identifiable commenter. This paper is outside the main ranking; a mention is not an endorsement.

Abstract

We define a new topological summary for data that we call the persistence landscape. Since this summary lies in a vector space, it is easy to combine with tools from statistics and machine learning, in contrast to the standard topological summaries. Viewed as a random variable with values in a Banach space, this summary obeys a strong law of large numbers and a central limit theorem. We show how a number of standard statistical tests can be used for statistical inference using this summary. We also prove that this summary is stable and that it can be used to provide lower bounds for the bottleneck and Wasserstein distances.

arXiv comments
26 pages, final version, to appear in Journal of Machine Learning Research, includes two additional examples not in the journal version: random geometric complexes and Erdos-Renyi random clique complexes
Journal reference
Journal of Machine Learning Research, 16 (2015), 77-102
DOI
Subjects
math.ATAlgebraic Topology cs.CGComputational Geometry math.MGMetric Geometry math.STStatistics Theory

On Hacker News

Linked by 1 identifiable commenter in 1 comment across 1 thread, from Mar 2013 to Mar 2013.

Comments linking this paper, per year.

Discussed in comments1 thread

    • Very good find, thanks for that. I recall that Peter Bubenik is working on a similar approach. His recent paper about "Persistence landscape" is also quite accessible, in my opinion: http://arxiv.org/abs/1207.6437

      TopolomancerView on HNParent context

Submitted to Hacker News

Connected through shared HN threads, not inferred similarity or a recommendation.