A competitive optimization approach for data clustering and orthogonal non-negative matrix factorization

DOI10.1007/s10288-020-00445-yzbMath1528.62033OpenAlexW3110470031MaRDI QIDQ6057712

Ja'far Dehghanpour-Sahron, Nezam Mahdavi-Amiri

Publication date: 26 October 2023

Published in: 4OR (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10288-020-00445-y

zbMATH Keywords

clusteringmultilevel methodoptimization problemnormalized \(k\)-cutorthogonal non-negative matrix factorization

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Numerical mathematical programming methods (65K05) Combinatorial optimization (90C27)

Cites Work

• Unnamed Item
• Unnamed Item
• A feasible method for optimization with orthogonality constraints
• A framework of constraint preserving update schemes for optimization on Stiefel manifold
• Clustering and outlier detection using isoperimetric number of trees
• On the isoperimetric spectrum of graphs and its approximations
• Fast Nonnegative Matrix Factorization: An Active-Set-Like Method and Comparisons
• Two-Point Step Size Gradient Methods
• Approximating K‐means‐type Clustering via Semidefinite Programming
• Benchmarking optimization software with performance profiles.

This page was built for publication: A competitive optimization approach for data clustering and orthogonal non-negative matrix factorization