Have a personal or library account? Click to login
Shapelet Classification Algorithm Based on Efficient Subsequence Matching Cover

Shapelet Classification Algorithm Based on Efficient Subsequence Matching

Open Access
|Mar 2018

Abstract

Shapelet classification algorithms are an accurate classification method for time series data. Existing shapelet classifying processes are relatively inefficient and slow due to the large amount of necessary complex distance computations. This paper therefore introduces piecewise aggregate approximation(PAA) representation and an efficient subsequence matching algorithm for shapelet classification algorithms; the paper also proposes shapelet transformation classification algorithm based on efficient series matching. First, the proposed algorithm took the PAA representation for appropriate dimension reduction, and then used a subsequence matching algorithm to simplify the data classification process. The research experimented on 14 public time series datasets taken from UCI and UCR, used the original and new algorithm for classification, and compared the efficiency and accuracy of the two methods. Experimental results showed that the efficient subsequence matching algorithm could be combined with the shapelet classification algorithm; the new algorithm could ensure relatively high classification accuracy, effectively simplified the algorithm calculation process, and improved classification efficiency.

Language: English
Submitted on: Oct 8, 2017
|
Accepted on: Feb 2, 2018
|
Published on: Mar 1, 2018
Published by: Ubiquity Press
In partnership with: Paradigm Publishing Services
Publication frequency: 1 issue per year

© 2018 Huiqing Wang, Chun Li, Hongwei Sun, Zhirong Guo, Yingying Bai, published by Ubiquity Press
This work is licensed under the Creative Commons Attribution 4.0 License.