A greedy algorithm for building learning ensembles

An approach to improving methods for solving machine-learning problems based on ensembles of algorithms is considered using classification problem as an example. A method based on a greedy algorithm for choosing weak learners and building the selective ensemble is proposed. This approach is general and applicable in decision support systems and other expert systems.