Abstract
Adaptive sampling is a dimensionality reduction technique of time series data inspired by the dynamic programming piecewise linear approximation. This dimensionality reduction technique yields a suboptimal solution of the problem of polygonal curve approximation by limiting the search space. In this paper, we conduct extensive experiments to evaluate the performance of adaptive sampling in 1-NN classification and k-means clustering tasks. The experiments we conducted show that adaptive sampling gives satisfactory results in the aforementioned tasks even for relatively high compression ratios.
Original language | English |
---|---|
Title of host publication | ICPRAM 2016 - Proceedings of the 5th International Conference on Pattern Recognition Applications and Methods |
Editors | Ana Fred, Maria De Marsico, Gabriella Sanniti di Baja |
Publisher | SciTePress |
Pages | 48-54 |
Number of pages | 7 |
ISBN (Electronic) | 9789897581731 |
DOIs | |
Publication status | Published - 1 Jan 2016 |
Externally published | Yes |
Event | 5th International Conference on Pattern Recognition Applications and Methods, ICPRAM 2016 - Rome, Italy Duration: 24 Feb 2016 → 26 Feb 2016 http://www.icpram.org/?y=2016 |
Publication series
Name | ICPRAM 2016 - Proceedings of the 5th International Conference on Pattern Recognition Applications and Methods |
---|
Conference
Conference | 5th International Conference on Pattern Recognition Applications and Methods, ICPRAM 2016 |
---|---|
Abbreviated title | ICPRAM 2016 |
Country/Territory | Italy |
City | Rome |
Period | 24/02/16 → 26/02/16 |
Internet address |
Keywords
- Adaptive sampling
- Classification
- Clustering
- Data mining
- Time series
ASJC Scopus subject areas
- Computer Vision and Pattern Recognition