Библиографическое описание:Greedy Heuristics for the Choice of the Radius of Local Concentrations in Forel-2 Algorithm : доклад, тезисы доклада / F. G. Ahmatshin, L. A. Kazakovtsev. - [S. l. : s. n.], 2022. - Текст : непосредственный // HYBRID METHODS OF MODELING AND OPTIMIZATION IN COMPLEX SYSTEMS : Proceedings of the International Workshop “Hybrid methods of modeling and optimization in complex systems” (HMMOCS 2022) / Krasnoyarsk Regional Science and Technology City Hall, Russia Siberian Federal University, Reshetnev Siberian State University of Science and Technology ; International Workshop “Hybrid methods of modeling and optimization in complex systems” (HMMOCS 2022) (2022 ; 22.11 - 24.11 ; Krasnoyarsk). - London, United Kingdom : European Proceedings, 2022. - P. 366-371. - ISBN 9781802969603, DOI 10.15405/epct.23021.45.
Аннотация:The authors examine the problem of choosing the search radius for local concentrations in the FOREL-2 clustering algorithm with an initial number of clusters. Our approach was aimed at improving the accuracy and stability of the result, such as identifying homogeneous batches of industrial products. We examined the k-means and FOREL-2 algorithms by using normalized standard deviation test values and by valid parameter values for the problem of automatic classification of objects in a multi-dimensional space of measured parameters. For such problems, with the use of the FOREL-2 algorithm, we apply greedy heuristic procedures to select the radius of local concentrations. According to the obtained Rand index, the approach which uses the FOREL-2 algorithm demonstrated the best accuracy with a larger value of the objective function in comparison with the k-means algorithm. The accuracy and speed of the software implementation of the algorithm are quite acceptable for solving the problem of clustering electronic radio products based on test data. The use of greedy heuristics for choosing the radius of the search for local concentrations in the FOREL-2 clustering algorithm with a specified number of clusters has an advantage in the speed of exact clustering compared to the k-means algorithm that uses greedy heuristics for choosing centroids.
