Automated regime detection in multidimensional time series data using sliced Wasserstein k-means clustering

• URL: http://arxiv.org/abs/2310.01285v1
• Date: Mon, 2 Oct 2023 15:37:56 GMT
• Title: Automated regime detection in multidimensional time series data using sliced Wasserstein k-means clustering
• Authors: Qinmeng Luan and James Hamp
• Abstract summary: We study the behaviour of the Wasserstein k-means clustering algorithm applied to time series data. We extend the technique to multidimensional time series data by approximating the multidimensional Wasserstein distance as a sliced Wasserstein distance. We show that the sWk-means method is effective in identifying distinct market regimes in real multidimensional financial time series.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Recent work has proposed Wasserstein k-means (Wk-means) clustering as a powerful method to identify regimes in time series data, and one-dimensional asset returns in particular. In this paper, we begin by studying in detail the behaviour of the Wasserstein k-means clustering algorithm applied to synthetic one-dimensional time series data. We study the dynamics of the algorithm and investigate how varying different hyperparameters impacts the performance of the clustering algorithm for different random initialisations. We compute simple metrics that we find are useful in identifying high-quality clusterings. Then, we extend the technique of Wasserstein k-means clustering to multidimensional time series data by approximating the multidimensional Wasserstein distance as a sliced Wasserstein distance, resulting in a method we call `sliced Wasserstein k-means (sWk-means) clustering'. We apply the sWk-means clustering method to the problem of automated regime detection in multidimensional time series data, using synthetic data to demonstrate the validity of the approach. Finally, we show that the sWk-means method is effective in identifying distinct market regimes in real multidimensional financial time series, using publicly available foreign exchange spot rate data as a case study. We conclude with remarks about some limitations of our approach and potential complementary or alternative approaches.

Related papers

• Clustering Method for Time-Series Images Using Quantum-Inspired Computing Technology [0.0]
  Time-series clustering serves as a powerful data mining technique for time-series data in the absence of prior knowledge about clusters. This study proposes a novel time-series clustering method that leverages an annealing machine.
  arXiv  Detail & Related papers  (2023-05-26T05:58:14Z)
• Rethinking k-means from manifold learning perspective [122.38667613245151]
  We present a new clustering algorithm which directly detects clusters of data without mean estimation. Specifically, we construct distance matrix between data points by Butterworth filter. To well exploit the complementary information embedded in different views, we leverage the tensor Schatten p-norm regularization.
  arXiv  Detail & Related papers  (2023-05-12T03:01:41Z)
• Robust Detection of Lead-Lag Relationships in Lagged Multi-Factor Models [61.10851158749843]
  Key insights can be obtained by discovering lead-lag relationships inherent in the data. We develop a clustering-driven methodology for robust detection of lead-lag relationships in lagged multi-factor models.
  arXiv  Detail & Related papers  (2023-05-11T10:30:35Z)
• Doubly Inhomogeneous Reinforcement Learning [4.334006170547247]
  We propose an original algorithm to determine the best data chunks" that display similar dynamics over time and across individuals for policy learning. Our method is general, and works with a wide range of clustering and change point detection algorithms.
  arXiv  Detail & Related papers  (2022-11-08T03:41:14Z)
• Wasserstein Iterative Networks for Barycenter Estimation [80.23810439485078]
  We present an algorithm to approximate the Wasserstein-2 barycenters of continuous measures via a generative model. Based on the celebrity faces dataset, we construct Ave, celeba! dataset which can be used for quantitative evaluation of barycenter algorithms.
  arXiv  Detail & Related papers  (2022-01-28T16:59:47Z)
• Clustering Market Regimes using the Wasserstein Distance [0.0]
  We outline an unsupervised learning algorithm for clustering financial time-series into a suitable number of temporal segments. We develop a robust algorithm that automates the process of classifying market regimes. In both cases it is shown that the WK-means algorithm vastly outperforms all considered competitor approaches.
  arXiv  Detail & Related papers  (2021-10-22T15:27:52Z)
• Robust Trimmed k-means [70.88503833248159]
  We propose Robust Trimmed k-means (RTKM) that simultaneously identifies outliers and clusters points. We show RTKM performs competitively with other methods on single membership data with outliers and multi-membership data without outliers.
  arXiv  Detail & Related papers  (2021-08-16T15:49:40Z)
• Estimating leverage scores via rank revealing methods and randomization [50.591267188664666]
  We study algorithms for estimating the statistical leverage scores of rectangular dense or sparse matrices of arbitrary rank. Our approach is based on combining rank revealing methods with compositions of dense and sparse randomized dimensionality reduction transforms.
  arXiv  Detail & Related papers  (2021-05-23T19:21:55Z)
• Determinantal consensus clustering [77.34726150561087]
  We propose the use of determinantal point processes or DPP for the random restart of clustering algorithms. DPPs favor diversity of the center points within subsets. We show through simulations that, contrary to DPP, this technique fails both to ensure diversity, and to obtain a good coverage of all data facets.
  arXiv  Detail & Related papers  (2021-02-07T23:48:24Z)
• Spectral Clustering using Eigenspectrum Shape Based Nystrom Sampling [19.675277307158435]
  This paper proposes a scalable Nystrom-based clustering algorithm with a new sampling procedure, Centroid Minimum Sum of Squared Similarities (CMS3), and a on when to use it. Our datasets depends on the eigen spectrum shape of the dataset, and yields competitive low-rank approximations in test compared to the other state-of-the-art methods.
  arXiv  Detail & Related papers  (2020-07-21T17:49:03Z)

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.