An acceleration method for ten Berge et al.'s algorithm for orthogonal INDSCAL

DOI10.1007/s00180-010-0184-6zbMath1226.65038OpenAlexW2095112579MaRDI QIDQ650692

Kwanghee Jung, Yoshio Takane, Heungsun Hwang

Publication date: 26 November 2011

Published in: Computational Statistics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00180-010-0184-6

zbMATH Keywords

multi-way data analysisdynamical system algorithmminimal polynomial extrapolation (MPE)singular value decomposition (SVD) algorithm

Mathematics Subject Classification ID

Factor analysis and principal components; correspondence analysis (62H25) Factorization of matrices (15A23) Determinants, permanents, traces, other special matrix functions (15A15) Numerical computation of matrix norms, conditioning, scaling (65F35) Canonical forms, reductions, classification (15A21)

Related Items (3)

Speeding up the convergence of the alternating least squares algorithm using vector \(\varepsilon\) acceleration and restarting for nonlinear principal component analysis ⋮ Generalized GIPSCAL re-revisited: a fast convergent algorithm with acceleration by the minimal polynomial extrapolation ⋮ DINDSCAL: direct INDSCAL

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the non-existence of optimal solutions and the occurrence of ``degeneracy in the CANDECOMP/PARAFAC model
• The varimax criterion for analytic rotation in factor analysis
• Fast indirect robust generalized method of moments
• A joint treatment of varimax rotation and the problem of diagonalizing symmetric matrices simultaneously in the least-squares sense
• Some clarifications of the CANDECOMP algorithm applied to INDSCAL
• Hierarchical relations among three-way methods
• A new computational method to fit the weighted Euclidean distance model
• A generalization of GIPSCAL for the analysis of nonsymmetric data
• Computational solutions for the problem of negative saliences and nonsymmetry in INDSCAL
• Degeneracy in Candecomp/Parafac explained for \(p\times p\times 2\) arrays of rank \(p+1\) or higher
• The assumption of proportional components when Candecomp is applied to symmetric matrices in the context of INDSCAL
• Analysis of individual differences in multidimensional scaling via an \(n\)-way generalization of ``Eckart-Young decomposition
• Explicit Candecomp/Parafac solutions for a contrived 2\(\times 2\times 2\) array of rank three
• Extrapolation Methods for Vector Sequences
• An Algorithm for Simultaneous Orthogonal Transformation of Several Positive Definite Symmetric Matrices to Nearly Diagonal Form
• Computational Science and Its Applications – ICCSA 2004
• 11 Applications of Multidimensional Scaling in Psychometrics

This page was built for publication: An acceleration method for ten Berge et al.'s algorithm for orthogonal INDSCAL