Sorry, you need to enable JavaScript to visit this website.

LARGE-SCALE TIME SERIES CLUSTERING WITH k-ARs

Citation Author(s):
Submitted by:
Zuogong Yue
Last updated:
15 May 2020 - 2:55am
Document Type:
Presentation Slides
Document Year:
2020
Event:
Presenters Name:
Zuogong Yue
Paper Code:
1772

Abstract 

Abstract: 

Time-series clustering involves grouping homogeneous time series together based on certain similarity measures. The mixture AR model (MxAR) has already been developed for time series clustering, as has an associated EM algorithm. How- ever, this EM clustering algorithm fails to perform satisfactorily in large-scale applications due to its high computational complexity. This paper proposes a new algorithm, k-ARs, which is a limiting version of the existing EM algorithm. It shows remarkably good computational performance when applied to large-scale clustering problems as illustrated on some benchmark simulations motivated by some real applications.

up
0 users have voted:

Dataset Files

kARs.pdf

(143)