A heuristic algorithm for solving the minimum sum-of-squares clustering problems
From MaRDI portal
Publication:2018474
DOI10.1007/S10898-014-0171-5zbMATH Open1311.90111OpenAlexW2033344446MaRDI QIDQ2018474FDOQ2018474
Authors: Burak Ordin, A. M. Bagirov 
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
Recommendations
- Modified global \(k\)-means algorithm for minimum sum-of-squares clustering problems
- A new nonsmooth optimization algorithm for minimum sum-of-squares clustering problems
- A Computational Study of the DC Minimization Global Optimality Conditions Applied to K-Means Clustering
- Review of basic local searches for solving the minimum sum-of-squares clustering problem
- Fast modified global \(k\)-means algorithm for incremental cluster construction
global optimization\(k\)-means algorithmnonsmooth optimizationminimum sum-of-squares clusteringglobal \(k\)-means algorithm
Cites Work
- TSPLIB—A Traveling Salesman Problem Library
- J-MEANS: A new local search heuristic for minimum sum of squares clustering
- Convex Analysis
- Optimization and nonsmooth analysis
- Cluster analysis and mathematical programming
- Title not available (Why is that?)
- Unsupervised and supervised data classification via nonsmooth and global optimization (with comments and rejoinder)
- A receding-horizon regulator for nonlinear systems and a neural approximation
- Analysis of global \(k\)-means, an incremental heuristic for minimum sum-of-squares clustering
- A new nonsmooth optimization algorithm for minimum sum-of-squares clustering problems
- Variable neighborhood decomposition search
- The hyperbolic smoothing clustering method
- An Interior Point Algorithm for Minimum Sum-of-Squares Clustering
- A comparison of two dual-based procedures for solving the p-median problem
- Modified global \(k\)-means algorithm for minimum sum-of-squares clustering problems
- A novel clustering approach and prediction of optimal number of clusters: global optimum search with enhanced positioning
- A global optimization RLT-based approach for solving the hard clustering problem
- A global optimization approach to classification
- Fast modified global \(k\)-means algorithm for incremental cluster construction
- A Branch and Bound Clustering Algorithm
- A method of truncated codifferential with application to some problems of cluster analysis
- Fast global \(k\)-means clustering using cluster membership and inequality
- Solving the minimum sum-of-squares clustering problem by hyperbolic smoothing and partition into boundary and gravitational regions
- Cluster analysis by simulated annealing
- Title not available (Why is that?)
- Evaluation of a Branch and Bound Algorithm for Clustering
- An algorithm for minimizing clustering functions
- Determination of the collapse load of plastic structures by the use of an upper bounding algorithm
Cited In (31)
- Nonsmooth DC programming approach to the minimum sum-of-squares clustering problems
- A novel optimization approach towards improving separability of clusters
- A boosted DC algorithm for non-differentiable DC components with non-monotone line search
- A comparison of heuristic procedures for minimum within-cluster sums of squares partitioning
- A New Boosted Proximal Point Algorithm for Minimizing Nonsmooth DC Functions
- A global optimization RLT-based approach for solving the hard clustering problem
- An augmented subgradient method for minimizing nonsmooth DC functions
- A bundle-type method for nonsmooth DC programs
- Minimizing nonsmooth DC functions via successive DC piecewise-affine approximations
- On strategies to fix degenerate \(k\)-means solutions
- Nesterov's smoothing technique and minimizing differences of convex functions for hierarchical clustering
- An incremental nonsmooth optimization algorithm for clustering using \(L_1\) and \(L_\infty\) norms
- Qualitative properties of the minimum sum-of-squares clustering problem
- Using positive spanning sets to achieve d-stationarity with the boosted DC algorithm
- Latent group detection in functional partially linear regression models
- Solving the minimum sum-of-squares clustering problem by hyperbolic smoothing and partition into boundary and gravitational regions
- The DTC (difference of tangentially convex functions) programming: optimality conditions
- A Computational Study of the DC Minimization Global Optimality Conditions Applied to K-Means Clustering
- Responsive threshold search based memetic algorithm for balanced minimum sum-of-squares clustering
- Fast modified global \(k\)-means algorithm for incremental cluster construction
- Title not available (Why is that?)
- A memetic algorithm based on reformulation local search for minimum sum-of-squares clustering in networks
- Modified global \(k\)-means algorithm for minimum sum-of-squares clustering problems
- Parameterized algorithms for the 2-clustering problem with minimum sum and minimum sum of squares objective functions
- Heuristic methods for large centroid clustering problems
- New diagonal bundle method for clustering problems in large data sets
- Title not available (Why is that?)
- A global optimization RLT-based approach for solving the fuzzy clustering problem
- Using Mathematical Programming to Refine Heuristic Solutions for Network Clustering
- Double Bundle Method for finding Clarke Stationary Points in Nonsmooth DC Programming
- The Boosted Difference of Convex Functions Algorithm for Nonsmooth Functions
Uses Software
This page was built for publication: A heuristic algorithm for solving the minimum sum-of-squares clustering problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2018474)
