arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2402.07786physics.data-an
收藏

复杂动力系统噪声时间序列数据中统计相关涨落的“逐层”无监督聚类

"Layer-by-layer" Unsupervised Clustering of Statistically Relevant Fluctuations in Noisy Time-series Data of Complex Dynamical Systems

Matteo Becchi, Federico Fantolino, Giovanni M. Pavan

AI总结:

本文提出一种名为 Onion Clustering 的迭代式无监督聚类方法,通过逐层检测、分类并移除噪声时间序列中的统计相关涨落,揭示复杂动力系统在不同时间分辨率下可稳健区分的动力学簇,并在多尺度模拟与实验轨迹中验证了其有效性。

摘要:

复杂系统通常具有难以阐明的复杂内部动力学特征。理想情况下,这需要能够以无监督方式检测和分类系统中发生的微观动力学事件的方法。然而,将统计相关的涨落与内部噪声解耦往往并非易事。本文描述了“Onion Clustering”:一种简单、迭代的无监督聚类方法,能够高效地检测和分类噪声时间序列数据中的统计相关涨落。我们通过分析从原子尺度到微观尺度、平衡态与非平衡态的各种复杂内部动力学系统的模拟和实验轨迹,证明了该方法的效率。该方法基于迭代的“检测-分类-归档”方法。类似于剥开洋葱的外部(明显)层以揭示内部隐藏层的方式,该方法首先对系统中最密集的动力学环境及其特征噪声进行检测和分类。然后将该动力学簇的信号从时间序列数据中移除,并对剩余部分(清除其噪声后)再次进行分析。在每次迭代中,隐藏动力学子域的检测都通过不断增大(且自适应)的相关性与噪声比得到促进。该过程持续迭代,直到无法发现新的动力学域,从而作为输出揭示出能够在统计上稳健地区分/分类的簇的数量,该数量与分析的时间分辨率相关。Onion Clustering 具有通用性,并受益于清晰的物理可解释性。我们期望它将有助于分析各种复杂动力系统和时间序列数据。

英文摘要:

Complex systems are typically characterized by intricate internal dynamics that are often hard to elucidate. Ideally, this requires methods that allow to detect and classify in unsupervised way the microscopic dynamical events occurring in the system. However, decoupling statistically relevant fluctuations from the internal noise remains most often non-trivial. Here we describe "Onion Clustering": a simple, iterative unsupervised clustering method that efficiently detects and classifies statistically relevant fluctuations in noisy time-series data. We demonstrate its efficiency by analyzing simulation and experimental trajectories of various systems with complex internal dynamics, ranging from the atomic- to the microscopic-scale, in- and out-of-equilibrium. The method is based on an iterative detect-classify-archive approach. In similar way as peeling the external (evident) layer of an onion reveals the internal hidden ones, the method performs a first detection and classification of the most populated dynamical environment in the system and of its characteristic noise. The signal of such dynamical cluster is then removed from the time-series data and the remaining part, cleared-out from its noise, is analyzed again. At every iteration, the detection of hidden dynamical sub-domains is facilitated by an increasing (and adaptive) relevance-to-noise ratio. The process iterates until no new dynamical domains can be uncovered, revealing, as an output, the number of clusters that can be effectively distinguished/classified in statistically robust way as a function of the time-resolution of the analysis. Onion Clustering is general and benefits from clear-cut physical interpretability. We expect that it will help analyzing a variety of complex dynamical systems and time-series data.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑