Deep Clustering with Self-Supervision using Pairwise Similarities

Mohammadreza Sadeghi, Narges Armanfard
5/6/2024
cs.LG

No official code found. Best implementation: Armanfard-Lab/DCSS (33 stars, last commit 2023-04-15).

Abstract

Deep clustering incorporates embedding into clustering to find a lower-dimensional space appropriate for clustering. In this paper, we propose a novel deep clustering framework with self-supervision using pairwise similarities (DCSS). The proposed method consists of two successive phases. In the first phase, we propose to form hypersphere-like groups of similar data points, i.e. one hypersphere per cluster, employing an autoencoder that is trained using cluster-specific losses. The hyper-spheres are formed in the autoencoder's latent space. In the second phase, we propose to employ pairwise similarities to create a $K$-dimensional space that is capable of accommodating more complex cluster distributions, hence providing more accurate clustering performance. $K$ is the number of clusters. The autoencoder's latent space obtained in the first phase is used as the input of the second phase. The effectiveness of both phases is demonstrated on seven benchmark datasets by conducting a rigorous set of experiments.

View on arXivView PDF

Code Implementations(1)

Armanfard-Lab/DCSSCommunity100%

[IEEE Access] Deep Clustering with Self-supervision using Pairwise Data Similarities

339PythonJun 25, 20213 years agoNOASSERTION

Similar Papers

Cite this paper

@article{sadeghi2024deep,
  title  = {Deep Clustering with Self-Supervision using Pairwise Similarities},
  author = {Mohammadreza Sadeghi and Narges Armanfard},
  year   = {2024},
  eprint = {2405.03590},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2405.03590v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2405.03590.svg)](https://codeofpaper.com/paper/2405.03590)

Discussion