Efficient preconditioning for noisy separable nonnegative matrix factorization problems by successive projection based low-rank approximations
Authors:
- Tomohiko MizutaniTMTomohiko Mizutani
- Mirai TanakaMTMirai Tanaka
- 26 October 2017
- journal article
- conference paper
- Published by Springer Nature in Machine Learning
- Vol. 107 (4) , 643-673
Abstract
No abstract availableKeywords
Funding Information
- Japan Society for the Promotion of Science (JP) (JSPS KAKENHI Grant Number 15K20986, JSPS KAKENHI Grant Number 26242027)
This publication has 34 references indexed in Scilit:
- Robustness analysis of preconditioned successive projection algorithm for general form of separable NMF problemLinear Algebra and its Applications, 2016
- Noisy Matrix Completion Using Alternating MinimizationLecture Notes in Computer Science, 2013
- On a decomposition lemma for positive semi-definite block-matricesLinear Algebra and its Applications, 2012
- On selecting a maximum volume sub-matrix of a matrix and related problemsTheoretical Computer Science, 2009
- Introduction to Information Retrieval2008
- Convex Optimization2004
- The successive projections algorithm for variable selection in spectroscopic multicomponent analysisChemometrics and Intelligent Laboratory Systems, 2001
- Latent Semantic Indexing: A Probabilistic AnalysisJournal of Computer and System Sciences, 2000
- Linear least squares solutions by householder transformationsNumerische Mathematik, 1965
- The Approximation of One Matrix by Another of Lower RankPsychometrika, 1936