scientific article; zbMATH DE number 6533779

MaRDI QIDQ3465201zbMATH OpenFDO

Authors Emil M. Nasirov

Publication date 20 January 2016

zbMATH Keywords

parallel computationcomputational linguistics

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Parallel numerical computation (65Y05) Factorization of matrices (15A23) Natural language processing (68T50)

Recommendations

• Algorithms for nonnegative matrix and tensor factorizations: a unified view based on block coordinate descent framework
• On Sparse Block Factorization Iterative Methods
• Accelerating block coordinate descent for nonnegative tensor factorization
• Some results on sparse block factorization iterative methods
• scientific article; zbMATH DE number 6379366
• scientific article; zbMATH DE number 440681
• On the complexity of the block low-rank multifrontal factorization
• Sparse block factorization of saddle point matrices

Cited in

(6)

• Accelerating block coordinate descent for nonnegative tensor factorization
• A method for effective non-negative factorization of linguistic tensors
• Non-negative tensor and matrix factorization methods for natural language processing
• Blocks approach of non-negative huge linguistic sparse matrix and tensors factorization using latent Dirichlet allocation
• Parallel nonnegative matrix factorization algorithm on the distributed memory platform
• Block-diagonal approach to non-negative factorization of sparse linguistic matrices and tensors of extra-large dimension using the latent Dirichlet distribution

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3465201)