首页> 外文期刊>Pattern Recognition: The Journal of the Pattern Recognition Society >Semi-supervised time series classification on positive and unlabeled problems using cross-recurrence quantification analysis
【24h】

Semi-supervised time series classification on positive and unlabeled problems using cross-recurrence quantification analysis

机译:半监督时间序列分类对使用交叉复发量化分析的正面和未标记问题

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

摘要

When dealing with semi-supervised scenarios, the Positive and Unlabeled (PU) problem is a special case in which few labeled examples from a single class of interest are received to proceed with the classification of unseen instances, according to their similarities with the known class. In the scope of time series, most of the current studies propose to address this subject using a self-training approach based on the 1-Nearest Neighbor algorithm. In order to compute the most similar instance, they compare features along the time domain using the Euclidean Distance and the Dynamic Time Warping-Delta. Despite time domain measurements permit the analysis of local series shapes, they disconsider temporal recurrences commonly found in natural phenomena (e.g. population growth, climate studies) and are more sensitive to local noise and fluctuations, leading to poor classification performances as confirmed in this paper. This drawback motivated us to propose the use of the Maximum Diagonal Line of the Cross-Recurrence Quantification Analysis (MDL-CRQA), applied on the time series phase space, as similarity measurement. The phase space is obtained after applying Takens embedding theorem on the series, unfolding temporal relationships and dependencies among data observations. As consequence, by comparing phase spaces rather than the series themselves, we can assess how their trajectories evolve along time, including their periodicities and temporal cycles, as well as decreasing noise influences. Experimental results confirm MDL-CRQA improves classification results for PU time series when compared against the mostly used time-domain similarity measurements. (C) 2018 Elsevier Ltd. All rights reserved.
机译:在处理半监督场景时,正和未标记的(PU)问题是一个特殊的情况,其中收到了从单一类兴趣的标记示例,根据与已知类别的相似性的情况下继续进行看不见的实例的分类。在时间序列范围内,大多数当前的研究建议使用基于第一邻邻算法的自培训方法来解决这个问题。为了计算最相似的实例,它们使用欧几里德距离和动态时间翘曲 - 三角形比较时间域的特征。尽管时域测量允许分析局部系列形状,但它们常见于天然现象中常见的颞次复制(例如人口增长,气候研究),对本地噪音和波动更敏感,导致本文确认的分类性能差。该缺点是我们提出使用在时间序列相位空间上施加的交叉复发定量分析(MDL-CRQA)的最大对角线作为相似度测量。在将TAMENS嵌入定理应用于该系列,展开时间关系和数据观察中的依赖性之后获得相位空间。因此,通过比较阶段空间而不是系列本身,我们可以评估他们的轨迹如何发展时间,包括它们的周期性和时间循环,以及降低噪声影响。实验结果证实MDL-CRQA在与主要使用的时域相似度测量相比时改善了PU时间序列的分类结果。 (c)2018年elestvier有限公司保留所有权利。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号