A simulated annealing heuristic for unidimensional and multidimensional (city-block) scaling of symmetric proximity matrices.
From MaRDI portal
Publication:1566107
DOI10.1007/s00357-0003-4zbMath1040.91080OpenAlexW2053511090MaRDI QIDQ1566107
Publication date: 2001
Published in: Journal of Classification (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00357-0003-4
simulated annealingcombinatorial programmingmetric multidimensional scalingunidimensional scalingcity-block distance
Software, source code, etc. for problems pertaining to game theory, economics, and finance (91-04) One- and multidimensional scaling in the social and behavioral sciences (91C15)
Related Items
Residual analysis for unidimensional scaling in the L2-norm ⋮ ADCLUS and INDCLUS: analysis, experimentation, and meta-heuristic algorithm extensions ⋮ Parallel hybrid algorithm for global optimization of problems occurring in MDS-based visualization ⋮ Representation of individual differences in rectangular proximity data through anti-Q matrix decomposition ⋮ The CLASSI-N method for the study of sequential processes ⋮ Heuristic implementation of dynamic programming for matrix permutation problems in combinatorial data analysis ⋮ Two level minimization in multidimensional scaling ⋮ CLASSI: A classification model for the study of sequential processes and individual differences therein ⋮ Parallel branch and bound for multidimensional scaling with city-block distances ⋮ A hybrid method for multidimensional scaling using city-block distances ⋮ Parallel Global Optimization in Multidimensional Scaling ⋮ The local minima problem in hierarchical classes analysis: an evaluation of a simulated annealing algorithm and various multistart procedures ⋮ A latent class multidimensional scaling model for two-way one-mode continuous rating dissimilarity data ⋮ Branch and bound algorithm for multidimensional scaling with city-block metric ⋮ The real-valued model of hierarchical classes
