An efficient k-means clustering filtering algorithm using density based initial cluster centers
From MaRDI portal
(Redirected from Publication:780930)
An efficient \(k\)-means clustering filtering algorithm using density based initial cluster centers
An efficient \(k\)-means clustering filtering algorithm using density based initial cluster centers
Recommendations
- A \(K\)-means clustering algorithm based on a novel approach for improved initial seeds
- An Initialization Method Based on Hybrid Distance for k-Means Algorithm
- Adaptive initialization method based on spatial local information for \(k\)-means algorithm
- Improvement of the k-means clustering filtering algorithm
- A robust algorithm for cluster initialization using uniform effect of \(k\)-means
Cites work
- scientific article; zbMATH DE number 6381735 (Why is no real title available?)
- scientific article; zbMATH DE number 3793445 (Why is no real title available?)
- scientific article; zbMATH DE number 41467 (Why is no real title available?)
- scientific article; zbMATH DE number 3579840 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 467196 (Why is no real title available?)
- scientific article; zbMATH DE number 3340881 (Why is no real title available?)
- A Fuzzy Relative of the ISODATA Process and Its Use in Detecting Compact Well-Separated Clusters
- A fast minimum spanning tree algorithm based on \(K\)-means
- Improvement of the k-means clustering filtering algorithm
- Least squares quantization in PCM
- Multidimensional binary search trees used for associative searching
- Point clustering via voting maximization
- The analysis of a simple k -means clustering algorithm
Cited in
(7)- Quantization-based clustering algorithm
- An efficient clustering algorithm based on local optimality of \(K\)-means
- Qualitative properties of the minimum sum-of-squares clustering problem
- Two-level \(k\)-means clustering algorithm for \(k\)-\(\tau \) relationship establishment and linear-time classification
- A robust algorithm for cluster initialization using uniform effect of \(k\)-means
- \(k\)-Mnv-Rep: a \(k\)-type clustering algorithm for matrix-object data
- Improvement of the k-means clustering filtering algorithm
This page was built for publication: An efficient \(k\)-means clustering filtering algorithm using density based initial cluster centers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q780930)