Sparse non-negative tensor factorization using columnwise coordinate descent

DOI10.1016/j.patcog.2011.05.015zbMath1225.68233OpenAlexW2110509222MaRDI QIDQ645896

Jieping Ye, Ji Liu, Jun Liu, Peter Wonka

Publication date: 10 November 2011

Published in: Pattern Recognition (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.patcog.2011.05.015

zbMATH Keywords

sparsecolumnwise coordinate descentnon-negativetensor factorization

Mathematics Subject Classification ID

Related Items (10)

Low Rank Tensor Manifold Learning ⋮ Newton-based optimization for Kullback–Leibler nonnegative tensor factorizations ⋮ Exact and Heuristic Algorithms for Semi-Nonnegative Matrix Factorization ⋮ A Nonmonotone Alternating Updating Method for a Class of Matrix Factorization Problems ⋮ Tensor Approximation for Multidimensional and Multivariate Data ⋮ Large Margin Low Rank Tensor Analysis ⋮ Analysis on a Nonnegative Matrix Factorization and Its Applications ⋮ Unnamed Item ⋮ Smoothed tensor quantile regression estimation for longitudinal data ⋮ Alternating proximal gradient method for sparse nonnegative Tucker decomposition

Uses Software

• N-way Toolbox
• ERPWAVELAB

Cites Work

• Unnamed Item
• Algorithms and applications for approximate nonnegative matrix factorization
• Analysis of individual differences in multidimensional scaling via an \(n\)-way generalization of ``Eckart-Young decomposition
• Positive tensor factorization
• Algorithms for Sparse Nonnegative Tucker Decompositions
• A Multilinear Singular Value Decomposition
• Learning the parts of objects by non-negative matrix factorization
• Projected Gradient Methods for Nonnegative Matrix Factorization
• Independent Component Analysis and Blind Signal Separation
• Convergence of a block coordinate descent method for nondifferentiable minimization

This page was built for publication: Sparse non-negative tensor factorization using columnwise coordinate descent