A comparison of algorithms for fitting the PARAFAC model
From MaRDI portal
Publication:959265
DOI10.1016/j.csda.2004.11.013zbMath1445.62136OpenAlexW2047680880WikidataQ59430915 ScholiaQ59430915MaRDI QIDQ959265
Publication date: 11 December 2008
Published in: Computational Statistics and Data Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.csda.2004.11.013
Related Items (56)
Estimating latent trends in multivariate longitudinal data via Parafac2 with functional and structural constraints ⋮ Finding the limit of diverging components in three-way Candecomp/Parafac -- a demonstration of its practical merits ⋮ Tensor decomposition for learning Gaussian mixtures from moments ⋮ Blind PARAFAC signal detection for polarization sensitive array ⋮ A new method of moments for latent variable models ⋮ The Optimization Landscape for Fitting a Rank-2 Tensor with a Rank-1 Tensor ⋮ Newton-based optimization for Kullback–Leibler nonnegative tensor factorizations ⋮ Simultaneous component analysis by means of Tucker3 ⋮ A nonlinearly preconditioned conjugate gradient algorithm for rank‐R canonical tensor approximation ⋮ An ATLD-ALS method for the trilinear decomposition of large third-order tensors ⋮ High-order tensor estimation via trains of coupled third-order CP and Tucker decompositions ⋮ PARAFAC-based channel estimation and data recovery in nonlinear MIMO spread spectrum communication systems ⋮ Some convergence results on the regularized alternating least-squares method for tensor decomposition ⋮ Alternating Mahalanobis Distance Minimization for Accurate and Well-Conditioned CP Decomposition ⋮ Alternating cyclic vector extrapolation technique for accelerating nonlinear optimization algorithms and fixed-point mapping applications ⋮ Optimization via separated representations and the canonical tensor decomposition ⋮ Covariate-Assisted Sparse Tensor Completion ⋮ Parameter identifiability in a class of random graph mixture models ⋮ Parallel Candecomp/Parafac Decomposition of Sparse Tensors Using Dimension Trees ⋮ Computing the polyadic decomposition of nonnegative third order tensors ⋮ Unnamed Item ⋮ A Riemannian Trust Region Method for the Canonical Tensor Rank Approximation Problem ⋮ Hierarchical multilinear models for multiway data ⋮ Reduction of multivariate mixtures and its applications ⋮ A proximal ANLS algorithm for nonnegative tensor factorization with a periodic enhanced line search. ⋮ Line search and trust region strategies for canonical decomposition of semi-nonnegative semi-symmetric 3rd order tensors ⋮ Multiparametric response surface construction by means of proper generalized decomposition: an extension of the PARAFAC procedure ⋮ Constrained Candecomp/Parafac via the Lasso ⋮ On the non-existence of optimal solutions and the occurrence of ``degeneracy in the CANDECOMP/PARAFAC model ⋮ Exploiting Efficient Representations in Large-Scale Tensor Decompositions ⋮ A robust Parafac model for compositional data ⋮ Estimating Higher-Order Moments Using Symmetric Tensor Decomposition ⋮ On the equivalence between low-rank matrix completion and tensor rank ⋮ A Practical Randomized CP Tensor Decomposition ⋮ Nonlinear system modeling and identification using Volterra‐PARAFAC models ⋮ A comparison of algorithms for fitting the PARAFAC model ⋮ FFT-based Kronecker product approximation to micromagnetic long-range interactions ⋮ Independent component analysis for~three-way data with an application from~atmospheric science ⋮ Direction finding via biquaternion matrix diagonalization with vector-sensors ⋮ Iterative methods for the canonical decomposition of multi-way arrays: application to blind underdetermined mixture identification ⋮ Randomized interpolative decomposition of separated representations ⋮ Degeneracy in Candecomp/Parafac and Indscal explained for several three-sliced arrays with a two-valued typical rank ⋮ Turbo‐SMT: Parallel coupled sparse matrix‐Tensor factorizations and applications ⋮ Randomized Alternating Least Squares for Canonical Tensor Decompositions: Application to A PDE With Random Data ⋮ On uniqueness conditions for Candecomp/Parafac and Indscal with full column rank in one mode ⋮ On best rank-2 and rank-(2,2,2) approximations of order-3 tensors ⋮ Editorial: Special issue on statistical algorithms and software ⋮ Riemannian Newton optimization methods for the symmetric tensor approximation problem ⋮ The Dynamics of Swamps in the Canonical Tensor Approximation Problem ⋮ Incremental CP Tensor Decomposition by Alternating Minimization Method ⋮ Coupled Canonical Polyadic Decompositions and (Coupled) Decompositions in Multilinear Rank- $(L_{r,n},L_{r,n},1)$ Terms---Part II: Algorithms ⋮ A fast alternating least squares method for third-order tensors based on a compression procedure ⋮ Unnamed Item ⋮ Comparison of Accuracy and Scalability of Gauss--Newton and Alternating Least Squares for CANDECOMC/PARAFAC Decomposition ⋮ Computing the Gradient in Optimization Algorithms for the CP Decomposition in Constant Memory through Tensor Blocking ⋮ Numerical optimization for symmetric tensor decomposition
Uses Software
Cites Work
- A comparison of algorithms for fitting the PARAFAC model
- CANDELINC: A general approach to multidimensional analysis of many-way arrays with linear constraints on parameters
- Analysis of individual differences in multidimensional scaling via an \(n\)-way generalization of ``Eckart-Young decomposition
- An Algorithm for Least-Squares Estimation of Nonlinear Parameters
- A method for the solution of certain non-linear problems in least squares
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A comparison of algorithms for fitting the PARAFAC model
