A comparison of heuristic procedures for minimum within-cluster sums of squares partitioning
From MaRDI portal
Publication:2517895
DOI10.1007/s11336-007-9013-4zbMath1291.62196OpenAlexW2032362850MaRDI QIDQ2517895
Michael J. Brusco, Douglas Steinley
Publication date: 12 January 2009
Published in: Psychometrika (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11336-007-9013-4
Related Items (22)
K-medoids inverse regression ⋮ On strategies to fix degenerate \(k\)-means solutions ⋮ An empirical comparison and characterisation of nine popular clustering methods ⋮ Evaluating a branch-and-bound RLT-based algorithm for minimum sum-of-squares clustering ⋮ Estimation of panel group structure models with structural breaks in group memberships and coefficients ⋮ Finding cluster centers and sizes via multinomial parameterization ⋮ Optimising sum-of-squares measures for clustering multisets defined over a metric space ⋮ MCS: A method for finding the number of clusters ⋮ Affinity propagation: An exemplar‐based tool for clustering in psychological research ⋮ A tabu-search heuristic for deterministic two-mode blockmodeling of binary network matrices ⋮ Heuristic implementation of dynamic programming for matrix permutation problems in combinatorial data analysis ⋮ An improved column generation algorithm for minimum sum-of-squares clustering ⋮ A variable neighborhood search method for generalized blockmodeling of two-mode binary matrices ⋮ Variable neighbourhood search: methods and applications ⋮ Affinity propagation and uncapacitated facility location problems ⋮ MANOVA, LDA, and FA criteria in clusters parameter estimation ⋮ On the behaviour of \(K\)-means clustering of a dissimilarity matrix by means of full multidimensional scaling ⋮ Variable neighbourhood search: Methods and applications ⋮ Exemplar-based clustering via simulated annealing ⋮ Improving a centroid-based clustering by using suitable centroids from another clustering ⋮ Clustering qualitative data based on binary equivalence relations: neighborhood search heuristics for the clique partitioning problem ⋮ Variable neighborhood search heuristics for selecting a subset of variables in principal component analysis
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimization by Simulated Annealing
- Algorithm AS 136: A K-Means Clustering Algorithm
- OCLUS: an analytic method for generating clusters with known overlap
- An examination of indexes for determining the number of clusters in binary data sets
- Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm
- Solution of large-scale symmetric travelling salesman problems
- Improving dynamic programming strategies for partitioning
- Experiments in projection and clustering by simulated annealing
- Design of hybrids for the minimum sum-of-squares clustering problem
- Optimising \(k\)-means clustering results with standard software packages
- Correspondence analysis and optimal structural representations
- Simulated annealing for selecting optimal initial seeds in the \(K\)-means algorithm
- A repetitive branch-and-bound procedure for minimum within-cluster sums of squares partitioning
- A user's guide to tabu search
- Initializing \(K\)-means batch clustering: A critical evaluation of several techniques
- A variable-selection heuristic for K-means clustering
- Combinatorial Data Analysis
- Tabu Search—Part I
- Tabu Search—Part II
- A Branch and Bound Clustering Algorithm
- Fuzzy Sets and Decisionmaking Approaches in Vowel and Speaker Recognition
- Bandwidth Packing: A Tabu Search Approach
- Model-Based Gaussian and Non-Gaussian Clustering
- A near-optimal initial seed value selection in K-means means algorithm using a genetic algorithm
- Cluster analysis by simulated annealing
- An Interior Point Algorithm for Minimum Sum-of-Squares Clustering
- Multivariate Clustering Procedures with Variable Metrics
- Evaluation of a Branch and Bound Algorithm for Clustering
- J-MEANS: A new local search heuristic for minimum sum of squares clustering
This page was built for publication: A comparison of heuristic procedures for minimum within-cluster sums of squares partitioning
