首页> 外文期刊>Knowledge and information systems >Classification of multivariate time series via temporal abstraction and time intervals mining
【24h】

Classification of multivariate time series via temporal abstraction and time intervals mining

机译:通过时间抽象和时间间隔挖掘对多元时间序列进行分类

获取原文
获取原文并翻译 | 示例
           

摘要

Classification of multivariate time series data, often including both time points and intervals at variable frequencies, is a challenging task. We introduce the KarmaLegoSification (KLS) framework for classification of multivariate time series analysis, which implements three phases: (1) application of a temporal abstraction process that transforms a series of raw time-stamped data points into a series of symbolic time intervals; (2) mining these symbolic time intervals to discover frequent time-interval-related patterns (TIRPs), using Allen's temporal relations; and (3) using the TIRPs as features to induce a classifier. To efficiently detect multiple TIRPs (features) in a single entity to be classified, we introduce a new algorithm, SingleKarmaLego, which can be shown to be superior for that purpose over a Sequential TIRPs Detection algorithm. We evaluated the KLS framework on datasets in the domains of diabetes, intensive care, and infectious hepatitis, assessing the effects of the various settings of the KLS framework. Discretization using Symbolic Aggregate approXimation (SAX) led to better performance than using the equal-width discretization (EWD); knowledge-based cut-off definitions when available were superior to both. Using three abstract temporal relations was superior to using the seven core temporal relations. Using an epsilon value larger than zero tended to result in a slightly better accuracy when using the SAX discretization method, but resulted in a reduced accuracy when using EWD, and overall, does not seem beneficial. No feature selection method we tried proved useful. Regarding feature (TIRP) representation, mean duration performed better than horizontal support, which in turn performed better than the default Binary (existence) representation method.
机译:多变量时间序列数据的分类(通常包括可变频率的时间点和间隔)是一项艰巨的任务。我们介绍了KarmaLegoSification(KLS)框架,用于对多元时间序列分析进行分类,该框架实现了三个阶段:(1)应用时间抽象过程,该过程将一系列原始时间戳数据点转换为一系列符号时间间隔; (2)利用艾伦的时间关系挖掘这些符号时间间隔,以发现频繁的时间间隔相关模式(TIRP); (3)使用TIRP作为特征来诱导分类器。为了有效地检测单个实体中要分类的多个TIRP(特征),我们引入了一种新算法SingleKarmaLego,可以证明该算法优于顺序TIRP检测算法。我们在糖尿病,重症监护和传染性肝炎领域的数据集上评估了KLS框架,评估了KLS框架各种设置的影响。与使用等宽度离散化(EWD)相比,使用符号聚合近似(SAX)进行离散化可产生更好的性能;基于知识的临界值定义(如果可用)优于两者。使用三个抽象的时间关系优于使用七个核心的时间关系。当使用SAX离散化方法时,使用大于零的epsilon值往往会导致精度稍好一些,但是在使用EWD时会导致精度降低,总的来说,这似乎没有好处。我们尝试的功能选择方法没有证明是有用的。关于特征(TIRP)表示,平均持续时间的效果要好于水平支撑,而水平支撑的效果又要好于默认的二进制(存在)表示方法。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号