Reference Hub22
A Fast Shapelet Discovery Algorithm Based on Important Data Points

A Fast Shapelet Discovery Algorithm Based on Important Data Points

Cun Ji, Chao Zhao, Li Pan, Shijun Liu, Chenglei Yang, Lei Wu
Copyright: © 2017 |Volume: 14 |Issue: 2 |Pages: 14
ISSN: 1545-7362|EISSN: 1546-5004|EISBN13: 9781522511120|DOI: 10.4018/IJWSR.2017040104
Cite Article Cite Article

MLA

Ji, Cun, et al. "A Fast Shapelet Discovery Algorithm Based on Important Data Points." IJWSR vol.14, no.2 2017: pp.67-80. http://doi.org/10.4018/IJWSR.2017040104

APA

Ji, C., Zhao, C., Pan, L., Liu, S., Yang, C., & Wu, L. (2017). A Fast Shapelet Discovery Algorithm Based on Important Data Points. International Journal of Web Services Research (IJWSR), 14(2), 67-80. http://doi.org/10.4018/IJWSR.2017040104

Chicago

Ji, Cun, et al. "A Fast Shapelet Discovery Algorithm Based on Important Data Points," International Journal of Web Services Research (IJWSR) 14, no.2: 67-80. http://doi.org/10.4018/IJWSR.2017040104

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

Time series classification (TSC) has attracted significant interest over the past decade. A shapelet is one fragment of a time series that can represent class characteristics of the time series. A classifier based on shapelets is interpretable, more accurate, and faster. However, the time it takes to find shapelets is enormous. This article will propose a fast shapelet (FS) discovery algorithm based on important data points (IDPs). First, the algorithm will identify IDPs. Next, the subsequence containing one or more IDPs will be selected as a candidate shapelet. Finally, the best shapelets will be selected. Results will show that the proposed algorithm reduces the shapelet discovery time by approximately 14.0% while maintaining the same level of classification accuracy rates.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.