A repetitive branch-and-bound procedure for minimum within-cluster sums of squares partitioning

DOI10.1007/s11336-004-1218-1zbMath1306.62387OpenAlexW2066261972WikidataQ51940693 ScholiaQ51940693MaRDI QIDQ2261029

Michael J. Brusco

Publication date: 6 March 2015

Published in: Psychometrika (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11336-004-1218-1

zbMATH Keywords

branch and boundcluster analysis\(K\)-meanscombinatorial data analysis

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Applications of statistics to psychology (62P15)

Related Items (18)

Globally optimal clusterwise regression by column generation enhanced with heuristics, sequencing and ending subset optimization ⋮ K-medoids inverse regression ⋮ Consensus among preference rankings: a new weighted correlation coefficient for linear and weak orderings ⋮ An exact algorithm for semi-supervised minimum sum-of-squares clustering ⋮ SOS-SDP: An Exact Solver for Minimum Sum-of-Squares Clustering ⋮ K‐Plus anticlustering: An improved k‐means criterion for maximizing between‐group similarity ⋮ New and efficient DCA based algorithms for minimum sum-of-squares clustering ⋮ Evaluating a branch-and-bound RLT-based algorithm for minimum sum-of-squares clustering ⋮ Mixed-integer programming techniques for the minimum sum-of-squares clustering problem ⋮ Qualitative properties of the minimum sum-of-squares clustering problem ⋮ Optimising sum-of-squares measures for clustering multisets defined over a metric space ⋮ An improved column generation algorithm for minimum sum-of-squares clustering ⋮ Optimal partitioning of a data set based on the \(p\)-median model ⋮ Extensions to the repetitive branch and bound algorithm for globally optimal clusterwise regression ⋮ An exact algorithm for the two-mode \(KL\)-means partitioning problem ⋮ A comparison of heuristic procedures for minimum within-cluster sums of squares partitioning ⋮ Variable neighborhood search heuristics for selecting a subset of variables in principal component analysis ⋮ An Exact Algorithm for Blockmodeling of Two-Mode Network Data

Uses Software

• AS 136

Cites Work

• A Rasch model for partial credit scoring
• Conditioning on ancillary statistics and loss of information in the presence of nuisance parameters
• On equivalence between a partial credit item and a set of independent Rasch binary items
• On the loss of information in conditional maximum likelihood estimation of item parameters
• Inference and missing data
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A repetitive branch-and-bound procedure for minimum within-cluster sums of squares partitioning