Evaluation of a Branch and Bound Algorithm for Clustering
From MaRDI portal
Publication:5186698
DOI10.1137/0906020zbMath0561.65097OpenAlexW2008730542MaRDI QIDQ5186698
Publication date: 1985
Published in: SIAM Journal on Scientific and Statistical Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0906020
test problemsbranch and bound algorithmoptimal clusteringminimization of within-group sum-of-squares
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Numerical mathematical programming methods (65K05) Pattern recognition, speech recognition (68T10) Probabilistic methods, stochastic differential equations (65C99)
Related Items
Cluster analysis and mathematical programming, An algorithm for minimizing clustering functions, Nonsmooth DC programming approach to the minimum sum-of-squares clustering problems, An exact algorithm for semi-supervised minimum sum-of-squares clustering, Fast modified global \(k\)-means algorithm for incremental cluster construction, SOS-SDP: An Exact Solver for Minimum Sum-of-Squares Clustering, New diagonal bundle method for clustering problems in large data sets, Mixed-integer programming techniques for the minimum sum-of-squares clustering problem, Unsupervised and supervised data classification via nonsmooth and global optimization (with comments and rejoinder), An improved column generation algorithm for minimum sum-of-squares clustering, Modified global \(k\)-means algorithm for minimum sum-of-squares clustering problems, Design of hybrids for the minimum sum-of-squares clustering problem, A scatter search approach for the minimum sum-of-squares clustering problem, Taxicab correspondence analysis, A heuristic algorithm for solving the minimum sum-of-squares clustering problems, A mixed-integer programming approach to the clustering problem with an application in customer segmentation, J-MEANS: A new local search heuristic for minimum sum of squares clustering, Recent Developments in Approximation Algorithms for Facility Location and Clustering Problems, A comparison of heuristic procedures for minimum within-cluster sums of squares partitioning, Variable neighborhood search heuristics for selecting a subset of variables in principal component analysis, A new nonsmooth optimization algorithm for minimum sum-of-squares clustering problems, An Exact Algorithm for Blockmodeling of Two-Mode Network Data, An incremental clustering algorithm based on hyperbolic smoothing, The capacitated centred clustering problem, K-means clustering via a nonconvex optimization approach
Uses Software
