A heuristic algorithm for solving the minimum sum-of-squares clustering problems
From MaRDI portal
Publication:2018474
DOI10.1007/s10898-014-0171-5zbMath1311.90111OpenAlexW2033344446MaRDI 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 optimizationnonsmooth optimization\(k\)-means algorithmminimum sum-of-squares clusteringglobal \(k\)-means algorithm
Related Items (17)
The DTC (difference of tangentially convex functions) programming: optimality conditions ⋮ On strategies to fix degenerate \(k\)-means solutions ⋮ Nonsmooth DC programming approach to the minimum sum-of-squares clustering problems ⋮ A New Boosted Proximal Point Algorithm for Minimizing Nonsmooth DC Functions ⋮ Using positive spanning sets to achieve d-stationarity with the boosted DC algorithm ⋮ Latent group detection in functional partially linear regression models ⋮ New diagonal bundle method for clustering problems in large data sets ⋮ A bundle-type method for nonsmooth DC programs ⋮ A novel optimization approach towards improving separability of clusters ⋮ Qualitative properties of the minimum sum-of-squares clustering problem ⋮ An augmented subgradient method for minimizing nonsmooth DC functions ⋮ An incremental nonsmooth optimization algorithm for clustering using \(L_1\) and \(L_\infty\) norms ⋮ Nesterov's smoothing technique and minimizing differences of convex functions for hierarchical clustering ⋮ Minimizing nonsmooth DC functions via successive DC piecewise-affine approximations ⋮ Double Bundle Method for finding Clarke Stationary Points in Nonsmooth DC Programming ⋮ A memetic algorithm based on reformulation local search for minimum sum-of-squares clustering in networks ⋮ The Boosted Difference of Convex Functions Algorithm for Nonsmooth Functions
Uses Software
Cites Work
- 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
- Optimization and nonsmooth analysis
- 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
This page was built for publication: A heuristic algorithm for solving the minimum sum-of-squares clustering problems
