Analysis of global \(k\)-means, an incremental heuristic for minimum sum-of-squares clustering

DOI10.1007/s00357-005-0018-3zbMath1336.62182OpenAlexW1983989808MaRDI QIDQ286614

Bernard K. Cheung, Pierre Hansen, Nenad Mladenović, Eric W. T. Ngai

Publication date: 25 May 2016

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

Full work available at URL: https://doi.org/10.1007/s00357-005-0018-3

Mathematics Subject Classification ID

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

Related Items (12)

The hyperbolic smoothing clustering method ⋮ On strategies to fix degenerate \(k\)-means solutions ⋮ Fast modified global \(k\)-means algorithm for incremental cluster construction ⋮ Evaluating a branch-and-bound RLT-based algorithm for minimum sum-of-squares clustering ⋮ An improved column generation algorithm for minimum sum-of-squares clustering ⋮ Modified global \(k\)-means algorithm for minimum sum-of-squares clustering problems ⋮ J-means and I-means for minimum sum-of-squares clustering on networks ⋮ A heuristic algorithm for solving the minimum sum-of-squares clustering problems ⋮ A memetic algorithm based on reformulation local search for minimum sum-of-squares clustering in networks ⋮ A new nonsmooth optimization algorithm for minimum sum-of-squares clustering problems ⋮ Local optimization method with global multidimensional search ⋮ Variable neighborhood search for minimum sum-of-squares clustering on networks

This page was built for publication: Analysis of global \(k\)-means, an incremental heuristic for minimum sum-of-squares clustering