An Interior Point Algorithm for Minimum Sum-of-Squares Clustering
From MaRDI portal
Publication:4509784
DOI10.1137/S1064827597328327zbMath1049.90129MaRDI QIDQ4509784
Pierre Hansen, Nenad Mladenović, Brigitte Jaumard, Olivier du Merle
Publication date: 19 October 2000
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Interior-point methods (90C51) Combinatorial optimization (90C27)
Related Items
Side-constrained minimum sum-of-squares clustering: mathematical programming and random projections, Improved branching disjunctions for branch-and-bound: an analytic center approach, Using the primal-dual interior point algorithm within the branch-price-and-cut method, An algorithm for minimizing clustering functions, Sequential clustering with radius and split criteria, The hyperbolic smoothing clustering method, 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 and efficient DCA based algorithms for minimum sum-of-squares clustering, New diagonal bundle method for clustering problems in large data sets, Evaluating a branch-and-bound RLT-based algorithm for minimum sum-of-squares clustering, Mixed-integer programming techniques for the minimum sum-of-squares clustering problem, Variable neighborhood search for harmonic means clustering, Qualitative properties of the minimum sum-of-squares clustering problem, Optimising sum-of-squares measures for clustering multisets defined over a metric space, An improved column generation algorithm for minimum sum-of-squares clustering, Modified global \(k\)-means algorithm for minimum sum-of-squares clustering problems, Column generation bounds for numerical microaggregation, Optimal partitioning of a data set based on the \(p\)-median model, Design of hybrids for the minimum sum-of-squares clustering problem, Improving spectral bounds for clustering problems by Lagrangian relaxation, A scatter search approach for the minimum sum-of-squares clustering problem, Variable neighbourhood search: methods and applications, Taxicab correspondence analysis, Variable neighborhood search: Principles and applications, A heuristic algorithm for solving the minimum sum-of-squares clustering problems, A comparison of heuristic procedures for minimum within-cluster sums of squares partitioning, Variable neighbourhood search: Methods and applications, 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, Fuzzy J-means: a new heuristic for fuzzy clustering, K-means clustering via a nonconvex optimization approach
Uses Software
