Explicit Candecomp/Parafac solutions for a contrived 2\(\times 2\times 2\) array of rank three

Related Items (16)

Three-factor association models for three-way contingency tables ⋮ On Best Low Rank Approximation of Positive Definite Tensors ⋮ Some new results on orthogonally constrained Candecomp ⋮ An acceleration method for ten Berge et al.'s algorithm for orthogonal INDSCAL ⋮ Constrained Candecomp/Parafac via the Lasso ⋮ On the non-existence of optimal solutions and the occurrence of ``degeneracy in the CANDECOMP/PARAFAC model ⋮ Some clarifications of the CANDECOMP algorithm applied to INDSCAL ⋮ Subtracting a best rank‐1 approximation from p × p × 2(p≥2) tensors ⋮ Degeneracy in Candecomp/Parafac explained for \(p\times p\times 2\) arrays of rank \(p+1\) or higher ⋮ PARAFAC: Parallel factor analysis ⋮ Subtracting a best rank-1 approximation may increase tensor rank ⋮ Computational solutions for the problem of negative saliences and nonsymmetry in INDSCAL ⋮ Convergence of the sequence of parameters generated by alternating least squares algorithms ⋮ News Algorithms for tensor decomposition based on a reduced functional ⋮ A note on the parameter set for factor analysis models ⋮ Guarantees for Existence of a Best Canonical Polyadic Approximation of a Noisy Low-Rank Tensor

Uses Software

Cites Work

This page was built for publication: Explicit Candecomp/Parafac solutions for a contrived 2\(\times 2\times 2\) array of rank three