An initialization method for the K-means algorithm using neighborhood model
From MaRDI portal
An initialization method for the \(K\)-means algorithm using neighborhood model
Recommendations
- An Initialization Method Based on Hybrid Distance for k-Means Algorithm
- Adaptive initialization method based on spatial local information for \(k\)-means algorithm
- scientific article; zbMATH DE number 7267213
- A \(K\)-means clustering algorithm based on a novel approach for improved initial seeds
- A spectral method of \(K\)-means initialization
Cites work
- scientific article; zbMATH DE number 53312 (Why is no real title available?)
- scientific article; zbMATH DE number 1303620 (Why is no real title available?)
- scientific article; zbMATH DE number 1149424 (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?)
- A new measure of uncertainty based on knowledge granulation for rough sets
- A rough set approach to outlier detection
- Clustering by passing messages between data points
- K-Means-Type Algorithms: A Generalized Convergence Theorem and Characterization of Local Optimality
- Neighborhood operator systems and approximations
- Relational interpretations of neighborhood operators and rough set approximation operators
- Rough set-based clustering with refinement using Shannon's entropy theory
Cited in
(15)- A new initialization and performance measure for the rough \(k\)-means clustering
- A robust algorithm for cluster initialization using uniform effect of \(k\)-means
- New heuristic for harmonic means clustering
- scientific article; zbMATH DE number 2042280 (Why is no real title available?)
- Adaptive initialization method based on spatial local information for \(k\)-means algorithm
- Initializing \(K\)-means batch clustering: A critical evaluation of several techniques
- Improved rough \(k\)-means clustering algorithm based on weighted distance measure with Gaussian function
- A spectral method of \(K\)-means initialization
- A new distance with derivative information for functional \(k\)-means clustering algorithm
- A benchmark calculation for the fuzzy \(c\)-means clustering algorithm: initial memberships
- Weight selection in \(W-k\)-means algorithm with an application in color image segmentation
- On \(K\)-means algorithm with the use of Mahalanobis distances
- Initialization of \(K\)-modes clustering using outlier detection techniques
- An Initialization Method Based on Hybrid Distance for k-Means Algorithm
- A novel method for optimizing spectral rotation embedding \(K\)-means with coordinate descent
This page was built for publication: An initialization method for the \(K\)-means algorithm using neighborhood model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q980040)