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á bibliografie

Vydáno v:	Annals of operations research Ročník 339; číslo 3; s. 1481 - 1497
Hlavní autoři:	Dehghanpour, Ja’far, Mahdavi-Amiri, Nezam
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York Springer US 01.08.2024 Springer
Témata:	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 přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!