你是 uGLAD 吗?时间会给出答案!
Are uGLAD? Time will tell!
AI总结:
本文提出多变量时间序列分割框架 tGLAD,利用条件独立图、滑动窗口与多任务 uGLAD 恢复时间 CI 图,并通过轨迹跟踪和分配算法实现高效分割。
摘要:
我们在周围环境中经常遇到多个时间上相关的时间序列,例如用于检查大脑活动变化的 EEG 数据或用于监测身体运动的传感器。多变量时间序列分割是一种识别时间序列中有意义模式或变化的技术,这些模式或变化可以表明系统行为发生了转变。然而,大多数分割算法主要针对单变量时间序列设计,它们在多变量数据上的表现仍然很不令人满意,这使得该问题具有挑战性。在这项工作中,我们引入了一种使用条件独立(CI)图进行多变量时间序列分割的新方法。CI 图是一种概率图模型,表示节点之间的偏相关。我们提出了一个领域无关的多变量分割框架 tGLAD,它在 CI 图节点与时间序列变量之间建立对应关系。考虑将图恢复模型 uGLAD 应用于时间序列的一个短区间,它将得到一个显示变量之间偏相关的 CI 图。我们通过利用滑动窗口创建一批时间区间,然后以多任务学习模式运行单个 uGLAD 模型来同时恢复所有 CI 图,从而将这一思想扩展到整个时间序列。结果,我们获得了相应的时间 CI 图表示。然后,我们设计了基于一阶和二阶的轨迹跟踪算法,以研究这些图在不同区间上的演化。最后,使用一个“分配”(Allocation)算法来确定时间图序列的合适分割。在变量数量 D<<N 的设置下,tGLAD 提供了具有竞争力的 O(N) 时间复杂度。我们在 Physical Activity Monitoring 数据上展示了成功的实证结果。
英文摘要:
We frequently encounter multiple series that are temporally correlated in our surroundings, such as EEG data to examine alterations in brain activity or sensors to monitor body movements. Segmentation of multivariate time series data is a technique for identifying meaningful patterns or changes in the time series that can signal a shift in the system's behavior. However, most segmentation algorithms have been designed primarily for univariate time series, and their performance on multivariate data remains largely unsatisfactory, making this a challenging problem. In this work, we introduce a novel approach for multivariate time series segmentation using conditional independence (CI) graphs. CI graphs are probabilistic graphical models that represents the partial correlations between the nodes. We propose a domain agnostic multivariate segmentation framework $\texttt{tGLAD}$ which draws a parallel between the CI graph nodes and the variables of the time series. Consider applying a graph recovery model $\texttt{uGLAD}$ to a short interval of the time series, it will result in a CI graph that shows partial correlations among the variables. We extend this idea to the entire time series by utilizing a sliding window to create a batch of time intervals and then run a single $\texttt{uGLAD}$ model in multitask learning mode to recover all the CI graphs simultaneously. As a result, we obtain a corresponding temporal CI graphs representation. We then designed a first-order and second-order based trajectory tracking algorithms to study the evolution of these graphs across distinct intervals. Finally, an `Allocation' algorithm is used to determine a suitable segmentation of the temporal graph sequence. $\texttt{tGLAD}$ provides a competitive time complexity of $O(N)$ for settings where number of variables $D<<N$. We demonstrate successful empirical results on a Physical Activity Monitoring data.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。