Rock the KASBA: Blazingly Fast and Accurate Time Series Clustering
Christopher Holder, Anthony Bagnall

TL;DR
The paper introduces KASBA, a novel time series clustering algorithm that balances speed and accuracy, outperforming existing methods in both metrics through innovative use of elastic distance and stochastic optimization.
Contribution
KASBA is a new scalable time series clustering algorithm combining MSM elastic distance with stochastic gradient descent for improved performance.
Findings
KASBA achieves significantly better clustering accuracy than existing fast algorithms.
KASBA offers orders of magnitude faster run times compared to the most accurate k-means methods.
Extensive experiments validate KASBA's effectiveness on real-world datasets.
Abstract
Time series data has become increasingly prevalent across numerous domains, driving a growing demand for time series machine learning techniques. Among these, time series clustering (TSCL) stands out as one of the most popular machine learning tasks. TSCL serves as a powerful exploratory analysis tool and is also employed as a preprocessing step or subroutine for various tasks, including anomaly detection, segmentation, and classification. The most popular TSCL algorithms are either fast (in terms of run time) but perform poorly on benchmark problems, or perform well on benchmarks but scale poorly. We present a new TSCL algorithm, the -means (K) accelerated (A) Stochastic subgradient (S) Barycentre (B) Average (A) (KASBA) clustering algorithm. KASBA is a -means clustering algorithm that uses the Move-Split-Merge (MSM) elastic distance at all stages of clustering, applies a…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
