Unsupervised and supervised data classification via nonsmooth and global optimization

@article{Bagirov2003UnsupervisedAS,
  title={Unsupervised and supervised data classification via nonsmooth and global optimization},
  author={A. Bagirov and A. M. Rubinov and N. Soukhoroukova and J. Yearwood},
  journal={Top},
  year={2003},
  volume={11},
  pages={1-75}
}
We examine various methods for data clustering and data classification that are based on the minimization of the so-called cluster function and its modications. These functions are nonsmooth and nonconvex. We use Discrete Gradient methods for their local minimization. We consider also a combination of this method with the cutting angle method for global minimization. We present and discuss results of numerical experiments. 
90 Citations
Nonsmooth DC programming approach to the minimum sum-of-squares clustering problems
  • 30
Non-smoothness in classification problems
  • 22
An incremental clustering algorithm based on hyperbolic smoothing
  • 18
Clustering in large data sets with the limited memory bundle method
  • 14
  • PDF
Piecewise Partially Separable Functions and a Derivative-free Algorithm for Large Scale Nonsmooth Optimization
  • 29
Using Pattern Search Methods for Minimizing Clustering Problems
  • 1
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 115 REFERENCES
K-Means-Type Algorithms: A Generalized Convergence Theorem and Characterization of Local Optimality
  • 1,081
Clustering and Neural Networks
  • 38
A Branch and Bound Clustering Algorithm
  • 200
  • PDF
A Tabu search approach to the clustering problem
  • K. Al-Sultan
  • Mathematics, Computer Science
  • Pattern Recognit.
  • 1995
  • 281
  • Highly Influential
Global Minimization of Increasing Positively Homogeneous Functions over the Unit Simplex
  • 54
...
1
2
3
4
5
...