An algorithm for clustering based on non-smooth optimization techniques
From MaRDI portal
Recommendations
- An algorithm for minimizing clustering functions
- A new nonsmooth optimization algorithm for minimum sum-of-squares clustering problems
- Nonsmooth DC programming approach to the minimum sum-of-squares clustering problems
- An incremental nonsmooth optimization algorithm for clustering using \(L_1\) and \(L_\infty\) norms
- An incremental clustering algorithm based on hyperbolic smoothing
Cited in
(12)- Partitional clustering via nonsmooth optimization. Clustering via optimization
- An incremental nonsmooth optimization algorithm for clustering using \(L_1\) and \(L_\infty\) norms
- An incremental clustering algorithm based on hyperbolic smoothing
- A new nonsmooth optimization algorithm for minimum sum-of-squares clustering problems
- Local optimization method with global multidimensional search
- A global optimization RLT-based approach for solving the hard clustering problem
- The hyperbolic smoothing clustering method
- Competitive decision algorithm for clustering analysis
- An algorithm for minimizing clustering functions
- Optimization solvers and problem formulations for solving data clustering problems
- Risk management analysis in Scrum software projects
- A global optimization RLT-based approach for solving the fuzzy clustering problem
This page was built for publication: An algorithm for clustering based on non-smooth optimization techniques
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4814099)
