Optimal least-squares unidimensional scaling: improved branch-and-bound procedures and comparison to dynamic programming
From MaRDI portal
Publication:2260052
DOI10.1007/s11336-002-1032-6zbMath1306.62388MaRDI QIDQ2260052
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
dynamic programming; branch-and-bound; combinatorial data analysis; least-squares unidimensional scaling
90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut
90C39: Dynamic programming
62P15: Applications of statistics to psychology
Related Items
An exact algorithm for the two-mode \(KL\)-means partitioning problem, Heuristic implementation of dynamic programming for matrix permutation problems in combinatorial data analysis, A tabu-search heuristic for deterministic two-mode blockmodeling of binary network matrices, Branch and bound algorithm for multidimensional scaling with city-block metric, Variable neighborhood search heuristics for selecting a subset of variables in principal component analysis, An improved exact algorithm for least-squares unidimensional scaling, A note on the estimation of the Pareto efficient set for multiobjective matrix permutation problems
Cites Work
- Unnamed Item
- A branch-and-bound algorithm for fitting anti-Robinson structures to symmetric dissimilarity matrices
- The tunneling method for global optimization in multidimensional scaling
- Matrix reorganization and dynamic programming: applications to paired comparisons and unidimensional seriation
- Correspondence analysis and optimal structural representations
- The comparison and fitting of given classification schemes
- Linear unidimensional scaling in the \(L_2\)-norm: Basic optimization methods using MATLAB.
- Using quadratic assignment methods to generate initial permutations for least-squares unidimensional scaling of symmetric proximity matrices.
- Identifying a reordering of rows and columns for multiple proximity matrices using multiobjective programming
- 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
- An interactive multiobjective programming approach to combinatorial data analysis
- Metric unidimensional scaling and global optimization
- Combinatorial Data Analysis
- A branch search algorithm for maximum likelihood paired comparison ranking
- SERIATION USING ASYMMETRIC PROXIMITY MEASURES
- Linear and circular unidimensional scaling for symmetric proximity matrices
- The analysis of proximity matrices through sums of matrices having (anti‐)Robinson forms
- A branch and bound algorithm for maximum likelihood paired comparison ranking