Global optimization in any Minkowski metric: A permutation-translation simulated annealing algorithm for multidimensional scaling
From MaRDI portal
Publication:1015451
DOI10.1007/s00357-007-0020-1zbMath1159.91469OpenAlexW1972873547MaRDI QIDQ1015451
Alex Murillo, Willem J. Heiser, J. Fernando Vera
Publication date: 8 May 2009
Published in: Journal of Classification (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00357-007-0020-1
Approximation methods and heuristics in mathematical programming (90C59) One- and multidimensional scaling in the social and behavioral sciences (91C15)
Related Items (14)
Cluster differences unfolding for two-way two-mode preference rating data ⋮ A comparison of simulated annealing algorithms for variable selection in principal component analysis and discriminant analysis ⋮ Non-stationary spatial covariance structure estimation in oversampled domains by cluster differences scaling with spatial constraints ⋮ Residual analysis for unidimensional scaling in the L2-norm ⋮ ADCLUS and INDCLUS: analysis, experimentation, and meta-heuristic algorithm extensions ⋮ Representation of individual differences in rectangular proximity data through anti-Q matrix decomposition ⋮ A dual latent class unfolding model for two-way two-mode preference rating data ⋮ Parallel branch and bound for multidimensional scaling with city-block distances ⋮ A latent class MDS model with spatial constraints for non-stationary spatial covariance estimation ⋮ Cluster Optimized Proximity Scaling ⋮ Parallel Global Optimization in Multidimensional Scaling ⋮ A global simulated annealing heuristic for the three-parameter lognormal maximum likelihood estimation ⋮ A latent class multidimensional scaling model for two-way one-mode continuous rating dissimilarity data ⋮ Exemplar-based clustering via simulated annealing
Uses Software
This page was built for publication: Global optimization in any Minkowski metric: A permutation-translation simulated annealing algorithm for multidimensional scaling
