Automatic Registration and Clustering of Time Series

Clustering of time series data exhibits a number of challenges not present in other settings, notably the problem of registration (alignment) of observed signals. Typical approaches include pre-registration to a user-specified template or time warping approaches which attempt to optimally align series with a minimum of distortion. For many signals obtained from recording or sensing devices, these methods may be unsuitable as a template signal is not available for pre-registration, while the distortion of warping approaches may obscure meaningful temporal information. We propose a new method for automatic time series alignment within a clustering problem. Our approach, Temporal Registration using Optimal Unitary Transformations (TROUT), is based on a novel dissimilarity measure between time series that is easy to compute and automatically identifies optimal alignment between pairs of time series. By embedding our new measure in a optimization formulation, we retain well-known advantages of computational and statistical performance. We provide an efficient algorithm for TROUT-based clustering and demonstrate its superior performance over a range of competitors.

[1]  Ying Wah Teh,et al.  Time-series clustering - A decade review , 2015, Inf. Syst..

[2]  Haesun Park,et al.  A Procrustes problem on the Stiefel manifold , 1999, Numerische Mathematik.

[3]  Eamonn J. Keogh,et al.  Three Myths about Dynamic Time Warping Data Mining , 2005, SDM.

[4]  L. Ljung,et al.  Clustering using sum-of-norms regularization: With application to particle filter output computation , 2011, 2011 IEEE Statistical Signal Processing Workshop (SSP).

[5]  Kean Ming Tan,et al.  Statistical properties of convex clustering. , 2015, Electronic journal of statistics.

[6]  S. Chiba,et al.  Dynamic programming algorithm optimization for spoken word recognition , 1978 .

[7]  Kenneth Lange,et al.  MM optimization algorithms , 2016 .

[8]  Genevera I. Allen,et al.  Dynamic Visualization and Fast Computation for Convex Clustering via Algorithmic Regularization , 2019, Journal of computational and graphical statistics : a joint publication of American Statistical Association, Institute of Mathematical Statistics, Interface Foundation of North America.

[9]  Heinz H. Bauschke,et al.  Convex Analysis and Monotone Operator Theory in Hilbert Spaces , 2011, CMS Books in Mathematics.

[10]  Kean Ming Tan,et al.  Robust convex clustering: How does fusion penalty enhance robustness? , 2019, 1906.09581.

[11]  Anuj Srivastava,et al.  Shape Analysis of Elastic Curves in Euclidean Spaces , 2011, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[12]  Hiroaki Sakoe,et al.  A Dynamic Programming Approach to Continuous Speech Recognition , 1971 .

[13]  Michael Weylandt,et al.  Splitting Methods For Convex Bi-Clustering And Co-Clustering , 2019, 2019 IEEE Data Science Workshop (DSW).

[14]  Shuicheng Yan,et al.  Convex Optimization Procedure for Clustering: Theoretical Revisit , 2014, NIPS.

[15]  Genevera I. Allen,et al.  Integrative Generalized Convex Clustering Optimization and Feature Selection for Mixed Multi-View Data , 2019, J. Mach. Learn. Res..

[16]  Kim-Chuan Toh,et al.  On the equivalence of inexact proximal ALM and ADMM for a class of convex composite programming , 2018, Math. Program..

[17]  Eric C. Chi,et al.  Splitting Methods for Convex Clustering , 2013, Journal of computational and graphical statistics : a joint publication of American Statistical Association, Institute of Mathematical Statistics, Interface Foundation of North America.

[18]  Hosik Choi,et al.  Convex clustering analysis for histogram‐valued data , 2019, Biometrics.

[19]  Joan Serrà,et al.  An empirical evaluation of similarity measures for time series classification , 2014, Knowl. Based Syst..

[20]  Tie Liu,et al.  Convex clustering with metric learning , 2018, Pattern Recognit..

[21]  Jason Xu,et al.  Generalized Linear Model Regression under Distance-to-set Penalties , 2017, NIPS.

[22]  Eter,et al.  Convex clustering via `1 fusion penalization , 2016 .

[23]  Wotao Yin,et al.  Global Convergence of ADMM in Nonconvex Nonsmooth Optimization , 2015, Journal of Scientific Computing.

[24]  Laurent Condat Fast projection onto the simplex and the l1\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\pmb {l}_\mathbf {1}$$\end{ , 2015, Mathematical Programming.

[25]  Francis R. Bach,et al.  Clusterpath: an Algorithm for Clustering using Convex Fusion Penalties , 2011, ICML.

[26]  Qing Zhou,et al.  Solution path clustering with adaptive concave penalty , 2014, 1404.6289.

[27]  P. Schönemann,et al.  A generalized solution of the orthogonal procrustes problem , 1966 .

[28]  Genevera I. Allen,et al.  Convex biclustering , 2014, Biometrics.

[29]  J. Suykens,et al.  Convex Clustering Shrinkage , 2005 .

[30]  Feng Ruan,et al.  Stochastic Methods for Composite and Weakly Convex Optimization Problems , 2017, SIAM J. Optim..