Combinatorial Data Analysis
From MaRDI portal
Publication:2723176
DOI10.1137/1.9780898718553zbMath0999.90047OpenAlexW4229588005MaRDI QIDQ2723176
Lawrence J. Hubert, Jacqueline J. Meulman, Phipps Arabie
Publication date: 3 July 2001
Full work available at URL: https://doi.org/10.1137/1.9780898718553
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Combinatorial optimization (90C27) Dynamic programming (90C39) Research exposition (monographs, survey articles) pertaining to statistics (62-02) Research exposition (monographs, survey articles) pertaining to biology (92-02) Applications of statistics to psychology (62P15)
Related Items (37)
Classification of asymmetric proximity data ⋮ An improved exact algorithm for least-squares unidimensional scaling ⋮ Disentangling relationships in symptom networks using matrix permutation methods ⋮ A note on the estimation of the Pareto efficient set for multiobjective matrix permutation problems ⋮ Inducing a blockmodel structure of two-mode binary data using seriation procedures ⋮ An integrated dominance analysis and dynamic programing approach for measuring predictor importance for customer satisfaction ⋮ Residual analysis for unidimensional scaling in the L2-norm ⋮ A continuous rating method for preferential voting: the complete case ⋮ A review of multiobjective programming and its application in quantitative psychology ⋮ Representation of individual differences in rectangular proximity data through anti-Q matrix decomposition ⋮ A branch-and-bound algorithm for fitting anti-Robinson structures to symmetric dissimilarity matrices ⋮ Affinity propagation: An exemplar‐based tool for clustering in psychological research ⋮ Heuristic implementation of dynamic programming for matrix permutation problems in combinatorial data analysis ⋮ Optimal partitioning of a data set based on the \(p\)-median model ⋮ An experimental comparison of seriation methods for one-mode two-way data ⋮ New special cases of the quadratic assignment problem with diagonally structured coefficient matrices ⋮ A structural characterization for certifying Robinsonian matrices ⋮ Exact solution procedures for the balanced unidirectional cyclic layout problem ⋮ ConPar: a method for identifying groups of concordant subject proximity matrices for subsequent multidimensional scaling analyses ⋮ Optimal least-squares unidimensional scaling: improved branch-and-bound procedures and comparison to dynamic programming ⋮ Taxicab correspondence analysis ⋮ Conjunctive prediction of an ordinal criterion variable on the basis of binary predictors ⋮ A New Tractable Case of the QAP with a Robinson Matrix ⋮ Clustering Objects on Subsets of Attributes (with Discussion) ⋮ Graph coloring, minimum-diameter partitioning, and the analysis of confusion matrices ⋮ Order-constrained solutions in \(K\)-means clustering: even better than being globally optimal ⋮ Compact integer-programming models for extracting subsets of stimuli from confusion matrices ⋮ Validating clusters with the lower bound for sum-of-squares error ⋮ A comparison of heuristic procedures for minimum within-cluster sums of squares partitioning ⋮ Three-mode partitioning ⋮ Seriation and matrix reordering methods: An historical overview ⋮ Computing exact clustering posteriors with subset convolution ⋮ An academic genealogy of psychometric society presidents ⋮ A multi-scale seriation algorithm for clustering sparse imbalanced data: application to spike sorting ⋮ Seriation using tree-penalized path length ⋮ The weighted sitting closer to friends than enemies problem in the line ⋮ Identifying a reordering of rows and columns for multiple proximity matrices using multiobjective programming
This page was built for publication: Combinatorial Data Analysis
