Parallel Candecomp/Parafac decomposition of sparse tensors using dimension trees
From MaRDI portal
Recommendations
- A Practical Randomized CP Tensor Decomposition
- MuLOT: multi-level optimization of the canonical polyadic tensor decomposition at large-scale
- Parallel Algorithms for Computing the Tensor-Train Decomposition
- Decomposition-by-normalization (DBN): leveraging approximate functional dependencies for efficient CP and Tucker decompositions
- Computing dense tensor decompositions with optimal dimension trees
Cites work
- A comparison of algorithms for fitting the PARAFAC model
- Analysis of individual differences in multidimensional scaling via an \(n\)-way generalization of ``Eckart-Young decomposition
- Efficient MATLAB Computations with Sparse and Factored Tensors
- Hierarchical Singular Value Decomposition of Tensors
- scientific article; zbMATH DE number 49142 (Why is no real title available?)
- scientific article; zbMATH DE number 2045481 (Why is no real title available?)
- Natural language processing with Python.
- On two-dimensional sparse matrix partitioning: models, methods, and a recipe
- Tensor Decompositions and Applications
- Tensor rank is NP-complete
Cited in
(14)- Decomposition-by-normalization (DBN): leveraging approximate functional dependencies for efficient CP and Tucker decompositions
- Computing dense tensor decompositions with optimal dimension trees
- Parallel tensor methods for high-dimensional linear PDEs
- Parallel active subspace decomposition for tensor robust principal component analysis
- Tensor Deflation for CANDECOMP/PARAFAC— Part II: Initialization and Error Analysis
- Turbo‐SMT: Parallel coupled sparse matrix‐Tensor factorizations and applications
- Incremental CP tensor decomposition by alternating minimization method
- Comparison of Accuracy and Scalability of Gauss--Newton and Alternating Least Squares for CANDECOMC/PARAFAC Decomposition
- Software for Sparse Tensor Decomposition on Emerging Computing Architectures
- Computing the gradient in optimization algorithms for the CP decomposition in constant memory through tensor blocking
- Alternating Mahalanobis Distance Minimization for Accurate and Well-Conditioned CP Decomposition
- Parallel approximation of multidimensional tensors using GPUs
- Parallel Algorithms for Computing the Tensor-Train Decomposition
- Efficient randomized algorithms for fixed precision problem of approximate Tucker decomposition
Describes a project that uses
Uses Software
This page was built for publication: Parallel Candecomp/Parafac decomposition of sparse tensors using dimension trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4603494)
