A greedy algorithm for building learning ensembles

Fomchenko Aleksandr Valerevich; Parfenov Denis Vasilevich

A greedy algorithm for building learning ensembles

Fomchenko A. V., Parfenov D. V.

Fomchenko Aleksandr Valerevich

Ph.D. student, Russian Technological University (MIREA), Institute of Artificial Intelligence, Department of Higher Mathematics

Parfenov Denis Vasilevich

Ph.D., associate professor, Russian Technological University (MIREA), Institute of Artificial Intelligence, Department of Higher Mathematics

Published: 2024, vol. 28, issue 2, pp. 13–23

Download full text (In Russian)

Abstract

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.

Keywords: machine learning, weak learners, ensembling, boosting.

BibTeX

@article{IS-Fomchenko-Parfenov2024,
  author  = {Fomchenko, Aleksandr Valerevich and Parfenov, Denis Vasilevich},
  title   = {{A greedy algorithm for building learning ensembles}},
  journal = {Intelligent Systems. Theory and Applications},
  year    = {2024},
  volume  = {28},
  number  = {2},
  pages   = {13--23},
}

AMSBIB

\Bibitem{IS-Fomchenko-Parfenov2024}
\by A.\,V.~Fomchenko, D.\,V.~Parfenov
\paper A greedy algorithm for building learning ensembles
\jour Intelligent Systems. Theory and Applications
\yr 2024
\vol 28
\issue 2
\pages 13--23
\lang In Russian

Published under Creative Commons Attribution 4.0 International (CC BY 4.0)

← Back to issue