Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
97 tokens/sec
GPT-4o
53 tokens/sec
Gemini 2.5 Pro Pro
43 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Computational Topology Techniques for Characterizing Time-Series Data (1708.09359v3)

Published 14 Aug 2017 in cs.CG

Abstract: Topological data analysis (TDA), while abstract, allows a characterization of time-series data obtained from nonlinear and complex dynamical systems. Though it is surprising that such an abstract measure of structure - counting pieces and holes - could be useful for real-world data, TDA lets us compare different systems, and even do membership testing or change-point detection. However, TDA is computationally expensive and involves a number of free parameters. This complexity can be obviated by coarse-graining, using a construct called the witness complex. The parametric dependence gives rise to the concept of persistent homology: how shape changes with scale. Its results allow us to distinguish time-series data from different systems - e.g., the same note played on different musical instruments.

User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (5)
  1. Nicole Sanderson (7 papers)
  2. Elliott Shugerman (1 paper)
  3. Samantha Molnar (2 papers)
  4. James D. Meiss (25 papers)
  5. Elizabeth Bradley (28 papers)
Citations (15)

Summary

We haven't generated a summary for this paper yet.