Combinatorial data analysis. Optimization by dynamic programming
Research exposition (monographs, survey articles) pertaining to statistics (62-02) Classification and discrimination; cluster analysis (statistical aspects) (62H30) Applications of statistics to psychology (62P15) Combinatorial optimization (90C27) Dynamic programming (90C39) Research exposition (monographs, survey articles) pertaining to biology (92-02)
The book discusses the application of dynamic programming type algorithms to problems in combinatorial data analysis. The flexibility of the dynamic programming method is highlighted on a variety of different problems with an emphasis on cluster analysis and object sequencing and seriation. Moreover, in the clustering and sequencing context, the general dynamic programming approach is modified to a heuristic procedure to efficiently handle large data sets. An appendix is included that can be used as a users manual describing the operation of nineteen programs available as freeware on one of the authors webpage. The programs are related to the individual algorithms described in the preceding chapters and applicable, for example, for object partitioning, hierarchical clustering, object sequencing and seriation, and the construction of ordered partitions.
- Three-mode partitioning
- Dynamic programming and convex clustering
- 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
- 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
- A continuous rating method for preferential voting: the complete case
- Seriation in combinatorial and statistical data analysis
- Seriation using tree-penalized path length
- The weighted sitting closer to friends than enemies problem in the line
- Disentangling relationships in symptom networks using matrix permutation methods
- Optimal least-squares unidimensional scaling: improved branch-and-bound procedures and comparison to dynamic programming
- Taxicab correspondence analysis
- An academic genealogy of psychometric society presidents
- A multi-scale seriation algorithm for clustering sparse imbalanced data: application to spike sorting
- An improved exact algorithm for least-squares unidimensional scaling
- Representation of individual differences in rectangular proximity data through anti-Q matrix decomposition
- 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
- 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
- Classification of asymmetric proximity data
- Computing exact clustering posteriors with subset convolution
- A note on the estimation of the Pareto efficient set for multiobjective matrix permutation problems
- scientific article; zbMATH DE number 17540 (Why is no real title available?)
- Affinity propagation: An exemplar‐based tool for clustering in psychological research
- A branch-and-bound algorithm for fitting anti-Robinson structures to symmetric dissimilarity matrices
- Clustering Objects on Subsets of Attributes (with Discussion)
- Heuristic implementation of dynamic programming for matrix permutation problems in combinatorial data analysis
- scientific article; zbMATH DE number 907944 (Why is no real title available?)
- Seriation and matrix reordering methods: An historical overview
- 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 structural characterization for certifying Robinsonian matrices
- scientific article; zbMATH DE number 2231543 (Why is no real title available?)
- A new tractable case of the QAP with a Robinson matrix
- A review of multiobjective programming and its application in quantitative psychology
- Integer programming in psychology: a review and directions for future research
- Maximum augmented Zagreb index on polyomino chains
- Inducing a blockmodel structure of two-mode binary data using seriation procedures
- A combinatorial structure ensuring applicability of the dynamic programming method
- 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
This page was built for publication: Combinatorial data analysis. Optimization by dynamic programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2723176)
