Tensor decompositions for data science
From MaRDI portal
CANDECOMPcanonical polyadic decompositiondata scienceKruskal tensorPARAFACSVDtensor decompositionTucker decomposition
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to linear algebra (15-01) Factorization of matrices (15A23) Multilinear algebra, tensor calculus (15A69) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Computational aspects of data analysis and big data (68T09)
Cited in
(12)- Accelerated alternating least squares for tensor wheel decomposition with applications
- On the estimation of Gaussian moment tensors
- Representation theorems for matrix product states
- Projected tensor-tensor products for efficient computation of optimal multiway data representations
- Quasioptimal alternating projections and their use in low-rank approximation of matrices and tensors
- When big data actually are low-rank, or entrywise approximation of certain function-generated matrices
- Efficient CP rounding using alternating least squares with QR decomposition
- A Sub-linear Low-Rank Solver for Poisson's Equation using Machine Learning Frameworks for GPU Acceleration
- A chiseling algorithm for low-rank Grassmann decomposition of skew-symmetric tensors
- Certificate for orthogonal equivalence of real polynomials by polynomial-weighted principal component analysis
- ReLU-based nonlinear tensor decomposition for sparse nonnegative data
- Parameter estimation of multipath MIMO channels in ISAC systems using canonical polyadic decomposition
This page was built for publication: Tensor decompositions for data science
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6992361)
