A Partitive Rough Clustering Algorithm

DOI10.1007/11908029_68zbMATH Open1162.68567OpenAlexW1522332701MaRDI QIDQ3535511FDOQ3535511

Authors Georg Peters, Martin Lampart

Publication date 13 November 2008

Published in Rough Sets and Current Trends in Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11908029_68

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• Evolutionary Rough k-Medoid Clustering
• Some refinements of rough \(k\)-means clustering
• Various types of objective-based rough clustering
• scientific article; zbMATH DE number 6311430
• Improved rough \(k\)-means clustering algorithm based on weighted distance measure with Gaussian function

Cited in

(12)

• Clustering algorithm based on feature space partitioning
• A new partitioning around medoids algorithm
• Correlating fuzzy and rough clustering
• A multi-level hypergraph partitioning algorithm using rough set clustering
• Various types of objective-based rough clustering
• Soft clustering
• Evolutionary Rough k-Medoid Clustering
• Rough support vector clustering
• Improved rough \(k\)-means clustering algorithm based on weighted distance measure with Gaussian function
• scientific article; zbMATH DE number 5733671 (Why is no real title available?)
• Rough Clustering with Partial Supervision
• scientific article; zbMATH DE number 1983074 (Why is no real title available?)

This page was built for publication: A Partitive Rough Clustering Algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3535511)