2016
DOI: 10.1145/2949741.2949758
|View full text |Cite
|
Sign up to set email alerts
|

k-Shape

Abstract: The proliferation and ubiquity of temporal data across many disciplines has generated substantial interest in the analysis and mining of time series. Clustering is one of the most popular data mining methods, not only due to its exploratory power, but also as a preprocessing step or subroutine for other techniques. In this paper, we describe k-Shape, a novel algorithm for time-series clustering. k-Shape relies on a scalable iterative refinement procedure, which creates homogeneous and well-separated clusters. … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
27
0
1

Year Published

2017
2017
2024
2024

Publication Types

Select...
4
3
1

Relationship

0
8

Authors

Journals

citations
Cited by 137 publications
(28 citation statements)
references
References 59 publications
0
27
0
1
Order By: Relevance
“…Regarding the GPR data processing and interpretation, follow-up works include the use of GPR phase analysis techniques [30] as an additional tool for the identification of cavities in corroded concrete. We also plan to explore the use of time-series clustering algorithms [31] to analyze profile traces in order to automate the identification and categorization of key features (such as cavities, rebars, and moist areas).…”
Section: Discussionmentioning
confidence: 99%
“…Regarding the GPR data processing and interpretation, follow-up works include the use of GPR phase analysis techniques [30] as an additional tool for the identification of cavities in corroded concrete. We also plan to explore the use of time-series clustering algorithms [31] to analyze profile traces in order to automate the identification and categorization of key features (such as cavities, rebars, and moist areas).…”
Section: Discussionmentioning
confidence: 99%
“…Time series clustering methods group training time series into a number of (typically prespecified) clusters. A popular choice in time series analysis is k-means, being the only clustering algorithm scaling linearly with data set size [6]. Here, DTW-based elastic measures might again be used to find the barycenter best representing the centroids of k-means clusters [19].…”
Section: Methods Based On One-dimensional Representationsmentioning
confidence: 99%
“…Multidimensional representations: These representations emerge when the sensor data are projected to a dual space by extraction of features. When aiming for a generic anomaly detection model, the major challenge is given by the choice of a generic but expressive set of features [6]. Among popular choices are statistical measures and wavelet-based features [7] or filter bank features (e.g., Mel-frequency cepstral coefficient (MFCC) features) [8].…”
mentioning
confidence: 99%
“…This method uses a normalized cross-correlation function to derive a shape-based distance metric 27 . The tslearn implementation is used in Mesmerize 28 .…”
Section: K-shape Clusteringmentioning
confidence: 99%
“…Mesmerize also provides an implementation for k-Shape clustering 27,28 to extract a finite set of discrete archetypical peaks from calcium traces (Fig 2i). These archetypical peaks allow traces to be reduced to sequences of discrete letters that can be modeled with techniques such as Markov Chains (Fig 2j-m).…”
mentioning
confidence: 99%