Clustering via d. c. optimization.
From MaRDI portal
Publication:2768045
zbMATH Open1049.90068MaRDI QIDQ2768045FDOQ2768045
Authors: Hoang Tuy, A. M. Bagirov, A. M. Rubinov 
Publication date: 2001
Recommendations
- Optimization based DC programming and DCA for hierarchical clustering
- The method of principal clusters
- An algorithm for minimizing clustering functions
- Block clustering based on difference of convex functions (DC) programming and DC algorithms
- Nonsmooth DC programming approach to the minimum sum-of-squares clustering problems
Cited In (6)
- Nesterov's smoothing technique and minimizing differences of convex functions for hierarchical clustering
- Optimal replenishment order placement in a finite time horizon
- Clustering and the perturbed spatial median
- An algorithm for minimizing clustering functions
- New diagonal bundle method for clustering problems in large data sets
- Optimization based DC programming and DCA for hierarchical clustering
This page was built for publication: Clustering via d. c. optimization.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2768045)
