SE-shapelets: Semi-supervised Clustering of Time Series Using Representative Shapelets

• URL: http://arxiv.org/abs/2304.03292v2
• Date: Wed, 15 Nov 2023 01:48:05 GMT
• Title: SE-shapelets: Semi-supervised Clustering of Time Series Using Representative Shapelets
• Abstract summary: Shapelets that discriminate time series using local features (subsequences) are promising for time series clustering. Existing time series clustering methods may fail to capture representative shapelets because they discover shapelets from a large pool of uninformative subsequences. This paper proposes a Semi-supervised Clustering of Time Series Using Representative Shapelets (SE-Shapelets) method.
• Score: 4.988132948960276
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Shapelets that discriminate time series using local features (subsequences) are promising for time series clustering. Existing time series clustering methods may fail to capture representative shapelets because they discover shapelets from a large pool of uninformative subsequences, and thus result in low clustering accuracy. This paper proposes a Semi-supervised Clustering of Time Series Using Representative Shapelets (SE-Shapelets) method, which utilizes a small number of labeled and propagated pseudo-labeled time series to help discover representative shapelets, thereby improving the clustering accuracy. In SE-Shapelets, we propose two techniques to discover representative shapelets for the effective clustering of time series. 1) A \textit{salient subsequence chain} ($SSC$) that can extract salient subsequences (as candidate shapelets) of a labeled/pseudo-labeled time series, which helps remove massive uninformative subsequences from the pool. 2) A \textit{linear discriminant selection} ($LDS$) algorithm to identify shapelets that can capture representative local features of time series in different classes, for convenient clustering. Experiments on UCR time series datasets demonstrate that SE-shapelets discovers representative shapelets and achieves higher clustering accuracy than counterpart semi-supervised time series clustering methods.

Related papers

• CLUES-WEASEL: No additional clues required to choose your time series clustering algorithm [0.4145742235679815]
  CLUES-WEASEL stands for CLustering with the UnsupervisEd Second version of Word ExtrAction for time SEries cLassification.<n>We present a novel time series clustering algorithm that we call CLUES-WEASEL, which stands for CLustering with the UnsupervisEd Second version of Word ExtrAction for time SEries cLassification.
  arXiv  Detail & Related papers  (2026-09-07T15:15:01Z)
• QSMP: finding representative time series subsequences through Quick Shift+Matrix Profile [0.764671395172401]
  Finding representative waveforms in long time series has scientific and practical value in many domains.<n>We present here QSMP, a method to find representative waveforms in long time series through a density-guided clustering of time series subsequences.
  arXiv  Detail & Related papers  (2026-08-16T02:45:25Z)
• ShapeX: Shapelet-Driven Post Hoc Explanations for Time Series Classification Models [111.27770361128056]
  We present ShapeX, an innovative framework that segments time series into meaningful shapelet-driven segments.<n>At the core of ShapeX lies the Shapelet Describe-and-Detect framework, which effectively learns a diverse set of shapelets essential for classification.
  arXiv  Detail & Related papers  (2025-10-23T00:01:40Z)
• A system identification approach to clustering vector autoregressive time series [50.66782357329375]
  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.
  arXiv  Detail & Related papers  (2025-05-20T14:31:44Z)
• Fuzzy Cluster-Aware Contrastive Clustering for Time Series [1.435214708535728]
  Traditional unsupervised clustering methods often fail to capture the complex nature of time series data. We propose a fuzzy cluster-aware contrastive clustering framework (FCACC) that jointly optimize representation learning and clustering. Our approach introduces a novel three-view data augmentation strategy to enhance feature extraction by leveraging various characteristics of time series data.
  arXiv  Detail & Related papers  (2025-03-28T07:59:23Z)
• Dynamic Multi-Network Mining of Tensor Time Series [8.59982222642104]
  Subsequence clustering of time series is an essential task in data mining. We present a new method, Dynamic Multinetwork time series clustering (DMM) Our method outperforms the state-of-the-art methods in terms of clustering accuracy.
  arXiv  Detail & Related papers  (2024-02-19T02:06:04Z)
• Determining the Optimal Number of Clusters for Time Series Datasets with Symbolic Pattern Forest [0.0]
  The problem of calculating the optimal number of clusters (say k) is one of the significant challenges for such methods. In this work, we extended the Symbolic Pattern Forest algorithm to determine the optimal number of clusters for the time series datasets. We tested our approach on the UCR archive datasets, and our experimental results so far showed significant improvement over the baseline.
  arXiv  Detail & Related papers  (2023-10-01T23:33:37Z)
• Reinforcement Graph Clustering with Unknown Cluster Number [91.4861135742095]
  We propose a new deep graph clustering method termed Reinforcement Graph Clustering. In our proposed method, cluster number determination and unsupervised representation learning are unified into a uniform framework. In order to conduct feedback actions, the clustering-oriented reward function is proposed to enhance the cohesion of the same clusters and separate the different clusters.
  arXiv  Detail & Related papers  (2023-08-13T18:12:28Z)
• Fuzzy clustering of ordinal time series based on two novel distances with economic applications [0.12891210250935145]
  Two novel distances between ordinal time series are introduced and used to construct fuzzy clustering procedures. The resulting clustering algorithms are computationally efficient and able to group series generated from similar processes. Two specific applications involving economic time series illustrate the usefulness of the proposed approaches.
  arXiv  Detail & Related papers  (2023-04-24T16:39:22Z)
• AUTOSHAPE: An Autoencoder-Shapelet Approach for Time Series Clustering [38.98898783270346]
  We propose a novel autoencoder-shapelet approach (AUTOSHAPE) for determining shapelets in an unsupervised manner. An autoencoder is specially designed to learn high-quality shapelets. We present extensive experiments on AUTOSHAPE.
  arXiv  Detail & Related papers  (2022-08-06T06:00:45Z)
• Implicit Sample Extension for Unsupervised Person Re-Identification [97.46045935897608]
  Clustering sometimes mixes different true identities together or splits the same identity into two or more sub clusters. We propose an Implicit Sample Extension (OurWholeMethod) method to generate what we call support samples around the cluster boundaries. Experiments demonstrate that the proposed method is effective and achieves state-of-the-art performance for unsupervised person Re-ID.
  arXiv  Detail & Related papers  (2022-04-14T11:41:48Z)
• 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)
• Self-supervised Contrastive Attributed Graph Clustering [110.52694943592974]
  We propose a novel attributed graph clustering network, namely Self-supervised Contrastive Attributed Graph Clustering (SCAGC) In SCAGC, by leveraging inaccurate clustering labels, a self-supervised contrastive loss, are designed for node representation learning. For the OOS nodes, SCAGC can directly calculate their clustering labels.
  arXiv  Detail & Related papers  (2021-10-15T03:25:28Z)
• Novel Features for Time Series Analysis: A Complex Networks Approach [62.997667081978825]
  Time series data are ubiquitous in several domains as climate, economics and health care. Recent conceptual approach relies on time series mapping to complex networks. Network analysis can be used to characterize different types of time series.
  arXiv  Detail & Related papers  (2021-10-11T13:46:28Z)
• Hierarchical Clustering using Auto-encoded Compact Representation for Time-series Analysis [8.660029077292346]
  We propose a novel mechanism to identify the clusters combining learned compact representation of time-series, Auto Encoded Compact Sequence (AECS) and hierarchical clustering approach. Our algorithm exploits Recurrent Neural Network (RNN) based under complete Sequence to Sequence(seq2seq) autoencoder and agglomerative hierarchical clustering.
  arXiv  Detail & Related papers  (2021-01-11T08:03:57Z)
• Supervised Feature Subset Selection and Feature Ranking for Multivariate Time Series without Feature Extraction [78.84356269545157]
  We introduce supervised feature ranking and feature subset selection algorithms for MTS classification. Unlike most existing supervised/unsupervised feature selection algorithms for MTS our techniques do not require a feature extraction step to generate a one-dimensional feature vector from the time series.
  arXiv  Detail & Related papers  (2020-05-01T07:46: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.