Orthogonal nonnegative matrix factorization problems for clustering: A new formulation and a competitive algorithm

Orthogonal Nonnegative Matrix Factorization (ONMF) with orthogonality constraints on a matrix has been found to provide better clustering results over existing clustering problems. Because of the orthogonality constraint, this optimization problem is difficult to solve. Many of the existing constrai...

Celý popis

Podrobná bibliografia

Vydané v:	Annals of operations research Ročník 339; číslo 3; s. 1481 - 1497
Hlavní autori:	Dehghanpour, Ja’far, Mahdavi-Amiri, Nezam
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York Springer US 01.08.2024 Springer
Predmet:	Algorithms Business and Management Clustering (Computers) Combinatorics Data mining Mathematical optimization Operations Research/Decision Theory Original Research Theory of Computation Iran Isoperimetry problem Clustering Optimization problem with orthogonality constraints Orthogonal Nonnegative Matrix Factorization
ISSN:	0254-5330, 1572-9338
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!