Combinatorial Data Analysis

DOI10.1137/1.9780898718553zbMath0999.90047MaRDI QIDQ2723176

Jacqueline J. Meulman, Phipps Arabie, Lawrence J. Hubert

Publication date: 3 July 2001

Full work available at URL: https://doi.org/10.1137/1.9780898718553

zbMATH Keywords

seriation; dynamic programming; cluster analysis; combinatorial data analysis; object sequencing

Mathematics Subject Classification ID

62H30: Classification and discrimination; cluster analysis (statistical aspects)

90C27: Combinatorial optimization

90C39: Dynamic programming

62-02: Research exposition (monographs, survey articles) pertaining to statistics

92-02: Research exposition (monographs, survey articles) pertaining to biology

62P15: Applications of statistics to psychology

Related Items

Clustering Objects on Subsets of Attributes (with Discussion), Inducing a blockmodel structure of two-mode binary data using seriation procedures, Optimal partitioning of a data set based on the \(p\)-median model, Order-constrained solutions in \(K\)-means clustering: even better than being globally optimal, Three-mode partitioning, Conjunctive prediction of an ordinal criterion variable on the basis of binary predictors, 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, 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, Validating clusters with the lower bound for sum-of-squares error, A comparison of heuristic procedures for minimum within-cluster sums of squares partitioning