K-medoids and other criteria for crisp clustering

zbMATH Open1396.62157MaRDI QIDQ4576265FDOQ4576265

Authors: Douglas Steinley 

Publication date: 12 July 2018

Recommendations

• Clustering. A data recovery approach.
• Advances in \(k\)-means clustering. A data mining thinking.
• scientific article; zbMATH DE number 6902590
• scientific article; zbMATH DE number 1523007
• Exemplar-based clustering via simulated annealing

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30)

Cited In (3)

• Validating clusters with the lower bound for sum-of-squares error
• On Coresets for k-Median and k-Means Clustering in Metric and Euclidean Spaces and Their Applications
• On coresets for k-means and k-median clustering

This page was built for publication: \(K\)-medoids and other criteria for crisp clustering

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