k-Means Clustering Is Matrix Factorization

12/23/2015
by   Christian Bauckhage, et al.
0

We show that the objective function of conventional k-means clustering can be expressed as the Frobenius norm of the difference of a data matrix and a low rank approximation of that data matrix. In short, we show that k-means clustering is a matrix factorization problem. These notes are meant as a reference and intended to provide a guided tour towards a result that is often mentioned but seldom made explicit in the literature.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/23/2014

Matrix factorization with Binary Components

Motivated by an application in computational biology, we consider low-ra...
research
06/18/2012

Clustering by Low-Rank Doubly Stochastic Matrix Decomposition

Clustering analysis by nonnegative low-rank approximations has achieved ...
research
05/04/2020

Robust Non-Linear Matrix Factorization for Dictionary Learning, Denoising, and Clustering

Low dimensional nonlinear structure abounds in datasets across computer ...
research
12/07/2022

On the Global Solution of Soft k-Means

This paper presents an algorithm to solve the Soft k-Means problem globa...
research
12/14/2021

Regularized Orthogonal Nonnegative Matrix Factorization and K-means Clustering

In this work, we focus on connections between K-means clustering approac...
research
12/31/2014

ACCAMS: Additive Co-Clustering to Approximate Matrices Succinctly

Matrix completion and approximation are popular tools to capture a user'...
research
12/08/2016

Complex Matrix Factorization for Face Recognition

This work developed novel complex matrix factorization methods for face ...

Please sign up or login with your details

Forgot password? Click here to reset