Optimal least-squares unidimensional scaling: improved branch-and-bound procedures and comparison to dynamic programming

DOI10.1007/S11336-002-1032-6MaRDI QIDQ2260052zbMATH OpenOpenAlexFDO

Authors Michael J. Brusco, Stephanie Stahl

Publication date 5 March 2015

Published in Psychometrika (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11336-002-1032-6

zbMATH Keywords

dynamic programmingbranch-and-boundcombinatorial data analysisleast-squares unidimensional scaling

Mathematics Subject Classification ID

Applications of statistics to psychology (62P15) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Dynamic programming (90C39)

Recommendations

• An improved exact algorithm for least-squares unidimensional scaling
• Metric unidimensional scaling and global optimization
• Linear unidimensional scaling in the L₂-norm: Basic optimization methods using MATLAB.
• A permutation-translation simulated annealing algorithm for \(L_{1}\) and \(L_{2}\) unidimensional scaling
• A nonlinear programming approach to metric unidimensional scaling

Cites work

• scientific article; zbMATH DE number 876715 (Why is no real title available?)
• A branch and bound algorithm for maximum likelihood paired comparison ranking
• A branch search algorithm for maximum likelihood paired comparison ranking
• A branch-and-bound algorithm for fitting anti-Robinson structures to symmetric dissimilarity matrices
• An interactive multiobjective programming approach to combinatorial data analysis
• Combinatorial data analysis. Optimization by dynamic programming
• Correspondence analysis and optimal structural representations
• Global optimization in least-squares multidimensional scaling by distance smoothing
• Graph-theoretic representations for proximity matrices through strongly-anti-Robinson or circular strongly-anti-Robinson matrices
• Identifying a reordering of rows and columns for multiple proximity matrices using multiobjective programming
• Linear and circular unidimensional scaling for symmetric proximity matrices
• Linear unidimensional scaling in the \(L_2\)-norm: Basic optimization methods using MATLAB.
• Matrix reorganization and dynamic programming: applications to paired comparisons and unidimensional seriation
• Metric unidimensional scaling and global optimization
• SERIATION USING ASYMMETRIC PROXIMITY MEASURES
• The analysis of proximity matrices through sums of matrices having (anti‐)Robinson forms
• The comparison and fitting of given classification schemes
• The tunneling method for global optimization in multidimensional scaling
• Using quadratic assignment methods to generate initial permutations for least-squares unidimensional scaling of symmetric proximity matrices.

Cited in

(10)

• An exact algorithm for the two-mode \(KL\)-means partitioning problem
• Disentangling relationships in symptom networks using matrix permutation methods
• A note on the estimation of the Pareto efficient set for multiobjective matrix permutation problems
• Residual analysis for unidimensional scaling in the L₂-norm
• Branch and bound algorithm for multidimensional scaling with city-block metric
• A tabu-search heuristic for deterministic two-mode blockmodeling of binary network matrices
• Variable neighborhood search heuristics for selecting a subset of variables in principal component analysis
• An improved exact algorithm for least-squares unidimensional scaling
• Linear unidimensional scaling in the \(L_2\)-norm: Basic optimization methods using MATLAB.
• Heuristic implementation of dynamic programming for matrix permutation problems in combinatorial data analysis

This page was built for publication: Optimal least-squares unidimensional scaling: improved branch-and-bound procedures and comparison to dynamic programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2260052)