arXiv Open Access 2015

k-Means Clustering Is Matrix Factorization

Christian Bauckhage

Lihat Sumber

Abstrak

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.

Topik & Kata Kunci

stat.ML

Penulis (1)

Christian Bauckhage

Format Sitasi

APA MLA BibTeX

Bauckhage, C. (2015). k-Means Clustering Is Matrix Factorization. https://arxiv.org/abs/1512.07548

Akses Cepat

Lihat di Sumber

Informasi Jurnal

Tahun Terbit: 2015
Bahasa: en
Sumber Database: arXiv
Akses: Open Access ✓