Order-constrained solutions in K-means clustering: even better than being globally optimal
From MaRDI portal
Publication:998835
DOI10.1007/S11336-008-9058-ZzbMATH Open1284.62749OpenAlexW1983340932MaRDI QIDQ998835FDOQ998835
Authors: Douglas Steinley, Lawrence Hubert 
Publication date: 30 January 2009
Published in: Psychometrika (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11336-008-9058-z
Recommendations
- Global optimality in \(k\)-means clustering
- Almost optimal solutions to \(k\)-clustering problems
- scientific article; zbMATH DE number 1163863
- Constrained clustering problems: new optimization algorithms
- K-means clustering via a nonconvex optimization approach
- Solving \(k\)-cluster problems to optimality with semidefinite programming
- Faster algorithms for the constrained \(k\)-means problem
- Faster algorithms for the constrained \(k\)-means problem
- An efficient clustering algorithm based on local optimality of \(K\)-means
dynamic programmingconstrained optimizationquadratic assignmentmulticriterion optimization\(K\)-means cluster analysis
Cites Work
- J-MEANS: A new local search heuristic for minimum sum of squares clustering
- On Using Principal Components Before Separating a Mixture of Two Multivariate Normal Distributions
- Title not available (Why is that?)
- Title not available (Why is that?)
- On Grouping for Maximum Homogeneity
- Title not available (Why is that?)
- Title not available (Why is that?)
- Initializing \(K\)-means batch clustering: A critical evaluation of several techniques
- OCLUS: an analytic method for generating clusters with known overlap
- Title not available (Why is that?)
- Combinatorial data analysis. Optimization by dynamic programming
- The Structural Representation of Proximity Matrices with MATLAB
- Title not available (Why is that?)
- Selection of variables in cluster analysis: An empirical comparison of eight procedures
- Bicriterion Cluster Analysis
- An interactive multiobjective programming approach to combinatorial data analysis
- Graph coloring, minimum-diameter partitioning, and the analysis of confusion matrices
- Compact integer-programming models for extracting subsets of stimuli from confusion matrices
- Design of hybrids for the minimum sum-of-squares clustering problem
- Simulated annealing for selecting optimal initial seeds in the \(K\)-means algorithm
Cited In (11)
- Using assignment constraints to avoid empty clusters in \(k\)-means clustering
- Title not available (Why is that?)
- A note on the estimation of the Pareto efficient set for multiobjective matrix permutation problems
- Applicability and interpretability of Ward's hierarchical agglomerative clustering with or without contiguity constraints
- A constrained \(k\)-means clustering algorithm for classifying spatial units
- Disentangling relationships in symptom networks using matrix permutation methods
- A review of multiobjective programming and its application in quantitative psychology
- Efficient Clustering for Orders
- A modified \(k\)-means clustering procedure for obtaining a cardinality-constrained centroid matrix
- On the behaviour of \(K\)-means clustering of a dissimilarity matrix by means of full multidimensional scaling
- Music and timbre segmentation by recursive constrained \(K\)-means clustering
Uses Software
This page was built for publication: Order-constrained solutions in \(K\)-means clustering: even better than being globally optimal
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q998835)
