mlsanityData to 14 Oct 2026

Hierarchical Clustering using Auto-encoded Compact Representation for Time-series Analysis

arXiv 2101.03742 ↗First posted 11 Jan 2021cs.LG cs.AIcited by 2

Not on the map. Why?

Abstract (arXiv)

Getting a robust time-series clustering with best choice of distance measure and appropriate representation is always a challenge. 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. Proposed algorithm aims to address the large computing time issue of hierarchical clustering as learned latent representation AECS has a length much less than the original length of time-series and at the same time want to enhance its performance.Our algorithm exploits Recurrent Neural Network (RNN) based under complete Sequence to Sequence(seq2seq) autoencoder and agglomerative hierarchical clustering with a choice of best distance measure to recommend the best clustering. Our scheme selects the best distance measure and corresponding clustering for both univariate and multivariate time-series. We have experimented with real-world time-series from UCR and UCI archive taken from diverse application domains like health, smart-city, manufacturing etc. Experimental results show that proposed method not only produce close to benchmark results but also in some cases outperform the benchmark.

Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 3 of its 33 references that are in the map. First posted on arXiv 11 Jan 2021.

Builds on

3 of 33 references.

References · 3

  1. 2014Sequence to Sequence Learning with Neural Networkscited by 2,986
  2. 2018The UEA multivariate time series classification archive, 2018cited by 338
  3. 2018Multivariate LSTM-FCNs for Time Series Classificationcited by 120

Built on by

Cited by year

Citing papers per year: 2021: 1; 2022: 1.

2 papers.