An efficient enhanced k-means clustering algorithm
From MaRDI portal
An efficient enhanced \(k\)-means clustering algorithm
Recommendations
- A local search approximation algorithm for \(k\)-means clustering
- A fast \(k\)-means clustering algorithm using cluster center displacement
- A local search approximation algorithm for \(k\)-means clustering
- scientific article; zbMATH DE number 6381735
- A survey on algorithms for \(k\)-means problem and its variants
Cites work
- scientific article; zbMATH DE number 41467 (Why is no real title available?)
- scientific article; zbMATH DE number 467196 (Why is no real title available?)
- scientific article; zbMATH DE number 3436645 (Why is no real title available?)
- scientific article; zbMATH DE number 3340881 (Why is no real title available?)
- Cure: An efficient clustering algorithm for large databases
- Finding Groups in Data
Cited in
(33)- Interpretation and optimization of the \(k\)-means algorithm.
- A fast \(k\)-means clustering algorithm using cluster center displacement
- Enhanced bisecting \(k\)-means clustering using intermediate cooperation
- k-means-g*: accelerating \(k\)-means clustering algorithm utilizing primitive geometric concepts
- An extension of the \(K\)-means algorithm to clustering skewed data
- Fast indefinite multi-point (IMP) clustering
- scientific article; zbMATH DE number 1926668 (Why is no real title available?)
- scientific article; zbMATH DE number 7290675 (Why is no real title available?)
- The new \(k\)-windows algorithm for improving the \(k\)-means clustering algorithm
- A hybrid MCDM model with Monte Carlo simulation to improve decision-making stability and reliability
- scientific article; zbMATH DE number 1759248 (Why is no real title available?)
- A computational study of several relocation methods for \(k\)-means algorithms.
- Large scale K-means clustering using GPUs
- An improved closest cluster learning algorithm
- An improved \(k\)-means algorithm for document clustering
- A new clustering preserving transformation for \(k\)-means algorithm output
- Quantization-based clustering algorithm
- Improvement of the \(k\)-means clustering filtering algorithm
- Linear-time approximation scheme for \(k\)-means clustering of axis-parallel affine subspaces
- An efficient mapreduce-based parallel clustering algorithm for distributed traffic subarea division
- The \(k\)-means range algorithm for personalized data clustering in e-commerce
- Improvement of the fast clustering algorithm improved by \(K\)-means in the big data
- Parallel Processing and Applied Mathematics
- Statistical considerations of the \(k\)-means algorithm
- A Max-Min clustering method for \(k\)-means algorithm of data clustering
- A \(K\)-means clustering algorithm based on a novel approach for improved initial seeds
- A survey on algorithms for \(k\)-means problem and its variants
- Optimizing MSE for clustering with balanced size constraints
- \(k\)-means clustering in EEG (brain waves) timeseries
- An efficient algorithm for maximal margin clustering
- An efficient clustering algorithm based on local optimality of \(K\)-means
- Optimising \(k\)-means clustering results with standard software packages
- Two-level \(k\)-means clustering algorithm for \(k\)-\(\tau \) relationship establishment and linear-time classification
This page was built for publication: An efficient enhanced \(k\)-means clustering algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q857451)
