A hybrid method for multidimensional scaling using city-block distances
From MaRDI portal
Publication:999136
DOI10.1007/s00186-008-0238-5zbMath1159.90023OpenAlexW1992158718MaRDI QIDQ999136
Julius Žilinskas, Antanas Žilinskas
Publication date: 30 January 2009
Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00186-008-0238-5
Applications of mathematical programming (90C90) Quadratic programming (90C20) Combinatorial optimization (90C27)
Related Items (2)
Cloud Computing Approach for Intelligent Visualization of Multidimensional Data ⋮ Parallel branch and bound for multidimensional scaling with city-block distances
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A permutation-translation simulated annealing algorithm for \(L_{1}\) and \(L_{2}\) unidimensional scaling
- Was Euclid an unnecessarily sophisticated psychologist?
- On global optimization in two-dimensional scaling
- A simulated annealing heuristic for unidimensional and multidimensional (city-block) scaling of symmetric proximity matrices.
- Estimating the city-block two-dimensional scaling model with simulated annealing
- The majorization approach to multidimensional scaling for Minkowski distances
- Testing heuristics: We have it all wrong
- Global optimization in least-squares multidimensional scaling by distance smoothing
- Parallel hybrid algorithm for global optimization of problems occurring in MDS-based visualization
- Two level minimization in multidimensional scaling
- Modern multidimensional scaling. Theory and applications.
- The Structural Representation of Proximity Matrices with MATLAB
This page was built for publication: A hybrid method for multidimensional scaling using city-block distances