An extension to rough c-means clustering algorithm based on boundary area elements discrimination
From MaRDI portal
Publication:4909588
Recommendations
- An extension to rough \(c\)-means clustering based on decision-theoretic rough sets model
- Improved rough \(k\)-means clustering algorithm based on weighted distance measure with Gaussian function
- scientific article; zbMATH DE number 6311430
- Some refinements of rough \(k\)-means clustering
- Improved \(\pi\)RKM clustering algorithm based on local fuzzy enhancement of boundary region
Cited in
(9)- A new initialization and performance measure for the rough \(k\)-means clustering
- Stomped-\(t\): a novel probability distribution for rough-probabilistic clustering
- Improved \(\pi\)RKM clustering algorithm based on local fuzzy enhancement of boundary region
- A novel rough \(K\)-means clustering algorithm based on the weight of density
- Objective function-based rough membership C-means clustering
- An adaptive rough fuzzy single pass algorithm for clustering large data sets.
- Improved rough \(k\)-means clustering algorithm based on weighted distance measure with Gaussian function
- An extension to rough \(c\)-means clustering based on decision-theoretic rough sets model
- scientific article; zbMATH DE number 2197689 (Why is no real title available?)
This page was built for publication: An extension to rough \(c\)-means clustering algorithm based on boundary area elements discrimination
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4909588)