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

DOI10.1007/S00357-018-9296-4MaRDI QIDQ779041zbMATH OpenOpenAlexWikidataFDO

Authors 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

clusteringglobal optimization\(k\)-meanscentroid-based

Mathematics Subject Classification ID

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

Cites work

• scientific article; zbMATH DE number 6381735 (Why is no real title available?)
• A comparison of heuristic procedures for minimum within-cluster sums of squares partitioning
• Experiments in projection and clustering by simulated annealing
• Initializing \(K\)-means batch clustering: A critical evaluation of several techniques
• Iterative shrinking method for clustering problems
• J-MEANS: A new local search heuristic for minimum sum of squares clustering
• Randomised local search algorithm for the clustering problem

Cited in

(1)

• Community detection of weighted complex networks via transitive closure

Describes a project that uses

Uses Software

• k-means++
• J-MEANS

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

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