arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1512.07548stat.ML
收藏

k-Means聚类是矩阵分解

k-Means Clustering Is Matrix Factorization

Christian Bauckhage

摘要:

我们表明,传统的k-均值聚类的目标函数可以表示为Frobenius范数的差异的数据矩阵和低秩近似的数据矩阵。简而言之,我们证明了k-means聚类是一个矩阵分解问题。这些注释旨在作为参考,并旨在为文献中经常提到但很少明确的结果提供指导。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑