A variable neighborhood search heuristic for nonnegative matrix factorization with application to microarray data
From MaRDI portal
Publication:2070120
DOI10.1007/s11590-020-01619-7zbMath1484.65085OpenAlexW3043305079MaRDI QIDQ2070120
Michael J. Brusco, Douglas Steinley
Publication date: 21 January 2022
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-020-01619-7
Factorization of matrices (15A23) Numerical methods for low-rank matrix approximation; matrix compression (65F55)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
- General variable neighborhood search for the continuous optimization
- Variable neighbourhood search: methods and applications
- Algorithms and applications for approximate nonnegative matrix factorization
- On the equivalence between non-negative matrix factorization and probabilistic latent semantic indexing
- Variable neighborhood search
- Optimal Bayesian clustering using non-negative matrix factorization
- Fuzzy J-means: a new heuristic for fuzzy clustering
- Approximate low-rank factorization with structured factors
- An iterated greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives
- The local minima problem in hierarchical classes analysis: an evaluation of a simulated annealing algorithm and various multistart procedures
- Note: A local-search heuristic for large set-covering problems
- Cut Size Statistics of Graph Bisection Heuristics
- Learning the parts of objects by non-negative matrix factorization
- A Tale of Two Matrix Factorizations
- Handbook of metaheuristics
This page was built for publication: A variable neighborhood search heuristic for nonnegative matrix factorization with application to microarray data
