arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1609.01924nlin.CDcs.ITmath.IT
收藏

短噪声时间序列的动态复杂性

Dynamical Complexity Of Short and Noisy Time Series

Nithin Nagaraj, Karthi Balasubramanian

摘要:

香农熵已被广泛用于描述时间序列的复杂性所产生的混沌动力系统和随机过程,如马尔可夫链。然而,对于短时间和有噪声的时间序列,香农熵表现不佳。在这种情况下,基于无损压缩算法的复杂性度量是一个很好的替代品。我们评估了两个这样的压缩复杂性措施,即Lempel-Ziv复杂性($LZ$)和努力压缩($ETC$)在噪声存在下的混沌动力系统的短时间序列的性能。$LZ$和$ETC$在精确表征这类系统的动力学复杂性方面都优于香农熵($H$)。对于非常短的二进制序列(其出现在神经科学应用中),$ETC$具有比$LZ$和$H$更高数量的不同复杂度值,从而实现更精细的分辨率。对于两状态遍历马尔可夫链,我们的经验表明,$ETC$收敛到一个稳态值比$LZ$。压缩复杂性措施是有前途的应用程序,涉及短和噪声的时间序列。

英文摘要:

Shannon Entropy has been extensively used for characterizing complexity of time series arising from chaotic dynamical systems and stochastic processes such as Markov chains. However, for short and noisy time series, Shannon entropy performs poorly. Complexity measures which are based on lossless compression algorithms are a good substitute in such scenarios. We evaluate the performance of two such Compression-Complexity Measures namely Lempel-Ziv complexity ($LZ$) and Effort-To-Compress ($ETC$) on short time series from chaotic dynamical systems in the presence of noise. Both $LZ$ and $ETC$ outperform Shannon entropy ($H$) in accurately characterizing the dynamical complexity of such systems. For very short binary sequences (which arise in neuroscience applications), $ETC$ has higher number of distinct complexity values than $LZ$ and $H$, thus enabling a finer resolution. For two-state ergodic Markov chains, we empirically show that $ETC$ converges to a steady state value faster than $LZ$. Compression-Complexity Measures are promising for applications which involve short and noisy time series.

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

↑