Computational solutions for the problem of negative saliences and nonsymmetry in INDSCAL
From MaRDI portal
Cites work
- 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
- Maximum likelihood estimation in multidimensional scaling
- Nonmetric individual differences multidimensional scaling: An alternating least squares method with optimal scaling features
- Some clarifications of the CANDECOMP algorithm applied to INDSCAL
- Some small sample results for maximum likelihood estimation in multidimensional scaling
Cited in
(13)- Convergence of the sequence of parameters generated by alternating least squares algorithms
- Weighted least squares fitting using ordinary least squares algorithms
- A modification of the SINDCLUS algorithm for finding the ADCLUS and INCLUS models
- A modified CANDECOMP method for fitting the extended INDSCAL model
- Typical rank and indscal dimensionality for symmetric three-way arrays of order I 2 2 or I 3 3
- Properties of individual differences scaling and its interpretation
- New properties of common component and specific weight analysis
- On the non-existence of optimal solutions and the occurrence of ``degeneracy in the CANDECOMP/PARAFAC model
- Some new results on orthogonally constrained Candecomp
- An acceleration method for ten Berge et al.'s algorithm for orthogonal INDSCAL
- The \(K\)-INDSCAL model for heterogeneous three-way dissimilarity data
- A trust-region framework for iteration solution of the direct INDSCAL problem in metric multidimensional scaling
- INDSCAL model: geometrical interpretation and methodology
This page was built for publication: Computational solutions for the problem of negative saliences and nonsymmetry in INDSCAL
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1801915)
