Evaluating a branch-and-bound RLT-based algorithm for minimum sum-of-squares clustering
- 8 July 2010
- journal article
- research article
- Published by Springer Nature in Journal of Global Optimization
- Vol. 49 (3) , 449-465
Abstract
No abstract availableKeywords
This publication has 22 references indexed in Scilit:
- An improved column generation algorithm for minimum sum-of-squares clusteringMathematical Programming, 2010
- K‐means clustering: A half‐century synthesisBritish Journal of Mathematical and Statistical Psychology, 2006
- The global k-means clustering algorithmPattern Recognition, 2003
- J-Means: a new local search heuristic for minimum sum of squares clusteringPattern Recognition, 2001
- Computational experience on four algorithms for the hard clustering problemPattern Recognition Letters, 1996
- An efficient algorith for determining the convex hull of a finite planar setInformation Processing Letters, 1972
- Cluster Analysis and Mathematical ProgrammingJournal of the American Statistical Association, 1971
- Integer Programming and the Theory of GroupingJournal of the American Statistical Association, 1969
- Proceedings of the Fourth Berkeley Symposium on Mathematical Statistics and Probability. Volume IVTechnometrics, 1963
- Hierarchical Grouping to Optimize an Objective FunctionJournal of the American Statistical Association, 1963