A K-medoids clustering algorithm based on improved tabu search

MaRDI QIDQ3194094zbMATH OpenFDO

Authors

Publication date 28 October 2015

zbMATH Keywords

clusteringgranular computingK-medoidsmaximum distances producttabu search algorithm

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Pattern recognition, speech recognition (68T10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• A tabu search approach for the minimum sum-of-squares clustering problem
• An improved K-means clustering algorithm
• scientific article; zbMATH DE number 1945789
• An improved global K-means clustering algorithm
• An improved parallel K-Medoids algorithm based on MapReduce

Cited in

(4)

• K-medoids clustering algorithm based on distance inequality
• scientific article; zbMATH DE number 1945789 (Why is no real title available?)
• The effective BRKGA algorithm for the k-medoids clustering problem
• An improved parallel K-Medoids algorithm based on MapReduce

This page was built for publication: A K-medoids clustering algorithm based on improved tabu search

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