Orthogonal nonnegative matrix factorization problems for clustering: a new formulation and a competitive algorithm
From MaRDI portal
Publication:6601546
Recommendations
- A majorization-minimization based solution to penalized nonnegative matrix factorization with orthogonal regularization
- A competitive optimization approach for data clustering and orthogonal non-negative matrix factorization
- Two efficient algorithms for orthogonal nonnegative matrix factorization
- Two fast vector-wise update algorithms for orthogonal nonnegative matrix factorization with sparsity constraint
- A column-wise update algorithm for nonnegative matrix factorization in Bregman divergence with an orthogonal constraint
Cites work
- scientific article; zbMATH DE number 6381735 (Why is no real title available?)
- scientific article; zbMATH DE number 1818892 (Why is no real title available?)
- A column-wise update algorithm for nonnegative matrix factorization in Bregman divergence with an orthogonal constraint
- A framework of constraint preserving update schemes for optimization on Stiefel manifold
- A hybrid K-means and integer programming method for commercial territory design: a case study in meat distribution
- Approximating K‐means‐type Clustering via Semidefinite Programming
- Benchmarking optimization software with performance profiles.
- Centroid based tree-structured data clustering using vertex/edge overlap and graph edit distance
- Cluster-based outlier detection
- Clustering and outlier detection using isoperimetric number of trees
- Fast nonnegative matrix factorization: an active-set-like method and comparisons
- Hybrid clustering of data and vague concepts based on labels semantics
- Inertial proximal alternating linearized minimization (iPALM) for nonconvex and nonsmooth problems
- Learning From Hidden Traits: Joint Factor Analysis and Latent Clustering
- Low-rank nonnegative matrix factorization on Stiefel manifold
- New node anomaly detection algorithm based on nonnegative matrix factorization for directed citation networks
- On the rate of convergence of the proximal alternating linearized minimization algorithm for convex problems
- On the use of super-efficiency procedures for ranking efficient units and identifying outliers
- Orthogonal nonnegative matrix factorization by sparsity and nuclear norm optimization
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems
- Two fast vector-wise update algorithms for orthogonal nonnegative matrix factorization with sparsity constraint
Cited in
(1)
This page was built for publication: Orthogonal nonnegative matrix factorization problems for clustering: a new formulation and a competitive algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6601546)
