Evolutionary Rough k-Medoid Clustering
From MaRDI portal
Publication:3600308
DOI10.1007/978-3-540-85064-9_13zbMath1170.68583OpenAlexW1539846213MaRDI QIDQ3600308
Georg Peters, Martin Lampart, Richard R. Weber
Publication date: 10 February 2009
Published in: Transactions on Rough Sets VIII (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-85064-9_13
Learning and adaptive systems in artificial intelligence (68T05) Pattern recognition, speech recognition (68T10)
Related Items
Projected Gustafson-Kessel Clustering Algorithm and Its Convergence, Objective function-based rough membership C-means clustering, Belief functions and rough sets: survey and new insights
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Algorithm AS 136: A K-Means Clustering Algorithm
- Rudiments of rough sets
- Rough sets and fuzzy sets
- Interval set clustering of web users with rough \(K\)-means
- Two views of the theory of rough sets in finite universes
- Some refinements of rough \(k\)-means clustering
- Mathematical classification and clustering
- A Partitive Rough Clustering Algorithm
- Rough sets
- Finding Groups in Data
- Rough Sets and Current Trends in Computing