Improving a centroid-based clustering by using suitable centroids from another clustering

DOI10.1007/s00357-018-9296-4OpenAlexW2942177010WikidataQ128023725 ScholiaQ128023725MaRDI QIDQ779041

D. Kharzeev

Publication date: 21 July 2020

Published in: Journal of Classification (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00357-018-9296-4

zbMATH Keywords

global optimizationclustering\(k\)-meanscentroid-based

Mathematics Subject Classification ID

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

Uses Software

• J-MEANS
• k-means++

Cites Work

• Unnamed Item
• Experiments in projection and clustering by simulated annealing
• Randomised local search algorithm for the clustering problem
• Iterative shrinking method for clustering problems
• Initializing \(K\)-means batch clustering: A critical evaluation of several techniques
• A comparison of heuristic procedures for minimum within-cluster sums of squares partitioning
• J-MEANS: A new local search heuristic for minimum sum of squares clustering

This page was built for publication: Improving a centroid-based clustering by using suitable centroids from another clustering