Recommendations
Cites work
- A Partitive Rough Clustering Algorithm
- Algorithm AS 136: A K-Means Clustering Algorithm
- Finding Groups in Data
- scientific article; zbMATH DE number 3815638 (Why is no real title available?)
- scientific article; zbMATH DE number 3793445 (Why is no real title available?)
- scientific article; zbMATH DE number 1032896 (Why is no real title available?)
- scientific article; zbMATH DE number 1983074 (Why is no real title available?)
- scientific article; zbMATH DE number 194544 (Why is no real title available?)
- scientific article; zbMATH DE number 833280 (Why is no real title available?)
- Interval set clustering of web users with rough \(K\)-means
- Many valued topology and its applications
- Mathematical classification and clustering
- Rough sets
- Rough Sets and Current Trends in Computing
- Rough sets and fuzzy sets
- Rudiments of rough sets
- Some refinements of rough \(k\)-means clustering
- Two views of the theory of rough sets in finite universes
Cited in
(7)- Objective function-based rough membership C-means clustering
- Belief functions and rough sets: survey and new insights
- Projected Gustafson-Kessel Clustering Algorithm and Its Convergence
- A Partitive Rough Clustering Algorithm
- Various types of objective-based rough clustering
- External Indices for Rough Clustering
- Soft clustering
This page was built for publication: Evolutionary Rough k-Medoid Clustering
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3600308)