Pages that link to "Item:Q4573805"

The following pages link to NeNMF: An Optimal Gradient Method for Nonnegative Matrix Factorization (Q4573805):

Displaying 35 items.

• Multiple graph regularized nonnegative matrix factorization (Q888579) (← links)
• Double indices-induced FCM clustering and its integration with fuzzy subspace clustering (Q903113) (← links)
• Analysis of presence-only data via semi-supervised learning approaches (Q1621212) (← links)
• Improved distributed particle filters for tracking in a wireless sensor network (Q1662043) (← links)
• Graph regularized nonnegative matrix factorization with sparse coding (Q1665056) (← links)
• Accelerated parallel and distributed algorithm using limited internal memory for nonnegative matrix factorization (Q1675555) (← links)
• An oracle inequality for quasi-Bayesian nonnegative matrix factorization (Q1678528) (← links)
• Quadratic regularization projected Barzilai-Borwein method for nonnegative matrix factorization (Q1715914) (← links)
• Pairwise constraints based multiview features fusion for scene classification (Q1760419) (← links)
• A unified global convergence analysis of multiplicative update rules for nonnegative matrix factorization (Q1790683) (← links)
• A novel update rule of HALS algorithm for nonnegative matrix factorization and Zangwill's global convergence (Q2089877) (← links)
• A nonnegative matrix factorization algorithm based on a discrete-time projection neural network (Q2179837) (← links)
• An alternating nonmonotone projected Barzilai-Borwein algorithm of nonnegative factorization of big matrices (Q2238337) (← links)
• Active set type algorithms for nonnegative matrix factorization in hyperspectral unmixing (Q2299008) (← links)
• Incremental graph regulated nonnegative matrix factorization for face recognition (Q2336834) (← links)
• Hierarchical clustering based on the information bottleneck method using a control process (Q2337414) (← links)
• Constructing \(L_1\)-graphs for subspace learning via recurrent neural networks (Q2337448) (← links)
• An efficient monotone projected Barzilai-Borwein method for nonnegative matrix factorization (Q2344463) (← links)
• Analysis on a Nonnegative Matrix Factorization and Its Applications (Q2818250) (← links)
• Accelerating Nonnegative Matrix Factorization Algorithms Using Extrapolation (Q3379602) (← links)
• Block kernel nonnegative matrix factorization for face recognition (Q4626530) (← links)
• Multiplicative Updates for NMF with $\beta$-Divergences under Disjoint Equality Constraints (Q4994438) (← links)
• (Q4998914) (← links)
• An efficient nonmonotone projected Barzilai–Borwein method for nonnegative matrix factorization with extrapolation (Q5031230) (← links)
• Novel Proximal Gradient Methods for Nonnegative Matrix Factorization with Sparsity Constraints (Q5108481) (← links)
• Cyclic Coordinate-Update Algorithms for Fixed-Point Problems: Analysis and Applications (Q5348257) (← links)
• Non-negative Matrix Semi-tensor Factorization for Image Feature Extraction and Clustering (Q5377657) (← links)
• Efficient Nonnegative Matrix Factorization by DC Programming and DCA (Q5380443) (← links)
• A Quasi-Likelihood Approach to Nonnegative Matrix Factorization (Q5380558) (← links)
• Dimensionality-Dependent Generalization Bounds for <i>k</i>-Dimensional Coding Schemes (Q5380581) (← links)
• A converged deep graph semi-NMF algorithm for learning data representation (Q6042581) (← links)
• Efficient Nonnegative Matrix Factorization Via Modified Monotone Barzilai-Borwein Method with Adaptive Step Sizes Strategy (Q6049032) (← links)
• A new nonmonotone spectral projected gradient algorithm for box-constrained optimization problems in \(m \times n\) real matrix space with application in image clustering (Q6056240) (← links)
• Detecting cell assemblies by NMF-based clustering from calcium imaging data (Q6072498) (← links)
• Quasi non-negative quaternion matrix factorization with application to color face recognition (Q6159019) (← links)