Linear and circular unidimensional scaling for symmetric proximity matrices
From MaRDI portal
Publication:4380267
DOI10.1111/j.2044-8317.1997.tb01145.xzbMath0905.92034OpenAlexW2041286960MaRDI QIDQ4380267
Lawrence J. Hubert, Phipps Arabie, Jacqueline J. 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
linear unidimensional scalingsymmetric proximity matrixadditive tree modelscircular unidimensional scaling
Related Items (14)
A Simple and Optimal Algorithm for Strict Circular Seriation ⋮ A note on the estimation of the Pareto efficient set for multiobjective matrix permutation problems ⋮ Residual analysis for unidimensional scaling in the L2-norm ⋮ The circumplex: a slightly stronger than ordinal approach. ⋮ 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 ⋮ Graph-theoretic representations for proximity matrices through strongly-anti-Robinson or circular strongly-anti-Robinson matrices ⋮ Combinatorial optimisation and hierarchical classifications ⋮ Optimal least-squares unidimensional scaling: improved branch-and-bound procedures and comparison to dynamic programming ⋮ Graph coloring, minimum-diameter partitioning, and the analysis of confusion matrices ⋮ An interactive multiobjective programming approach to combinatorial data analysis ⋮ Compact integer-programming models for extracting subsets of stimuli from confusion matrices ⋮ Combinatorial individual differences scaling within the city-block metric ⋮ Identifying a reordering of rows and columns for multiple proximity matrices using multiobjective programming
This page was built for publication: Linear and circular unidimensional scaling for symmetric proximity matrices
