An acceleration method for ten Berge et al.'s algorithm for orthogonal INDSCAL
DOI10.1007/S00180-010-0184-6zbMATH Open1226.65038OpenAlexW2095112579MaRDI QIDQ650692FDOQ650692
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
Recommendations
multi-way data analysisdynamical system algorithmminimal polynomial extrapolation (MPE)singular value decomposition (SVD) algorithm
Factor analysis and principal components; correspondence analysis (62H25) Factorization of matrices (15A23) Numerical computation of matrix norms, conditioning, scaling (65F35) Determinants, permanents, traces, other special matrix functions (15A15) Canonical forms, reductions, classification (15A21)
Cites Work
- Title not available (Why is that?)
- Analysis of individual differences in multidimensional scaling via an \(n\)-way generalization of ``Eckart-Young decomposition
- Title not available (Why is that?)
- An Algorithm for Simultaneous Orthogonal Transformation of Several Positive Definite Symmetric Matrices to Nearly Diagonal Form
- A new computational method to fit the weighted Euclidean distance model
- Explicit Candecomp/Parafac solutions for a contrived 2\(\times 2\times 2\) array of rank three
- A joint treatment of varimax rotation and the problem of diagonalizing symmetric matrices simultaneously in the least-squares sense
- Extrapolation Methods for Vector Sequences
- The varimax criterion for analytic rotation in factor analysis
- The assumption of proportional components when Candecomp is applied to symmetric matrices in the context of INDSCAL
- Title not available (Why is that?)
- Hierarchical relations among three-way methods
- Degeneracy in Candecomp/Parafac explained for \(p\times p\times 2\) arrays of rank \(p+1\) or higher
- On the non-existence of optimal solutions and the occurrence of ``degeneracy in the CANDECOMP/PARAFAC model
- Computational solutions for the problem of negative saliences and nonsymmetry in INDSCAL
- Title not available (Why is that?)
- Some clarifications of the CANDECOMP algorithm applied to INDSCAL
- Title not available (Why is that?)
- A generalization of GIPSCAL for the analysis of nonsymmetric data
- Computational Science and Its Applications – ICCSA 2004
- 11 Applications of Multidimensional Scaling in Psychometrics
- Fast indirect robust generalized method of moments
Cited In (4)
- Generalized GIPSCAL re-revisited: a fast convergent algorithm with acceleration by the minimal polynomial extrapolation
- Some clarifications of the TUCKALS2 algorithm applied to the IDIOSCAL problem
- Speeding up the convergence of the alternating least squares algorithm using vector \(\varepsilon\) acceleration and restarting for nonlinear principal component analysis
- DINDSCAL: direct INDSCAL
This page was built for publication: An acceleration method for ten Berge et al.'s algorithm for orthogonal INDSCAL
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q650692)
