Scheme of optimal ensembles of clustering algorithms with a combined use of the Greedy Heuristics Method and a matched binary partitioning matrix
2019
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.
Keywords:
- Correction
- Source
- Cite
- Save
- Machine Reading By IdeaReader
6
References
1
Citations
NaN
KQI