An efficient enhanced k-means clustering algorithm
From MaRDI portal
Publication:857451
DOI10.1631/JZUS.2006.A1626zbMATH Open1101.62054OpenAlexW1990130348MaRDI QIDQ857451FDOQ857451
Authors: A. M. Fahim, A. M. Salem, F. A. Torkey, Mohamed A. Ramadan 
Publication date: 18 December 2006
Published in: Journal of Zhejiang University. Science A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1631/jzus.2006.a1626
Recommendations
Cites Work
Cited In (31)
- Title not available (Why is that?)
- A new clustering preserving transformation for \(k\)-means algorithm output
- The new \(k\)-windows algorithm for improving the \(k\)-means clustering algorithm
- An extension of the \(K\)-means algorithm to clustering skewed data
- Parallel Processing and Applied Mathematics
- Optimizing MSE for clustering with balanced size constraints
- Quantization-based clustering algorithm
- A Max-Min clustering method for \(k\)-means algorithm of data clustering
- An efficient clustering algorithm based on local optimality of \(K\)-means
- Optimising \(k\)-means clustering results with standard software packages
- The \(k\)-means range algorithm for personalized data clustering in e-commerce
- A \(K\)-means clustering algorithm based on a novel approach for improved initial seeds
- Title not available (Why is that?)
- Statistical considerations of the \(k\)-means algorithm
- A fast \(k\)-means clustering algorithm using cluster center displacement
- Enhanced bisecting \(k\)-means clustering using intermediate cooperation
- Two-level \(k\)-means clustering algorithm for \(k\)-\(\tau \) relationship establishment and linear-time classification
- An efficient mapreduce-based parallel clustering algorithm for distributed traffic subarea division
- Fast indefinite multi-point (IMP) clustering
- Title not available (Why is that?)
- Interpretation and optimization of the \(k\)-means algorithm.
- Improvement of the fast clustering algorithm improved by \(K\)-means in the big data
- A hybrid MCDM model with Monte Carlo simulation to improve decision-making stability and reliability
- Large scale K-means clustering using GPUs
- Improvement of the \(k\)-means clustering filtering algorithm
- Linear-time approximation scheme for \(k\)-means clustering of axis-parallel affine subspaces
- A survey on algorithms for \(k\)-means problem and its variants
- An efficient algorithm for maximal margin clustering
- A computational study of several relocation methods for \(k\)-means algorithms.
- An improved \(k\)-means algorithm for document clustering
- An improved closest cluster learning algorithm
Uses Software
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)
