A comparison of heuristic procedures for minimum within-cluster sums of squares partitioning
From MaRDI portal
Publication:2517895
Recommendations
- A heuristic algorithm for solving the minimum sum-of-squares clustering problems
- A repetitive branch-and-bound procedure for minimum within-cluster sums of squares partitioning
- Minimization subproblems and heuristics for an applied clustering problem
- A tabu search approach for the minimum sum-of-squares clustering problem
- A scatter search approach for the minimum sum-of-squares clustering problem
- Evaluating a branch-and-bound RLT-based algorithm for minimum sum-of-squares clustering
- Qualitative properties of the minimum sum-of-squares clustering problem
- Review of basic local searches for solving the minimum sum-of-squares clustering problem
- Less is more: simple algorithms for the minimum sum of squares clustering problem
- A new nonsmooth optimization algorithm for minimum sum-of-squares clustering problems
Cites work
- A Branch and Bound Clustering Algorithm
- A near-optimal initial seed value selection in K-means means algorithm using a genetic algorithm
- A repetitive branch-and-bound procedure for minimum within-cluster sums of squares partitioning
- A user's guide to tabu search
- A variable-selection heuristic for K-means clustering
- Algorithm AS 136: A K-Means Clustering Algorithm
- An examination of indexes for determining the number of clusters in binary data sets
- An Interior Point Algorithm for Minimum Sum-of-Squares Clustering
- Bandwidth Packing: A Tabu Search Approach
- Cluster analysis by simulated annealing
- Combinatorial data analysis. Optimization by dynamic programming
- Correspondence analysis and optimal structural representations
- Design of hybrids for the minimum sum-of-squares clustering problem
- Evaluation of a Branch and Bound Algorithm for Clustering
- Experiments in projection and clustering by simulated annealing
- Fuzzy Sets and Decisionmaking Approaches in Vowel and Speaker Recognition
- scientific article; zbMATH DE number 3942804 (Why is no real title available?)
- scientific article; zbMATH DE number 3942813 (Why is no real title available?)
- scientific article; zbMATH DE number 3678973 (Why is no real title available?)
- scientific article; zbMATH DE number 3497315 (Why is no real title available?)
- scientific article; zbMATH DE number 3579840 (Why is no real title available?)
- scientific article; zbMATH DE number 3617544 (Why is no real title available?)
- scientific article; zbMATH DE number 1107546 (Why is no real title available?)
- scientific article; zbMATH DE number 1107550 (Why is no real title available?)
- scientific article; zbMATH DE number 194544 (Why is no real title available?)
- scientific article; zbMATH DE number 3340881 (Why is no real title available?)
- Improving dynamic programming strategies for partitioning
- Initializing \(K\)-means batch clustering: A critical evaluation of several techniques
- J-MEANS: A new local search heuristic for minimum sum of squares clustering
- Model-Based Gaussian and Non-Gaussian Clustering
- Multivariate Clustering Procedures with Variable Metrics
- OCLUS: an analytic method for generating clusters with known overlap
- Optimising \(k\)-means clustering results with standard software packages
- Optimization by simulated annealing
- Simulated annealing for selecting optimal initial seeds in the K-means algorithm
- Solution of large-scale symmetric travelling salesman problems
- Tabu Search—Part I
- Tabu Search—Part II
- Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm
Cited in
(25)- Variable neighbourhood search: Methods and applications
- Exemplar-based clustering via simulated annealing
- 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
- On the behaviour of \(K\)-means clustering of a dissimilarity matrix by means of full multidimensional scaling
- A repetitive branch-and-bound procedure for minimum within-cluster sums of squares partitioning
- Review of basic local searches for solving the minimum sum-of-squares clustering problem
- On strategies to fix degenerate \(k\)-means solutions
- Optimising sum-of-squares measures for clustering multisets defined over a metric space
- A variable neighborhood search method for generalized blockmodeling of two-mode binary matrices
- An empirical comparison and characterisation of nine popular clustering methods
- Estimation of panel group structure models with structural breaks in group memberships and coefficients
- MANOVA, LDA, and FA criteria in clusters parameter estimation
- Gaussian model-based partitioning using iterated local search
- Affinity propagation: An exemplar‐based tool for clustering in psychological research
- Heuristic implementation of dynamic programming for matrix permutation problems in combinatorial data analysis
- K-medoids inverse regression
- Affinity propagation and uncapacitated facility location problems
- Evaluating a branch-and-bound RLT-based algorithm for minimum sum-of-squares clustering
- MCS: A method for finding the number of clusters
- A tabu-search heuristic for deterministic two-mode blockmodeling of binary network matrices
- An improved column generation algorithm for minimum sum-of-squares clustering
- Improving a centroid-based clustering by using suitable centroids from another clustering
- Finding cluster centers and sizes via multinomial parameterization
- Variable neighbourhood search: methods and applications
This page was built for publication: A comparison of heuristic procedures for minimum within-cluster sums of squares partitioning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2517895)
