Modified global k-means algorithm for minimum sum-of-squares clustering problems
From MaRDI portal
Publication:936447
DOI10.1016/J.PATCOG.2008.04.004zbMATH Open1147.68669OpenAlexW2117067575MaRDI QIDQ936447FDOQ936447
Authors: A. M. Bagirov 
Publication date: 13 August 2008
Published in: Pattern Recognition (Search for Journal in Brave)
Full work available at URL: http://researchonline.federation.edu.au/vital/access/HandleResolver/1959.17/38401
Recommendations
- An improved global \(K\)-means clustering algorithm
- A new nonsmooth optimization algorithm for minimum sum-of-squares clustering problems
- A scatter search approach for the minimum sum-of-squares clustering problem
- Fast modified global \(k\)-means algorithm for incremental cluster construction
- An Interior Point Algorithm for Minimum Sum-of-Squares Clustering
- A heuristic algorithm for solving the minimum sum-of-squares clustering problems
- A Max-Min clustering method for \(k\)-means algorithm of data clustering
\(k\)-means algorithmnonsmooth optimizationminimum sum-of-squares clusteringglobal \(k\)-means algorithm
Cites Work
- J-MEANS: A new local search heuristic for minimum sum of squares clustering
- 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)
- 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
- An Interior Point Algorithm for Minimum Sum-of-Squares Clustering
- A comparison of two dual-based procedures for solving the p-median problem
- A global optimization approach to classification
- A Branch and Bound Clustering Algorithm
- Cluster analysis by simulated annealing
- Title not available (Why is that?)
- Evaluation of a Branch and Bound Algorithm for Clustering
Cited In (37)
- An improved global \(K\)-means clustering algorithm
- A new method for solving supervised data classification problems
- Nonsmooth DC programming approach to the minimum sum-of-squares clustering problems
- A novel optimization approach towards improving separability of clusters
- The new \(k\)-windows algorithm for improving the \(k\)-means clustering algorithm
- A heuristic algorithm for solving the minimum sum-of-squares clustering problems
- A method for searching for a globally optimal \(k\)-partition of higher-dimensional datasets
- Application of the \texttt{DIRECT} algorithm to searching for an optimal \(k\)-partition of the set \(\mathcal {A}\subset \mathbb {R}^n\) and its application to the multiple circle detection problem
- Nonsmooth nonconvex optimization approach to clusterwise linear regression problems
- Comments on: Optimization and data mining in medicine
- An incremental nonsmooth optimization algorithm for clustering using \(L_1\) and \(L_\infty\) norms
- Qualitative properties of the minimum sum-of-squares clustering problem
- A combination of \(k\)-means and \texttt{DBSCAN} algorithm for solving the multiple generalized circle detection problem
- An improved column generation algorithm for minimum sum-of-squares clustering
- On \(K\)-means algorithm with the use of Mahalanobis distances
- An extended study of the K-means algorithm for data clustering and its applications
- Solving the minimum sum-of-squares clustering problem by hyperbolic smoothing and partition into boundary and gravitational regions
- A Computational Study of the DC Minimization Global Optimality Conditions Applied to K-Means Clustering
- Interpretation and optimization of the \(k\)-means algorithm.
- Heuristics for the time dependent team orienteering problem: application to tourist route planning
- Fast modified global \(k\)-means algorithm for incremental cluster construction
- Decomposition/aggregation \(k\)-means for big data
- K-means clustering via a nonconvex optimization approach
- A memetic algorithm based on reformulation local search for minimum sum-of-squares clustering in networks
- A novel fast heuristic to handle large-scale shape clustering
- \(K\)-means cloning: adaptive spherical \(K\)-means clustering
- The global \(k\)-means clustering analysis based on multi-granulations nearness neighborhood
- Second-order cone programming models for the unitary weighted Weber problem and for the minimum sum of the squares clustering problem
- Fast global \(k\)-means clustering based on local geometrical information
- Weight selection in \(W-k\)-means algorithm with an application in color image segmentation
- New diagonal bundle method for clustering problems in large data sets
- The use of the hyperbolic smoothing clustering algorithm in taxonomy of macroalgae
- Fast global \(k\)-means clustering using cluster membership and inequality
- Two Modifications of Yinyang K-means Algorithm
- New and efficient DCA based algorithms for minimum sum-of-squares clustering
- The hyperbolic smoothing clustering method
- An incremental clustering algorithm based on hyperbolic smoothing
Uses Software
This page was built for publication: Modified global \(k\)-means algorithm for 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 Q936447)
