A heuristic algorithm for solving the minimum sum-of-squares clustering problems
From MaRDI portal
Publication:2018474
DOI10.1007/s10898-014-0171-5zbMath1311.90111MaRDI QIDQ2018474
Publication date: 24 March 2015
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-014-0171-5
global optimization; nonsmooth optimization; \(k\)-means algorithm; minimum sum-of-squares clustering; global \(k\)-means algorithm
90C26: Nonconvex programming, global optimization
Related Items
Double Bundle Method for finding Clarke Stationary Points in Nonsmooth DC Programming, New diagonal bundle method for clustering problems in large data sets, Nesterov's smoothing technique and minimizing differences of convex functions for hierarchical clustering, Minimizing nonsmooth DC functions via successive DC piecewise-affine approximations, On strategies to fix degenerate \(k\)-means solutions, Nonsmooth DC programming approach to the minimum sum-of-squares clustering problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Analysis of global \(k\)-means, an incremental heuristic for minimum sum-of-squares clustering
- Solving the minimum sum-of-squares clustering problem by hyperbolic smoothing and partition into boundary and gravitational regions
- Fast modified global \(k\)-means algorithm for incremental cluster construction
- Modified global \(k\)-means algorithm for minimum sum-of-squares clustering problems
- Fast global \(k\)-means clustering using cluster membership and inequality
- A comparison of two dual-based procedures for solving the p-median problem
- Cluster analysis and mathematical programming
- Unsupervised and supervised data classification via nonsmooth and global optimization (with comments and rejoinder)
- A method of truncated codifferential with application to some problems of cluster analysis
- Variable neighborhood decomposition search
- A global optimization approach to classification
- A receding-horizon regulator for nonlinear systems and a neural approximation
- A novel clustering approach and prediction of optimal number of clusters: global optimum search with enhanced positioning
- A new nonsmooth optimization algorithm for minimum sum-of-squares clustering problems
- A global optimization RLT-based approach for solving the hard clustering problem
- The hyperbolic smoothing clustering method
- Determination of the collapse load of plastic structures by the use of an upper bounding algorithm
- TSPLIB—A Traveling Salesman Problem Library
- A Branch and Bound Clustering Algorithm
- Cluster analysis by simulated annealing
- An Interior Point Algorithm for Minimum Sum-of-Squares Clustering
- Evaluation of a Branch and Bound Algorithm for Clustering
- An algorithm for minimizing clustering functions
- Convex Analysis
- J-MEANS: A new local search heuristic for minimum sum of squares clustering
