Banana Trees for the Persistence in Time Series Experimentally
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866915203893952512 |
|---|---|
| author | Ost, Lara di Montesano, Sebastiano Cultrera Edelsbrunner, Herbert |
| author_facet | Ost, Lara di Montesano, Sebastiano Cultrera Edelsbrunner, Herbert |
| contents | In numerous fields, dynamic time series data require continuous updates, necessitating efficient data processing techniques for accurate analysis. This paper examines the banana tree data structure, specifically designed to efficiently maintain persistent homology -- a multi-scale topological descriptor -- for dynamically changing time series data. We implement this data structure and conduct an experimental study to assess its properties and runtime for update operations. Our findings indicate that banana trees are highly effective with unbiased random data, outperforming state-of-the-art static algorithms in these scenarios. Additionally, our results show that real-world time series share structural properties with unbiased random walks, suggesting potential practical utility for our implementation. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2405_17920 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Banana Trees for the Persistence in Time Series Experimentally Ost, Lara di Montesano, Sebastiano Cultrera Edelsbrunner, Herbert Data Structures and Algorithms In numerous fields, dynamic time series data require continuous updates, necessitating efficient data processing techniques for accurate analysis. This paper examines the banana tree data structure, specifically designed to efficiently maintain persistent homology -- a multi-scale topological descriptor -- for dynamically changing time series data. We implement this data structure and conduct an experimental study to assess its properties and runtime for update operations. Our findings indicate that banana trees are highly effective with unbiased random data, outperforming state-of-the-art static algorithms in these scenarios. Additionally, our results show that real-world time series share structural properties with unbiased random walks, suggesting potential practical utility for our implementation. |
| title | Banana Trees for the Persistence in Time Series Experimentally |
| topic | Data Structures and Algorithms |
| url | https://arxiv.org/abs/2405.17920 |