Author:
Rozhnov I P,Kazakovtsev L A,Popov A M
Abstract
Abstract
We propose a procedure for building optimal ensembles of automatic grouping (clustering) algorithms with a combined use of the genetic algorithm of the Greedy Heuristics Method and a matched binary partitioning matrix for practical problems. It is shown that our procedure allows us to increase the accuracy of separation of a mixed batch of industrial products into homogeneous batches.
Reference9 articles.
1. Artificial Intelligence and the Internet of Things as the Innovative Methods for Improving the Agroindustrial Sector;Moskalev;Izvestiya Sankt-Peterburgskogo gosudarstvennogo agrarnogo universiteta,2018
2. Improved method of forming production batchs of electronic components with special quality requirements;Orlov;Modern high technology,2018
3. Variable neighbourhood search algorithm for k-means clustering;Orlov;IOP Conf. Series: Materials Science and Engineering,2018
4. Increase in Accuracy of the Solution of the Problem of Identification of Production Batches of Semiconductor Devices;Rozhnov,2018
5. Algorithms with Greedy Heuristic Procedures for Mixture Probability Distribution Separation;Kazakovtsev;Yugoslav Journal of Operations Research,2019
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献