Simplicity and typical rank results for three-way arrays (Q629174)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Simplicity and typical rank results for three-way arrays	scientific article

Statements

scholarly article

0 references

Simplicity and typical rank results for three-way arrays (English)

0 references

Jos M. F. ten Berge

0 references

0 references

publication date

8 March 2011

0 references

zbMATH Keywords

tensor decomposition

0 references

tensor rank

0 references

typical rank

0 references

sparse arrays

0 references

CANDECOMP/PARAFAC

0 references

Tucker component analysis

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/s11336-010-9193-1

0 references

The assumption of proportional components when Candecomp is applied to symmetric matrices in the context of INDSCAL

0 references

Analysis of individual differences in multidimensional scaling via an \(n\)-way generalization of ``Eckart-Young'' decomposition

0 references

Some Numerical Results on the Rank of Generic Three-Way Arrays over $\mathbb{R}$

0 references

Generic and typical ranks of multi-way arrays

0 references

A Link between the Canonical Decomposition in Multilinear Algebra and Simultaneous Matrix Diagonalization

0 references

Kruskal's Permutation Lemma and the Identification of CANDECOMP/PARAFAC and Bilinear Models with Constant Modulus Constraints

0 references

Three-way SIMPLIMAX for oblique rotation of the three-mode factor analysis core to simple structure.

0 references

Uniqueness of three-mode factor models with sparse cores: The \(3\times 3\times 3\) case

0 references

Tensor Decompositions and Applications

0 references

Principal component analysis of three-mode data by means of alternating least squares algorithms

0 references

Three-way arrays: rank and uniqueness of trilinear decompositions, with application to arithmetic complexity and statistics

0 references

A case of extreme simplicity of the core matrix in three-mode principal components analysis

0 references

Transforming three-way arrays to maximal simplicity

0 references

On uniqueness conditions for Candecomp/Parafac and Indscal with full column rank in one mode

0 references

Kruskal's condition for uniqueness in Candecomp/Parafac when ranks and \(k\)-ranks coincide

0 references

Sufficient conditions for uniqueness in Candecomp/Parafac and Indscal with random component matrices

0 references

On Kruskal's uniqueness condition for the Candecomp/Parafac decomposition

0 references

Typical ranks for \(m\times n\times (m-1)n\) tensors with \(m \leq n\)

0 references

Kruskal's polynomial for \(2 \times{}2 \times{}2\) arrays and a generalization to \(2 \times{}n \times{}n\) arrays

0 references

The typical rank of tall three-way arrays

0 references

Simplicity of core arrays in three-way principal component analysis and the typical rank of \(p\times q\times 2\) arrays

0 references

On uniqueness in CANDECOMP/PARAFAC

0 references

Typical rank and indscal dimensionality for symmetric three-way arrays of order \(I\times 2\times 2\) or \(I\times 3\times 3\)

0 references

Symmetry transformations for square sliced three-way arrays, with applications to their typical rank

0 references

The Carroll and Chang conjecture of equal Indscal components when Candecomp/Parafac gives perfect fit

0 references

Simplicity transformations for three-way arrays with symmetric slices, and applications to Tucker-3 models with sparse core arrays

0 references

Identifiers

zbMATH Open document ID

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

zbMATH DE Number

0 references

0 references

10.1007/S11336-010-9193-1

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:629174

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q629174&oldid=38422917"