|
|
|
|
|
Vladimir Krutikov, Elena Tovbis, Anatoly Bykov, Predrag Stanimirovic, Ekaterina Chernova and Lev Kazakovtsev
We investigate a solution of a convex programming problem with a strongly convex objective function based on the dual approach. A dual optimization problem has constraints on the positivity of variables. We study the methods and properties of transformat...
ver más
|
|
|
|
|
|
|
|
|
|
|
Guzel Shkaberina, Natalia Rezova, Elena Tovbis and Lev Kazakovtsev
Finding the cluster structure is essential for analyzing self-organized networking structures, such as social networks. In such problems, a wide variety of distance measures can be used. Common clustering methods often require the number of clusters to b...
ver más
|
|
|
|
|
|
|
|
|
|
|
Guzel Shkaberina, Leonid Verenev, Elena Tovbis, Natalia Rezova and Lev Kazakovtsev
Automatic grouping (clustering) involves dividing a set of objects into subsets (groups) so that the objects from one subset are more similar to each other than to the objects from other subsets according to some criterion. Kohonen neural networks are a ...
ver más
|
|
|
|
|
|
|
|
|
|
|
Lev Kazakovtsev, Ivan Rozhnov, Aleksey Popov and Elena Tovbis
The k-means problem is one of the most popular models in cluster analysis that minimizes the sum of the squared distances from clustered objects to the sought cluster centers (centroids). The simplicity of its algorithmic implementation encourages resear...
ver más
|
|
|
|
|
|