scientific article; zbMATH DE number 2016125
From MaRDI portal
Publication:4438855
zbMath1028.68642MaRDI QIDQ4438855
Publication date: 10 December 2003
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2504/25040336.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (18)
Latent Low-Rank Representation ⋮ Orthogonal incremental non-negative matrix factorization algorithm and its application in image classification ⋮ Convex nonnegative matrix factorization with manifold regularization ⋮ Novel Proximal Gradient Methods for Nonnegative Matrix Factorization with Sparsity Constraints ⋮ Hybrid Kronecker Product Decomposition and Approximation ⋮ Nonnegative Low Rank Matrix Completion by Riemannian Optimalization Methods ⋮ Efficient nonnegative matrix factorization via projected Newton method ⋮ Orthogonal Nonnegative Matrix Factorization by Sparsity and Nuclear Norm Optimization ⋮ Nonnegative low rank matrix approximation for nonnegative matrices ⋮ Nonnegative matrix factorization for spectral data analysis ⋮ Numerical method for the generalized nonnegative tensor factorization problem ⋮ Analyzing Raman spectral data without separabiliy assumption ⋮ Algorithms for nonnegative matrix factorization with the Kullback-Leibler divergence ⋮ A unified global convergence analysis of multiplicative update rules for nonnegative matrix factorization ⋮ Clustering-based initialization for non-negative matrix factorization ⋮ Incremental subspace learning via non-negative matrix factorization ⋮ Exploiting associations between word clusters and document classes for cross‐domain text categorization† ⋮ Pairwise constrained concept factorization for data representation
Uses Software
This page was built for publication:
