TasksSotADatasetsPapersMethodsSubmitAbout
Papers With Code 2

A community resource for machine learning research: papers, code, benchmarks, and state-of-the-art results.

Explore

Notable BenchmarksAll SotADatasetsPapersMethods

Community

Submit ResultsAbout

Data sourced from the PWC Archive (CC-BY-SA 4.0). Built by the community, for the community.

Papers/N2D: (Not Too) Deep Clustering via Clustering the Local Ma...

N2D: (Not Too) Deep Clustering via Clustering the Local Manifold of an Autoencoded Embedding

Ryan McConville, Raul Santos-Rodriguez, Robert J. Piechocki, Ian Craddock

2019-08-16Deep ClusteringRepresentation LearningTime Series ClusteringImage ClusteringClusteringTime SeriesTime Series Analysis
PaperPDFCodeCodeCodeCode(official)Code

Abstract

Deep clustering has increasingly been demonstrating superiority over conventional shallow clustering algorithms. Deep clustering algorithms usually combine representation learning with deep neural networks to achieve this performance, typically optimizing a clustering and non-clustering loss. In such cases, an autoencoder is typically connected with a clustering network, and the final clustering is jointly learned by both the autoencoder and clustering network. Instead, we propose to learn an autoencoded embedding and then search this further for the underlying manifold. For simplicity, we then cluster this with a shallow clustering algorithm, rather than a deeper network. We study a number of local and global manifold learning methods on both the raw data and autoencoded embedding, concluding that UMAP in our framework is best able to find the most clusterable manifold in the embedding, suggesting local manifold learning on an autoencoded embedding is effective for discovering higher quality discovering clusters. We quantitatively show across a range of image and time-series datasets that our method has competitive performance against the latest deep clustering algorithms, including out-performing current state-of-the-art on several. We postulate that these results show a promising research direction for deep clustering. The code can be found at https://github.com/rymc/n2d

Results

TaskDatasetMetricValueModel
Image ClusteringFashion-MNISTAccuracy0.672N2D (UMAP)
Image ClusteringFashion-MNISTNMI0.684N2D (UMAP)
Image ClusteringMNIST-fullAccuracy0.987N2D (UMAP)
Image ClusteringMNIST-fullNMI0.964N2D (UMAP)
Image ClusteringpendigitsAccuracy0.885N2D (UMAP)
Image ClusteringpendigitsNMI0.863N2D (UMAP)
Image ClusteringUSPSAccuracy0.958N2D (UMAP)
Image ClusteringUSPSNMI0.901N2D (UMAP)
Image ClusteringMNIST-testAccuracy0.948N2D (UMAP)
Image ClusteringMNIST-testNMI0.882N2D (UMAP)
Image ClusteringHARAccuracy0.801N2D (UMAP)
Image ClusteringHARNMI0.683N2D (UMAP)

Related Papers

Touch in the Wild: Learning Fine-Grained Manipulation with a Portable Visuo-Tactile Gripper2025-07-20Volatility Spillovers and Interconnectedness in OPEC Oil Markets: A Network-Based log-ARCH Approach2025-07-20Tri-Learn Graph Fusion Network for Attributed Graph Clustering2025-07-18Spectral Bellman Method: Unifying Representation and Exploration in RL2025-07-17Boosting Team Modeling through Tempo-Relational Representation Learning2025-07-17MoTM: Towards a Foundation Model for Time Series Imputation based on Continuous Modeling2025-07-17The Power of Architecture: Deep Dive into Transformer Architectures for Long-Term Time Series Forecasting2025-07-17Emergence of Functionally Differentiated Structures via Mutual Information Optimization in Recurrent Neural Networks2025-07-17