SERIATION USING ASYMMETRIC PROXIMITY MEASURES

DOI10.1111/j.2044-8317.1976.tb00701.xzbMath0334.92040OpenAlexW2003602582MaRDI QIDQ4101659

Lawrence J. Hubert

Publication date: 1976

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.1976.tb00701.x

Mathematics Subject Classification ID

Mathematical psychology (91E99) Paired and multiple comparisons; multiple testing (62J15) Applications of statistics to psychology (62P15)

Related Items (25)

Disentangling relationships in symptom networks using matrix permutation methods ⋮ A note on the estimation of the Pareto efficient set for multiobjective matrix permutation problems ⋮ The reversing number of a digraph ⋮ New results on the computation of median orders ⋮ A survey on the linear ordering problem for weighted or unweighted tournaments ⋮ Unnamed Item ⋮ On solving intransitivities in repeated pairwise choices ⋮ Generalized concordance ⋮ Monotonic models for asymmetric proximities ⋮ The circumplex: a slightly stronger than ordinal approach. ⋮ A branch-and-bound algorithm to solve the linear ordering problem for weighted tournaments ⋮ Matrix reorganization and dynamic programming: applications to paired comparisons and unidimensional seriation ⋮ The median procedure in cluster analysis and social choice theory ⋮ 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 ⋮ Ising formulations of some graph-theoretic problems in psychological research: models and methods ⋮ Optimal least-squares unidimensional scaling: improved branch-and-bound procedures and comparison to dynamic programming ⋮ An updated survey on the linear ordering problem for weighted or unweighted tournaments ⋮ On asymptotic non-normality of null distributions of mrpp statistics ⋮ NP-hardness results for the aggregation of linear orders into median orders ⋮ Constructing blockmodels: how and why ⋮ An interactive multiobjective programming approach to combinatorial data analysis ⋮ Compact integer-programming models for extracting subsets of stimuli from confusion matrices ⋮ Seriation and matrix reordering methods: An historical overview ⋮ Identifying a reordering of rows and columns for multiple proximity matrices using multiobjective programming

This page was built for publication: SERIATION USING ASYMMETRIC PROXIMITY MEASURES