Computational Topology Techniques for Characterizing Time-Series Data

10Citations
Citations of this article
37Readers
Mendeley users who have this article in their library.
Get full text

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.

Cite

CITATION STYLE

APA

Sanderson, N., Shugerman, E., Molnar, S., Meiss, J. D., & Bradley, E. (2017). Computational Topology Techniques for Characterizing Time-Series Data. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10584 LNCS, pp. 284–296). Springer Verlag. https://doi.org/10.1007/978-3-319-68765-0_24

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free