Branch-and-bound applications in combinatorial data analysis.
The examination of statistical data is often related to a variety of optimisation problems of a combinatorial nature. Combinatorial problems arise in the clustering of a collection of objects, the ordering of objects, etc. For many of these combinatorial problems, branch-and-bound methods have been proposed and/or developed. It is the aim of this monograph to summarise and illustrate available methods for applying the branch-and-bound process to problems of combinatorial data analysis. The monograph is organised in three parts. The first part focuses on applications for partitioning a set of objects based on various criteria. The second part describes branch-and-bound approaches for seriation of a collection of objects. Finally, the third part addresses the plausibility of branch-and-bound methods for variable selection in multivariable data analysis, focusing particularly on cluster and regression analyses. The book is well suited to all students and researchers interested in the implementation of branch-and-bound procedures for the statistical analysis of data.
- Evaluation of a Branch and Bound Algorithm for Clustering
- A Branch-and-Bound Approach Using Polyhedral Results for a Clustering Problem
- A repetitive branch-and-bound procedure for minimum within-cluster sums of squares partitioning
- Combinatorial data analysis. Optimization by dynamic programming
- A parallel branch-and-bound method for cluster analysis
- Combinatorial individual differences scaling within the city-block metric
- A graph approach to generate all possible regression submodels
- Branch and bound algorithm for multidimensional scaling with city-block metric
- Are discoveries spurious? Distributions of maximum spurious correlations and their applications
- An experimental comparison of seriation methods for one-mode two-way data
- An iterated greedy heuristic for a market segmentation problem with multiple attributes
- Extensions to the repetitive branch and bound algorithm for globally optimal clusterwise regression
- 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
- Ising formulations of some graph-theoretic problems in psychological research: models and methods
- Taxicab correspondence analysis
- Sequential composition of linear systems' clans
- A multi-scale seriation algorithm for clustering sparse imbalanced data: application to spike sorting
- An improved exact algorithm for least-squares unidimensional scaling
- Median constrained bucket order rank aggregation
- Multiobjective blockmodeling for social network analysis
- Representation of individual differences in rectangular proximity data through anti-Q matrix decomposition
- Combinatorial data analysis. Optimization by dynamic programming
- An Exact Algorithm for Blockmodeling of Two-Mode Network Data
- Globally optimal clusterwise regression by column generation enhanced with heuristics, sequencing and ending subset optimization
- An improved branch-and-bound clustering approach for data partitioning
- A bicriterion algorithm for the allocation of cross-trained workers based on operational and human resource objectives
- scientific article; zbMATH DE number 4164560 (Why is no real title available?)
- Exact and approximate methods for a one-dimensional minimax bin-packing problem
- A Branch-and-Bound Approach Using Polyhedral Results for a Clustering Problem
- scientific article; zbMATH DE number 1107546 (Why is no real title available?)
- Exact and approximate algorithms for variable selection in linear discriminant analysis
- Book review of: J. Kogan, Introduction to clustering large and high-dimensional data
- Heuristic implementation of dynamic programming for matrix permutation problems in combinatorial data analysis
- Seriation and matrix reordering methods: An historical overview
- Residual analysis for unidimensional scaling in the L2-norm
- Constrained clustering by constraint programming
- A structural characterization for certifying Robinsonian matrices
- An exact algorithm for the two-mode \(KL\)-means partitioning problem
- Globally optimal univariate spline approximations
- A review of multiobjective programming and its application in quantitative psychology
- Integer programming in psychology: a review and directions for future research
- Extending the bicriterion approach for anticlustering: exact and hybrid approaches
- Parallel branch and bound for multidimensional scaling with city-block distances
- Dense and sparse graph partition
- A sampling-based exact algorithm for the solution of the minimax diameter clustering problem
- Inducing a blockmodel structure of two-mode binary data using seriation procedures
- An exact method for partitioning dichotomous items within the framework of the monotone homogeneity model
- Optimal partitioning of a data set based on the \(p\)-median model
- Maximum cut in fuzzy nature: models and algorithms
- Branch and bound method for multiobjective pairing selection
- Order-constrained solutions in \(K\)-means clustering: even better than being globally optimal
This page was built for publication: Branch-and-bound applications in combinatorial data analysis.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5706832)
