Fast modified global \(k\)-means algorithm for incremental cluster construction
From MaRDI portal
Publication:621088
DOI10.1016/j.patcog.2010.10.018zbMath1213.68514OpenAlexW1979607399MaRDI QIDQ621088
Dean Webb, Adil M. Bagirov, Julien Ugon
Publication date: 2 February 2011
Published in: Pattern Recognition (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.patcog.2010.10.018
nonsmooth optimization\(k\)-means algorithmminimum sum-of-squares clusteringglobal \(k\)-means algorithm
Related Items (16)
Nonsmooth DC programming approach to the minimum sum-of-squares clustering problems ⋮ An incremental piecewise linear classifier based on polyhedral conic separation ⋮ 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 ⋮ Unsupervised learning by cluster quality optimization ⋮ A novel optimization approach towards improving separability of clusters ⋮ Qualitative properties of the minimum sum-of-squares clustering problem ⋮ Interpretation and optimization of the \(k\)-means algorithm. ⋮ Fast global \(k\)-means clustering based on local geometrical information ⋮ An incremental nonsmooth optimization algorithm for clustering using \(L_1\) and \(L_\infty\) norms ⋮ Incremental method for multiple line detection problem -- iterative reweighted approach ⋮ A heuristic algorithm for solving the minimum sum-of-squares clustering problems ⋮ The adaptation of the \(k\)-means algorithm to solving the multiple ellipses detection problem by using an initial approximation obtained by the DIRECT global optimization algorithm. ⋮ A novel fast heuristic to handle large-scale shape clustering ⋮ Center-based l1–clustering method ⋮ An incremental clustering algorithm based on hyperbolic smoothing ⋮ Nonsmooth nonconvex optimization approach to clusterwise linear regression 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
- Modified global \(k\)-means algorithm for minimum sum-of-squares clustering problems
- A comparison of two dual-based procedures for solving the p-median problem
- Unsupervised and supervised data classification via nonsmooth and global optimization (with comments and rejoinder)
- Variable neighborhood decomposition search
- A global optimization approach to classification
- Batch and median neural gas
- A new nonsmooth optimization algorithm for minimum sum-of-squares clustering problems
- The hyperbolic smoothing clustering method
- Better streaming algorithms for clustering problems
- Well-Separated Clusters and Optimal Fuzzy Partitions
- 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: Fast modified global \(k\)-means algorithm for incremental cluster construction
