A comparison of algorithms for fitting the PARAFAC model

From MaRDI portal
Revision as of 18:52, 30 January 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:959265

DOI10.1016/J.CSDA.2004.11.013zbMath1445.62136OpenAlexW2047680880WikidataQ59430915 ScholiaQ59430915MaRDI QIDQ959265

Giorgio Tomasi, Rasmus Bro

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 constraintsFinding the limit of diverging components in three-way Candecomp/Parafac -- a demonstration of its practical meritsTensor decomposition for learning Gaussian mixtures from momentsBlind PARAFAC signal detection for polarization sensitive arrayA new method of moments for latent variable modelsThe Optimization Landscape for Fitting a Rank-2 Tensor with a Rank-1 TensorNewton-based optimization for Kullback–Leibler nonnegative tensor factorizationsSimultaneous component analysis by means of Tucker3A nonlinearly preconditioned conjugate gradient algorithm for rank‐R canonical tensor approximationAn ATLD-ALS method for the trilinear decomposition of large third-order tensorsHigh-order tensor estimation via trains of coupled third-order CP and Tucker decompositionsPARAFAC-based channel estimation and data recovery in nonlinear MIMO spread spectrum communication systemsSome convergence results on the regularized alternating least-squares method for tensor decompositionAlternating Mahalanobis Distance Minimization for Accurate and Well-Conditioned CP DecompositionAlternating cyclic vector extrapolation technique for accelerating nonlinear optimization algorithms and fixed-point mapping applicationsOptimization via separated representations and the canonical tensor decompositionCovariate-Assisted Sparse Tensor CompletionParameter identifiability in a class of random graph mixture modelsParallel Candecomp/Parafac Decomposition of Sparse Tensors Using Dimension TreesComputing the polyadic decomposition of nonnegative third order tensorsUnnamed ItemA Riemannian Trust Region Method for the Canonical Tensor Rank Approximation ProblemHierarchical multilinear models for multiway dataReduction of multivariate mixtures and its applicationsA 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 tensorsMultiparametric response surface construction by means of proper generalized decomposition: an extension of the PARAFAC procedureConstrained Candecomp/Parafac via the LassoOn the non-existence of optimal solutions and the occurrence of ``degeneracy in the CANDECOMP/PARAFAC modelExploiting Efficient Representations in Large-Scale Tensor DecompositionsA robust Parafac model for compositional dataEstimating Higher-Order Moments Using Symmetric Tensor DecompositionOn the equivalence between low-rank matrix completion and tensor rankA Practical Randomized CP Tensor DecompositionNonlinear system modeling and identification using Volterra‐PARAFAC modelsA comparison of algorithms for fitting the PARAFAC modelFFT-based Kronecker product approximation to micromagnetic long-range interactionsIndependent component analysis for~three-way data with an application from~atmospheric scienceDirection finding via biquaternion matrix diagonalization with vector-sensorsIterative methods for the canonical decomposition of multi-way arrays: application to blind underdetermined mixture identificationRandomized interpolative decomposition of separated representationsDegeneracy in Candecomp/Parafac and Indscal explained for several three-sliced arrays with a two-valued typical rankTurbo‐SMT: Parallel coupled sparse matrix‐Tensor factorizations and applicationsRandomized Alternating Least Squares for Canonical Tensor Decompositions: Application to A PDE With Random DataOn uniqueness conditions for Candecomp/Parafac and Indscal with full column rank in one modeOn best rank-2 and rank-(2,2,2) approximations of order-3 tensorsEditorial: Special issue on statistical algorithms and softwareRiemannian Newton optimization methods for the symmetric tensor approximation problemThe Dynamics of Swamps in the Canonical Tensor Approximation ProblemIncremental CP Tensor Decomposition by Alternating Minimization MethodCoupled Canonical Polyadic Decompositions and (Coupled) Decompositions in Multilinear Rank- $(L_{r,n},L_{r,n},1)$ Terms---Part II: AlgorithmsA fast alternating least squares method for third-order tensors based on a compression procedureUnnamed ItemComparison of Accuracy and Scalability of Gauss--Newton and Alternating Least Squares for CANDECOMC/PARAFAC DecompositionComputing the Gradient in Optimization Algorithms for the CP Decomposition in Constant Memory through Tensor BlockingNumerical optimization for symmetric tensor decomposition


Uses Software



Cites Work




This page was built for publication: A comparison of algorithms for fitting the PARAFAC model