Minimum sum of squares clustering in a low dimensional space

DOI10.1007/s003579900019zbMath0902.62073OpenAlexW2052584795WikidataQ127723758 ScholiaQ127723758MaRDI QIDQ1393051

Pierre Hansen, Brigitte Jaumard, Nenad Mladenović

Publication date: 14 December 1998

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

Full work available at URL: https://doi.org/10.1007/s003579900019

zbMATH Keywords

hierarchical clusteringpolynomial algorithmcluster analysissum of squaresdivisive clustering

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Clustering in the social and behavioral sciences (91C20) Complexity and performance of numerical algorithms (65Y20)

Related Items

Exact algorithms of searching for the largest size cluster in two integer 2-clustering problems, Exact algorithms for size constrained 2-clustering in the plane, An exact pseudopolynomial algorithm for a problem of the two-cluster partitioning of a set of vectors, Sequential clustering with radius and split criteria, New heuristic for harmonic means clustering, A polynomial-time approximation to optimal multivariate microaggregation, Evaluating a branch-and-bound RLT-based algorithm for minimum sum-of-squares clustering, Complexity of some problems of quadratic partitioning of a finite set of points in Euclidean space into balanced clusters, A randomized algorithm for two-cluster partition of a set of vectors