Modified global \(k\)-means algorithm for minimum sum-of-squares clustering problems
From MaRDI portal
Publication:936447
DOI10.1016/j.patcog.2008.04.004zbMath1147.68669OpenAlexW2117067575MaRDI QIDQ936447
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
nonsmooth optimization\(k\)-means algorithmminimum sum-of-squares clusteringglobal \(k\)-means algorithm
Related Items (29)
Heuristics for the time dependent team orienteering problem: application to tourist route planning ⋮ The use of the hyperbolic smoothing clustering algorithm in taxonomy of macroalgae ⋮ The hyperbolic smoothing clustering method ⋮ Solving the minimum sum-of-squares clustering problem by hyperbolic smoothing and partition into boundary and gravitational regions ⋮ Nonsmooth DC programming approach to the minimum sum-of-squares clustering problems ⋮ Fast modified global \(k\)-means algorithm for incremental cluster construction ⋮ 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 ⋮ New and efficient DCA based algorithms for minimum sum-of-squares clustering ⋮ New diagonal bundle method for clustering problems in large data sets ⋮ A novel optimization approach towards improving separability of clusters ⋮ The global \(k\)-means clustering analysis based on multi-granulations nearness neighborhood ⋮ Qualitative properties of the minimum sum-of-squares clustering problem ⋮ Weight selection in \(W-k\)-means algorithm with an application in color image segmentation ⋮ Interpretation and optimization of the \(k\)-means algorithm. ⋮ A new method for solving supervised data classification problems ⋮ An improved column generation algorithm for minimum sum-of-squares clustering ⋮ Fast global \(k\)-means clustering based on local geometrical information ⋮ An incremental nonsmooth optimization algorithm for clustering using \(L_1\) and \(L_\infty\) norms ⋮ Fast global \(k\)-means clustering using cluster membership and inequality ⋮ A heuristic algorithm for solving the minimum sum-of-squares clustering problems ⋮ \(K\)-means cloning: adaptive spherical \(K\)-means clustering ⋮ A combination of \(k\)-means and \texttt{DBSCAN} algorithm for solving the multiple generalized circle detection problem ⋮ Decomposition/Aggregation K-means for Big Data ⋮ A memetic algorithm based on reformulation local search for minimum sum-of-squares clustering in networks ⋮ Comments on: Optimization and data mining in medicine ⋮ A novel fast heuristic to handle large-scale shape clustering ⋮ An incremental clustering algorithm based on hyperbolic smoothing ⋮ Nonsmooth nonconvex optimization approach to clusterwise linear regression problems ⋮ K-means clustering via a nonconvex optimization approach
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Analysis of global \(k\)-means, an incremental heuristic for minimum sum-of-squares clustering
- 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)
- Variable neighborhood decomposition search
- A global optimization approach to classification
- A new nonsmooth optimization algorithm for minimum sum-of-squares clustering problems
- 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
- J-MEANS: A new local search heuristic for minimum sum of squares clustering
This page was built for publication: Modified global \(k\)-means algorithm for minimum sum-of-squares clustering problems
