Pages that link to "Item:Q645896"
From MaRDI portal
The following pages link to Sparse non-negative tensor factorization using columnwise coordinate descent (Q645896):
Displaying 15 items.
- Algorithms for nonnegative matrix and tensor factorizations: a unified view based on block coordinate descent framework (Q742122) (← links)
- Non-negative matrix factorization with fixed row and column sums (Q935373) (← links)
- Smoothed tensor quantile regression estimation for longitudinal data (Q2101389) (← links)
- Alternating proximal gradient method for sparse nonnegative Tucker decomposition (Q2356334) (← links)
- Analysis on a nonnegative matrix factorization and its applications (Q2818250) (← links)
- Exact and Heuristic Algorithms for Semi-Nonnegative Matrix Factorization (Q3195441) (← links)
- Low Rank Tensor Manifold Learning (Q3449322) (← links)
- Newton-based optimization for Kullback–Leibler nonnegative tensor factorizations (Q3458827) (← links)
- A Nonmonotone Alternating Updating Method for a Class of Matrix Factorization Problems (Q4562251) (← links)
- (Q4637064) (← links)
- On Tensors, Sparsity, and Nonnegative Factorizations (Q4918166) (← links)
- Accelerating block coordinate descent for nonnegative tensor factorization (Q5033190) (← links)
- A Columnwise Update Algorithm for Sparse Stochastic Matrix Factorization (Q5057774) (← links)
- Large Margin Low Rank Tensor Analysis (Q5378344) (← links)
- Computing non-negative tensor factorizations (Q5503698) (← links)