1
|
Hexadecimal Aggregate Approximation Representation and Classification of Time Series Data. ALGORITHMS 2021. [DOI: 10.3390/a14120353] [Citation(s) in RCA: 1] [Impact Index Per Article: 0.3] [Reference Citation Analysis] [Abstract] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 11/16/2022]
Abstract
Time series data are widely found in finance, health, environmental, social, mobile and other fields. A large amount of time series data has been produced due to the general use of smartphones, various sensors, RFID and other internet devices. How a time series is represented is key to the efficient and effective storage and management of time series data, as well as being very important to time series classification. Two new time series representation methods, Hexadecimal Aggregate approXimation (HAX) and Point Aggregate approXimation (PAX), are proposed in this paper. The two methods represent each segment of a time series as a transformable interval object (TIO). Then, each TIO is mapped to a spatial point located on a two-dimensional plane. Finally, the HAX maps each point to a hexadecimal digit so that a time series is converted into a hex string. The experimental results show that HAX has higher classification accuracy than Symbolic Aggregate approXimation (SAX) but a lower one than some SAX variants (SAX-TD, SAX-BD). The HAX has the same space cost as SAX but is lower than these variants. The PAX has higher classification accuracy than HAX and is extremely close to the Euclidean distance (ED) measurement; however, the space cost of PAX is generally much lower than the space cost of ED. HAX and PAX are general representation methods that can also support geoscience time series clustering, indexing and query except for classification.
Collapse
|
2
|
Levchenko O, Kolev B, Yagoubi DE, Akbarinia R, Masseglia F, Palpanas T, Shasha D, Valduriez P. BestNeighbor: efficient evaluation of kNN queries on large time series databases. Knowl Inf Syst 2020. [DOI: 10.1007/s10115-020-01518-4] [Citation(s) in RCA: 7] [Impact Index Per Article: 1.8] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/24/2022]
|
3
|
Yagoubi DE, Akbarinia R, Kolev B, Levchenko O, Masseglia F, Valduriez P, Shasha D. ParCorr: efficient parallel methods to identify similar time series pairs across sliding windows. Data Min Knowl Discov 2018. [DOI: 10.1007/s10618-018-0580-z] [Citation(s) in RCA: 2] [Impact Index Per Article: 0.3] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 10/28/2022]
|
4
|
On the predictive analysis of behavioral massive job data using embedded clustering and deep recurrent neural networks. Knowl Based Syst 2018. [DOI: 10.1016/j.knosys.2018.03.025] [Citation(s) in RCA: 17] [Impact Index Per Article: 2.8] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/18/2022]
|
5
|
Cai Q, Chen L, Sun J. Piecewise statistic approximation based similarity measure for time series. Knowl Based Syst 2015. [DOI: 10.1016/j.knosys.2015.05.005] [Citation(s) in RCA: 16] [Impact Index Per Article: 1.8] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/16/2022]
|