Transformed K-means Clustering

11/27/2021
by   Anurag Goel, et al.
0

In this work we propose a clustering framework based on the paradigm of transform learning. In simple terms the representation from transform learning is used for K-means clustering; however, the problem is not solved in such a naïve piecemeal fashion. The K-means clustering loss is embedded into the transform learning framework and the joint problem is solved using the alternating direction method of multipliers. Results on document clustering show that our proposed approach improves over the state-of-the-art.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/10/2019

Transformed Subspace Clustering

Subspace clustering assumes that the data is sepa-rable into separate su...
research
06/26/2018

Deep k-Means: Jointly Clustering with k-Means and Learning Representations

We study in this paper the problem of jointly clustering and learning re...
research
07/26/2018

Simplex Representation for Subspace Clustering

Spectral clustering based methods have achieved leading performance on s...
research
10/17/2019

Deep clustering with concrete k-means

We address the problem of simultaneously learning a k-means clustering a...
research
06/02/2019

On The Radon--Nikodym Spectral Approach With Optimal Clustering

Problems of interpolation, classification, and clustering are considered...
research
09/16/2020

Too Much Information Kills Information: A Clustering Perspective

Clustering is one of the most fundamental tools in the artificial intell...
research
03/29/2013

On the symmetrical Kullback-Leibler Jeffreys centroids

Due to the success of the bag-of-word modeling paradigm, clustering hist...

Please sign up or login with your details

Forgot password? Click here to reset