Computational Topology Techniques for Characterizing Time-Series Data

Computational Topology Techniques for Characterizing Time-Series Data
复制标题

用于表征时间序列数据的计算拓扑技术

DOI:
10.1007/978-3-319-68765-0_24
复制
发表时间:
2017
期刊:
Advances in Intelligent Data Analysis XVI. IDA 2017
影响因子:
--
通讯作者:
Bradley, E.
Bradley, E.
中科院分区:
--
文献类型:
--
作者:
Sanderson, N.;Shugerman, E;Molna, r S.;Meiss, J.D.;Bradley, E.

文献摘要

参考文献

被引文献

相似文献

拓扑数据分析 (TDA) 虽然抽象,但允许对从非线性和复杂动力系统获得的时间序列数据进行表征。尽管令人惊讶的是,这种抽象的结构测量(计算碎片和孔洞)可能对现实世界的数据有用,但 TDA 让我们可以比较不同的系统,甚至可以进行隶属度测试或变化点检测。然而,TDA 的计算成本很高,并且涉及许多自由参数。这种复杂性可以通过使用称为“见证复合体”的结构进行粗粒度化来避免。参数依赖性产生了持久同源性的概念:形状如何随尺度变化。其结果使我们能够区分来自不同系统的时间序列数据,例如,在不同乐器上演奏的相同音符。
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.
点数据的计算拓扑:α 形状的 Betti 数
DOI: --
发表时间: 2002
期刊:
影响因子: --
作者:
V. Robins
通讯作者: V. Robins
拓扑与智能数据分析
DOI: --
发表时间: 2004
影响因子: 1.7
作者:
V. Robins;Jennifer Abernethy;N. Rooney;E. Bradley
通讯作者: E. Bradley