Solution of clusterization problem by graph optimization methods
The rapid growth in the volume of processed information that takes place nowadays determines the urgency of the development of methods for reducing the dimension of computational problems. One of the approaches to reducing the dimensionality of data is their clustering, i.e., uniting into maximally...
Main Authors: | I.V. Konnov, O.A. Kashina, E.I. Gilmanova |
---|---|
Format: | Article |
Language: | English |
Published: |
Kazan Federal University
2019-09-01
|
Series: | Учёные записки Казанского университета. Серия Физико-математические науки |
Subjects: | |
Online Access: | https://kpfu.ru/uz-eng-phm-2019-3-8.html |
Similar Items
-
PROBLEM OF CLASSIFICATION OF SEMANTIC KERNELS OF WEB RESOURCE
by: Sergey Orekhov, et al.
Published: (2022-07-01) -
Modelado de flujo máximo de Aguas Residuales
by: Yolanda Moyao Martínez, et al.
Published: (2019-06-01) -
PERBANDINGAN METODE CENTROID DAN WARD DALAM PENGELOMPOKKAN TINGKAT PENYELESAIAN PENDIDIKAN DI INDONESIA
by: Rindang Ndaru Puspita
Published: (2022-12-01) -
Algoritma Ford-Fulkerson untuk Memaksimumkan Flow dalam Pendistribusian Barang
by: Fahrun Nisa, et al.
Published: (2015-05-01) -
Cluster Analysis in Practice: Dealing with Outliers in Managerial Research
by: Humberto Elias Garcia Lopes, et al.
Published: (2020-09-01)