z-logo
open-access-imgOpen Access
Scheme of optimal ensembles of clustering algorithms with a combined use of the Greedy Heuristics Method and a matched binary partitioning matrix
Author(s) -
Ivan Rozhnov,
Lev Kazakovtsev,
А. А. Попов
Publication year - 2019
Publication title -
iop conference series. earth and environmental science
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.179
H-Index - 26
eISSN - 1755-1307
pISSN - 1755-1315
DOI - 10.1088/1755-1315/315/3/032031
Subject(s) - heuristics , greedy algorithm , cluster analysis , binary number , algorithm , matrix (chemical analysis) , computer science , genetic algorithm , scheme (mathematics) , mathematical optimization , homogeneous , mathematics , artificial intelligence , combinatorics , materials science , arithmetic , composite material , mathematical analysis
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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here