Unsupervised and supervised data classification via nonsmooth and global optimization - Semantic Scholar


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.

Duplicate Docs Excel Report

None found

Similar Docs  Excel Report  more

None found