Efficient persistence landscape generation
Journal of Algorithms & Computational Technology · 2025-07 · 19
DOI: 10.1177/17483026251347091 ↗Kurz gefasst
Fachartikel in der Zeitschrift Journal of Algorithms & Computational Technology, online erschienen am 08.06.2025. Verfasst von Taylor Henderson und 1 weiteren Autor:innen. Die Arbeit wurde bisher 2-mal zitiert (Crossref) und nennt 28 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY-NC 4.0).
Abstract (Originalsprache)
Using topological summary tools such as persistence landscapes have greatly enhanced the practical usage of topological data analysis to analyze large-scale, noisy, and complex datasets. A central element of persistence landscape usage involves computing the top- k landscapes. This article presents a novel output-sensitive plane sweep algorithm for computing the top- k persistence landscapes in optimal time and space: significantly outperforming previous algorithms. Our algorithm can determine in optimal O ( n * log ( n ) ) if a given birth-death pair appears in the top- k landscapes. The runtime performance of the approach on a botnet dataset and several synthetically generated point cloud topologies, showing that the algorithm can achieve significant speedups for these datasets due to its better algorithmic design. The speedups seen range from slightly worse (in some extreme examples) to equal compared to previous works while returning exactly the same output and is significantly faster when filtering is used (15x for birth-death pairs when removing 75% of birth-death pairs). Filtering is shown to maintain machine learning performance on both synthetically generated and real world datasets while providing orders of magnitude speedup depending on how intensive of filtering is done. Due to the introduced algorithm’s algorithmic design, the speedup seen is greater when filtering using the introduced birth-death filtering algorithm. The software is freely provided in Rust with Python bindings online.
Zitieren
APA
Henderson, T., & Simon, R. (2025). Efficient persistence landscape generation. Journal of Algorithms & Computational Technology, 19. https://doi.org/10.1177/17483026251347091
Vancouver
Henderson T, Simon R. Efficient persistence landscape generation. Journal of Algorithms & Computational Technology. 2025;19. doi:10.1177/17483026251347091
BibTeX
@article{Henderson2025,
author = {Henderson, Taylor and Simon, Robert},
title = {Efficient persistence landscape generation},
journal = {Journal of Algorithms & Computational Technology},
year = {2025},
volume = {19},
doi = {10.1177/17483026251347091}
}
EUVIMED