一种用于时间序列分类的形状感知特征提取方法

Hidetoshi Ito, B. Chakraborty
{"title":"一种用于时间序列分类的形状感知特征提取方法","authors":"Hidetoshi Ito, B. Chakraborty","doi":"10.1109/ICAwST.2019.8923166","DOIUrl":null,"url":null,"abstract":"Many new classification methods are proposed for time series data in this decade, including ensembles and deep learning based methods. However, speed for real-time classification, interpretability of the results and necessary computational resources, make them difficult to use in real life problems compared to traditional feature based or similarity based time series classification methods. Judicious use of local features of time series is supposed to be the key point to improve the performance and interpretability. In this work, three new linear time complexity shape aware feature extraction methods leading to the computation of similarities of two time series, are proposed. Their performances are compared to the most popular Dynamic Time Warping (DTW) with the k- Nearest Neighbor classifier (kNN) as the baseline classifier (kNN-DTW) by simulation experiments with 43 benchmark time series data sets. It is found that the proposed approach can achieve higher classification accuracies for some datasets while computationally lighter for all the data sets than DTW.","PeriodicalId":156538,"journal":{"name":"2019 IEEE 10th International Conference on Awareness Science and Technology (iCAST)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"A Proposal for Shape Aware Feature Extraction for Time Series Classification\",\"authors\":\"Hidetoshi Ito, B. Chakraborty\",\"doi\":\"10.1109/ICAwST.2019.8923166\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Many new classification methods are proposed for time series data in this decade, including ensembles and deep learning based methods. However, speed for real-time classification, interpretability of the results and necessary computational resources, make them difficult to use in real life problems compared to traditional feature based or similarity based time series classification methods. Judicious use of local features of time series is supposed to be the key point to improve the performance and interpretability. In this work, three new linear time complexity shape aware feature extraction methods leading to the computation of similarities of two time series, are proposed. Their performances are compared to the most popular Dynamic Time Warping (DTW) with the k- Nearest Neighbor classifier (kNN) as the baseline classifier (kNN-DTW) by simulation experiments with 43 benchmark time series data sets. It is found that the proposed approach can achieve higher classification accuracies for some datasets while computationally lighter for all the data sets than DTW.\",\"PeriodicalId\":156538,\"journal\":{\"name\":\"2019 IEEE 10th International Conference on Awareness Science and Technology (iCAST)\",\"volume\":\"26 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2019 IEEE 10th International Conference on Awareness Science and Technology (iCAST)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICAwST.2019.8923166\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 IEEE 10th International Conference on Awareness Science and Technology (iCAST)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICAwST.2019.8923166","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

近十年来,人们提出了许多新的时间序列数据分类方法,包括集成方法和基于深度学习的方法。然而,与传统的基于特征或相似度的时间序列分类方法相比,实时分类的速度、结果的可解释性和必要的计算资源使得它们难以在实际问题中使用。合理利用时间序列的局部特征是提高性能和可解释性的关键。本文提出了三种新的线性时间复杂度形状感知特征提取方法,用于计算两个时间序列的相似度。通过43个基准时间序列数据集的仿真实验,将其性能与最流行的以k近邻分类器(kNN)为基线分类器(kNN-DTW)的动态时间翘曲(DTW)进行比较。结果表明,与DTW相比,该方法对部分数据集的分类精度更高,对所有数据集的分类计算量更少。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A Proposal for Shape Aware Feature Extraction for Time Series Classification
Many new classification methods are proposed for time series data in this decade, including ensembles and deep learning based methods. However, speed for real-time classification, interpretability of the results and necessary computational resources, make them difficult to use in real life problems compared to traditional feature based or similarity based time series classification methods. Judicious use of local features of time series is supposed to be the key point to improve the performance and interpretability. In this work, three new linear time complexity shape aware feature extraction methods leading to the computation of similarities of two time series, are proposed. Their performances are compared to the most popular Dynamic Time Warping (DTW) with the k- Nearest Neighbor classifier (kNN) as the baseline classifier (kNN-DTW) by simulation experiments with 43 benchmark time series data sets. It is found that the proposed approach can achieve higher classification accuracies for some datasets while computationally lighter for all the data sets than DTW.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信