Order-constrained solutions in K-means clustering: even better than being globally optimal
From MaRDI portal
(Redirected from Publication:998835)
Order-constrained solutions in \(K\)-means clustering: even better than being globally optimal
Order-constrained solutions in \(K\)-means clustering: even better than being globally optimal
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
Cites work
- 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 3579840 (Why is no real title available?)
- scientific article; zbMATH DE number 2205355 (Why is no real title available?)
- scientific article; zbMATH DE number 3340881 (Why is no real title available?)
- scientific article; zbMATH DE number 2231543 (Why is no real title available?)
- An interactive multiobjective programming approach to combinatorial data analysis
- Bicriterion Cluster Analysis
- Combinatorial data analysis. Optimization by dynamic programming
- Compact integer-programming models for extracting subsets of stimuli from confusion matrices
- Design of hybrids for the minimum sum-of-squares clustering problem
- Graph coloring, minimum-diameter partitioning, and the analysis of confusion matrices
- Initializing \(K\)-means batch clustering: A critical evaluation of several techniques
- J-MEANS: A new local search heuristic for minimum sum of squares clustering
- OCLUS: an analytic method for generating clusters with known overlap
- On Grouping for Maximum Homogeneity
- On Using Principal Components Before Separating a Mixture of Two Multivariate Normal Distributions
- Selection of variables in cluster analysis: An empirical comparison of eight procedures
- Simulated annealing for selecting optimal initial seeds in the K-means algorithm
- The Structural Representation of Proximity Matrices with MATLAB
Cited in
(11)- Using assignment constraints to avoid empty clusters in \(k\)-means clustering
- scientific article; zbMATH DE number 1163863 (Why is no real title available?)
- A note on the estimation of the Pareto efficient set for multiobjective matrix permutation problems
- A constrained \(k\)-means clustering algorithm for classifying spatial units
- Applicability and interpretability of Ward's hierarchical agglomerative clustering with or without contiguity constraints
- 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
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)
