K-spectral centroid: extension and optimizations

Brieuc Conan-Guez 1 Alain Gély 1 Lydia Boudjeloud 1 Alexandre Blansché 1
1 ORPAILLEUR - Knowledge representation, reasonning
Inria Nancy - Grand Est, LORIA - NLPKD - Department of Natural Language Processing & Knowledge Discovery
Abstract : In this work, we address the problem of unsupervised classification of large time series datasets. We focus on K-Spectral Centroid (KSC), a k-means-like model, devised for time series clustering. KSC relies on a custom dissimilarity measure between time series, which is invariant to time shifting and Y-scaling. KSC has two downsides: firstly its dissimilarity measure only makes sense for non negative time series. Secondly the KSC algorithm is relatively demanding in terms of computation time. In this paper, we present a natural extension of the KSC dissimilarity measure to time series of arbitrary signs. We show that this new measure is a metric distance. We propose to speed up this extended KSC (EKSC) thanks to four exact optimizations. Finally, we compare EKSC to a similar model, K-Shape, on real world datasets.
Complete list of metadatas

Cited literature [4 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01901251
Contributor : Brieuc Conan-Guez <>
Submitted on : Monday, November 19, 2018 - 6:22:34 PM
Last modification on : Tuesday, December 18, 2018 - 4:38:02 PM
Long-term archiving on : Wednesday, February 20, 2019 - 12:31:21 PM

File

KSpectralCentroid.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01901251, version 1

Collections

Citation

Brieuc Conan-Guez, Alain Gély, Lydia Boudjeloud, Alexandre Blansché. K-spectral centroid: extension and optimizations. ESANN 2018 - 26th European Symposium on Artificial Neural Networks, Computational Intelligence and Machine Learning, Apr 2018, Bruges, Belgium. pp.603-608. ⟨hal-01901251⟩

Share

Metrics

Record views

47

Files downloads

64