A novel optimization approach towards improving separability of clusters
From MaRDI portal
Publication:6164339
DOI10.1016/j.cor.2022.106135MaRDI QIDQ6164339
Sona Taheri, Najmeh Hoseini Monjezi, Adil M. Bagirov
Publication date: 4 July 2023
Published in: Computers \& Operations Research (Search for Journal in Brave)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Clustering by Passing Messages Between Data Points
- Ward's hierarchical agglomerative clustering method: which algorithms implement Ward's criterion?
- Computational results of a semidefinite branch-and-bound algorithm for \(k\)-cluster
- Fast modified global \(k\)-means algorithm for incremental cluster construction
- Clustering with the average silhouette width
- New and efficient DCA based algorithms for minimum sum-of-squares clustering
- Modified global \(k\)-means algorithm for minimum sum-of-squares clustering problems
- Discrete gradient method: Derivative-free method for nonsmooth optimization
- Silhouettes: a graphical aid to the interpretation and validation of cluster analysis
- New diagonal bundle method for clustering problems in large data sets
- A heuristic algorithm for solving the minimum sum-of-squares clustering problems
- Partitional clustering via nonsmooth optimization. Clustering via optimization
- An incremental clustering algorithm based on hyperbolic smoothing
- A new efficient algorithm based on DC programming and DCA for clustering
- Nonsmooth DC programming approach to the minimum sum-of-squares clustering problems
- A scatter search approach for the minimum sum-of-squares clustering problem
- A new nonsmooth optimization algorithm for minimum sum-of-squares clustering problems
- The hyperbolic smoothing clustering method
- Well-Separated Clusters and Optimal Fuzzy Partitions
- An algorithm for minimizing clustering functions
This page was built for publication: A novel optimization approach towards improving separability of clusters
