An efficient alternating least-squares algorithm to perform multidimensional unfolding
We consider the problem of least-squares fitting of squared distances in unfolding. An alternating procedure is proposed which fixes the row or column configuration in turn and finds the global optimium of the objective criterion with respect to the free parameters, iterating in this fashion until convergence is reached. A considerable simplification in the algorithm results, namely that this conditional global optimum is identified by performing a single unidimensional search for each point, irrespective of the dimensionality of the unfolding solution.
- Least squares metric, unidimensional unfolding
- Three-way metric unfolding via alternating weighted least squares
- scientific article; zbMATH DE number 4204190
- Least squares metric, unidimensional scaling of multivariate linear models
- Avoiding degeneracy in multidimensional unfolding by penalizing on the coefficient of variation
- A generalization of the interpoint distance model
- A Rapidly Convergent Descent Method for Minimization
- Linear Statistical Inference and its Applications
- Metric unfolding: Data requirement for unique solution P clarification of Schönemann's algorithm
- Nonmetric individual differences multidimensional scaling: An alternating least squares method with optimal scaling features
- On a connection between factor analysis and multidimensional unfolding
- On metric multidimensional unfolding
- Solving implicit equations in psychometric data analysis
- GENFOLD 2: A set of models and algorithms for the GENeral unFOLDing analysis of preference/dominance data
- Three-way metric unfolding via alternating weighted least squares
- Fitting longitudinal reduced-rank regression models by alternating least squares
- A general solution for a class of weakly constrained linear regression problems
- Setting up alternating least squares and iterative majorization algorithms for solving various matrix optimization problems
- Optimal scaling by alternating length-constrained nonnegative least squares, with application to distance-based analysis
- Avoiding degeneracy in multidimensional unfolding by penalizing on the coefficient of variation
- Internal multidimensional unfolding about a single-ideal -- a probabilistic solution
- Unfolding a symmetric matrix
- Correspondence and canonical analysis of relational data
- Some properties of the normed alternating least squares (ALS) algorithm
- A new heterogeneous multidimensional unfolding procedure
- UNLOC: optimal unfolding localization from noisy distance data
- A beta unfolding model for continuous bounded responses
- Unfolding-model-based visualization: theory, method and applications
- Gleaning in the field of dual scaling
- Improved bounds for optimal intervals in weakly constrained regression problems
- Least squares metric, unidimensional unfolding
- A model-based approach for visualizing the dimensional structure of ordered successive categories preference data
This page was built for publication: An efficient alternating least-squares algorithm to perform multidimensional unfolding
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1085593)
