A system identification approach to clustering vector autoregressive time series

• URL: http://arxiv.org/abs/2505.14421v1
• Date: Tue, 20 May 2025 14:31:44 GMT
• Title: A system identification approach to clustering vector autoregressive time series
• Authors: Zuogong Yue, Xinyi Wang, Victor Solo,
• Abstract summary: Clustering time series based on their underlying dynamics is keeping attracting researchers due to its impacts on assisting complex system modelling.<n>Most current time series clustering methods handle only scalar time series, treat them as white noise, or rely on domain knowledge for high-quality feature construction.<n>Instead of relying on feature/metric construction, the system identification approach allows treating vector time series clustering by explicitly considering their underlying autoregressive dynamics.
• Score: 50.66782357329375
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Clustering of time series based on their underlying dynamics is keeping attracting researchers due to its impacts on assisting complex system modelling. Most current time series clustering methods handle only scalar time series, treat them as white noise, or rely on domain knowledge for high-quality feature construction, where the autocorrelation pattern/feature is mostly ignored. Instead of relying on heuristic feature/metric construction, the system identification approach allows treating vector time series clustering by explicitly considering their underlying autoregressive dynamics. We first derive a clustering algorithm based on a mixture autoregressive model. Unfortunately it turns out to have significant computational problems. We then derive a `small-noise' limiting version of the algorithm, which we call k-LMVAR (Limiting Mixture Vector AutoRegression), that is computationally manageable. We develop an associated BIC criterion for choosing the number of clusters and model order. The algorithm performs very well in comparative simulations and also scales well computationally.

Related papers

• Concrete Dense Network for Long-Sequence Time Series Clustering [4.307648859471193]
  Time series clustering is fundamental in data analysis for discovering temporal patterns. Deep temporal clustering methods have been trying to integrate the canonical k-means into end-to-end training of neural networks. LoSTer is a novel dense autoencoder architecture for the long-sequence time series clustering problem.
  arXiv  Detail & Related papers  (2024-05-08T12:31:35Z)
• An Efficient Algorithm for Clustered Multi-Task Compressive Sensing [60.70532293880842]
  Clustered multi-task compressive sensing is a hierarchical model that solves multiple compressive sensing tasks. The existing inference algorithm for this model is computationally expensive and does not scale well in high dimensions. We propose a new algorithm that substantially accelerates model inference by avoiding the need to explicitly compute these covariance matrices.
  arXiv  Detail & Related papers  (2023-09-30T15:57:14Z)
• Revisiting Instance-Optimal Cluster Recovery in the Labeled Stochastic Block Model [69.15976031704687]
  We propose IAC (Instance-Adaptive Clustering), the first algorithm whose performance matches the instance-specific lower bounds both in expectation and with high probability.<n>IAC maintains an overall computational complexity of $ mathcalO(n, textpolylog(n) $, making it scalable and practical for large-scale problems.
  arXiv  Detail & Related papers  (2023-06-18T08:46:06Z)
• Time Series Clustering with an EM algorithm for Mixtures of Linear Gaussian State Space Models [0.0]
  We propose a novel model-based time series clustering method with mixtures of linear Gaussian state space models. The proposed method uses a new expectation-maximization algorithm for the mixture model to estimate the model parameters. Experiments on a simulated dataset demonstrate the effectiveness of the method in clustering, parameter estimation, and model selection.
  arXiv  Detail & Related papers  (2022-08-25T07:41:23Z)
• K-ARMA Models for Clustering Time Series Data [4.345882429229813]
  We present an approach to clustering time series data using a model-based generalization of the K-Means algorithm. We show how the clustering algorithm can be made robust to outliers using a least-absolute deviations criteria. We perform experiments on real data which show that our method is competitive with other existing methods for similar time series clustering tasks.
  arXiv  Detail & Related papers  (2022-06-30T18:16:11Z)
• Cluster-and-Conquer: A Framework For Time-Series Forecasting [94.63501563413725]
  We propose a three-stage framework for forecasting high-dimensional time-series data. Our framework is highly general, allowing for any time-series forecasting and clustering method to be used in each step. When instantiated with simple linear autoregressive models, we are able to achieve state-of-the-art results on several benchmark datasets.
  arXiv  Detail & Related papers  (2021-10-26T20:41:19Z)
• Correlation Clustering Reconstruction in Semi-Adversarial Models [70.11015369368272]
  Correlation Clustering is an important clustering problem with many applications. We study the reconstruction version of this problem in which one is seeking to reconstruct a latent clustering corrupted by random noise and adversarial modifications.
  arXiv  Detail & Related papers  (2021-08-10T14:46:17Z)
• Finding Geometric Models by Clustering in the Consensus Space [61.65661010039768]
  We propose a new algorithm for finding an unknown number of geometric models, e.g., homographies. We present a number of applications where the use of multiple geometric models improves accuracy. These include pose estimation from multiple generalized homographies; trajectory estimation of fast-moving objects.
  arXiv  Detail & Related papers  (2021-03-25T14:35:07Z)
• A Robust Speaker Clustering Method Based on Discrete Tied Variational Autoencoder [27.211505187332385]
  Traditional speaker clustering method based on aggregation hierarchy cluster (AHC) has the shortcomings of long-time running and remains sensitive to environment noise. We propose a novel speaker clustering method based on Mutual Information (MI) and a non-linear model with discrete variable, which under the enlightenment of Tied Variational Autoencoder (TVAE) to enhance the robustness against noise.
  arXiv  Detail & Related papers  (2020-03-04T08:54:38Z)
• Autoencoder-based time series clustering with energy applications [0.0]
  Time series clustering is a challenging task due to the specific nature of the data. In this paper we investigate the combination of a convolutional autoencoder and a k-medoids algorithm to perfom time series clustering.
  arXiv  Detail & Related papers  (2020-02-10T10:04:29Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.