Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
175 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
42 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Regularized Orthogonal Nonnegative Matrix Factorization and $K$-means Clustering (2112.07641v1)

Published 14 Dec 2021 in math.NA and cs.NA

Abstract: In this work, we focus on connections between $K$-means clustering approaches and Orthogonal Nonnegative Matrix Factorization (ONMF) methods. We present a novel framework to extract the distance measure and the centroids of the $K$-means method based on first order conditions of the considered ONMF objective function, which exploits the classical alternating minimization schemes of Nonnegative Matrix Factorization (NMF) algorithms. While this technique is characterized by a simple derivation procedure, it can also be applied to non-standard regularized ONMF models. Using this framework, we consider in this work ONMF models with $\ell_1$ and standard $\ell_2$ discrepancy terms with an additional elastic net regularization on both factorization matrices and derive the corresponding distance measures and centroids of the generalized $K$-means clustering model. Furthermore, we give an intuitive view of the obtained results, examine special cases and compare them to the findings described in the literature.

Citations (1)

Summary

We haven't generated a summary for this paper yet.