Linear and circular unidimensional scaling for symmetric proximity matrices

DOI10.1111/J.2044-8317.1997.TB01145.XMaRDI QIDQ4380267zbMATH OpenOpenAlexFDO

Authors Lawrence Hubert, Phipps Arabie, Jacqueline Meulman

Publication date 24 January 1999

Published in British Journal of Mathematical and Statistical Psychology (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1111/j.2044-8317.1997.tb01145.x

zbMATH Keywords

additive tree modelscircular unidimensional scalinglinear unidimensional scalingsymmetric proximity matrix

Mathematics Subject Classification ID

One- and multidimensional scaling in the social and behavioral sciences (91C15)

Recommendations

• The Representation of Symmetric Proximity Data: Dimensions and Classifications
• A nonlinear programming approach to metric unidimensional scaling
• A simulated annealing heuristic for unidimensional and multidimensional (city-block) scaling of symmetric proximity matrices.
• A permutation-translation simulated annealing algorithm for \(L_{1}\) and \(L_{2}\) unidimensional scaling
• Least squares metric, unidimensional scaling of multivariate linear models

Cited in

(21)

• Combinatorial individual differences scaling within the city-block metric
• Constrained unidimensional scaling with application to genomics
• A nonlinear programming approach to metric unidimensional scaling
• The circumplex: a slightly stronger than ordinal approach.
• Linear unidimensional scaling in the L₂-norm: Basic optimization methods using MATLAB.
• Integer programming methods for seriation and unidimensional scaling of proximity matrices: A review and some extensions.
• Graph coloring, minimum-diameter partitioning, and the analysis of confusion matrices
• Identifying a reordering of rows and columns for multiple proximity matrices using multiobjective programming
• Graph-theoretic representations for proximity matrices through strongly-anti-Robinson or circular strongly-anti-Robinson matrices
• Optimal least-squares unidimensional scaling: improved branch-and-bound procedures and comparison to dynamic programming
• Combinatorial optimisation and hierarchical classifications
• An interactive multiobjective programming approach to combinatorial data analysis
• Compact integer-programming models for extracting subsets of stimuli from confusion matrices
• A note on the estimation of the Pareto efficient set for multiobjective matrix permutation problems
• The Representation of Symmetric Proximity Data: Dimensions and Classifications
• A branch-and-bound algorithm for fitting anti-Robinson structures to symmetric dissimilarity matrices
• Heuristic implementation of dynamic programming for matrix permutation problems in combinatorial data analysis
• Residual analysis for unidimensional scaling in the L₂-norm
• A Simple and Optimal Algorithm for Strict Circular Seriation
• Modeling consumer ratings: the trade-off between quality and consumer preference
• Hierarchical trees can be perfectly scaled in one dimension

This page was built for publication: Linear and circular unidimensional scaling for symmetric proximity matrices

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