English

Deep Temporal Clustering : Fully Unsupervised Learning of Time-Domain Features

Machine Learning 2018-02-06 v1 Machine Learning

Abstract

Unsupervised learning of time series data, also known as temporal clustering, is a challenging problem in machine learning. Here we propose a novel algorithm, Deep Temporal Clustering (DTC), to naturally integrate dimensionality reduction and temporal clustering into a single end-to-end learning framework, fully unsupervised. The algorithm utilizes an autoencoder for temporal dimensionality reduction and a novel temporal clustering layer for cluster assignment. Then it jointly optimizes the clustering objective and the dimensionality reduction objec tive. Based on requirement and application, the temporal clustering layer can be customized with any temporal similarity metric. Several similarity metrics and state-of-the-art algorithms are considered and compared. To gain insight into temporal features that the network has learned for its clustering, we apply a visualization method that generates a region of interest heatmap for the time series. The viability of the algorithm is demonstrated using time series data from diverse domains, ranging from earthquakes to spacecraft sensor data. In each case, we show that the proposed algorithm outperforms traditional methods. The superior performance is attributed to the fully integrated temporal dimensionality reduction and clustering criterion.

Keywords

Cite

@article{arxiv.1802.01059,
  title  = {Deep Temporal Clustering : Fully Unsupervised Learning of Time-Domain Features},
  author = {Naveen Sai Madiraju and Seid M. Sadat and Dimitry Fisher and Homa Karimabadi},
  journal= {arXiv preprint arXiv:1802.01059},
  year   = {2018}
}

Comments

11 pages, 4 Figures, 1 Table

R2 v1 2026-06-23T00:09:56.562Z