An extension to rough c-means clustering algorithm based on boundary area elements discrimination
From MaRDI portal
Publication:4909588
DOI10.1007/978-3-642-36505-8_2zbMATH Open1377.68203OpenAlexW1727604664MaRDI QIDQ4909588FDOQ4909588
Publication date: 21 March 2013
Published in: Transactions on Rough Sets XVI (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-36505-8_2
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
Learning and adaptive systems in artificial intelligence (68T05) Reasoning under uncertainty in the context of artificial intelligence (68T37)
Cited In (9)
- An adaptive rough fuzzy single pass algorithm for clustering large data sets.
- An extension to rough \(c\)-means clustering based on decision-theoretic rough sets model
- 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
- Stomped-\(t\): a novel probability distribution for rough-probabilistic clustering
- Title not available (Why is that?)
- Improved rough \(k\)-means clustering algorithm based on weighted distance measure with Gaussian function
- A new initialization and performance measure for the rough \(k\)-means clustering
Uses Software
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)
