| 000 | 03120naa a22005177i 4500 | ||
|---|---|---|---|
| 001 | UMUN-OA-20261005-CS-025 | ||
| 003 | local | ||
| 005 | 20261005174811.0 | ||
| 006 | m o d | ||
| 007 | cr|||||||||||| | ||
| 008 | 261005s2022 xx o u000 0 eng d | ||
| 024 | 7 |
_a10.1109/access.2022.3207287 _2doi |
|
| 035 | _a(local)OpenAlex:W4296079469 | ||
| 040 |
_alocal _beng _clocal |
||
| 041 | 0 | _aeng | |
| 100 | 0 |
_aIbomoiye Domor Mienye _eauthor. |
|
| 245 | 1 | 2 |
_aA Survey of Ensemble Learning: Concepts, Algorithms, Applications, and Prospects / _cIbomoiye Domor Mienye; Yanxia Sun. |
| 264 | 1 |
_a[Place of publication not identified] : _bInstitute of Electrical and Electronics Engineers, _c2022. |
|
| 300 | _a1 online resource (1 article). | ||
| 336 |
_atext _btxt _2rdacontent |
||
| 337 |
_acomputer _bc _2rdamedia |
||
| 338 |
_aonline resource _bcr _2rdacarrier |
||
| 500 | _aPublication type: Journal article. | ||
| 500 | _aLinked open-access copy: published version. | ||
| 506 | 0 |
_aOpen access; no subscription required for the linked open-access version. _fUnrestricted online access _2star |
|
| 520 | 3 | _aEnsemble learning techniques have achieved state-of-the-art performance in diverse machine learning applications by combining the predictions from two or more base models. This paper presents a concise overview of ensemble learning, covering the three main ensemble methods: bagging, boosting, and stacking, their early development to the recent state-of-the-art algorithms. The study focuses on the widely used ensemble algorithms, including random forest, adaptive boosting (AdaBoost), gradient boosting, extreme gradient boosting (XGBoost), light gradient boosting machine (LightGBM), and categorical boosting (CatBoost). An attempt is made to concisely cover their mathematical and algorithmic representations, which is lacking in the existing literature and would be beneficial to machine learning researchers and practitioners. | |
| 540 |
_aCreative Commons Attribution (licence family recorded by the source; version not supplied in metadata). _uhttps://openalex.org/W4296079469 |
||
| 546 | _aIn English. | ||
| 588 | 0 | _aDescription generated from OpenAlex bibliographic metadata retrieved on 5 October 2026; full text linked from the source. | |
| 590 | _aCourse allocation: B. Sc. Computer Science. | ||
| 650 | 4 | _aensemble learning | |
| 650 | 4 | _abagging | |
| 650 | 4 | _aboosting | |
| 650 | 4 | _astacking | |
| 650 | 4 | _arandom forest | |
| 650 | 4 | _aAdaBoost | |
| 653 | _aB. Sc. Computer Science | ||
| 653 | _aUMUN open access collection | ||
| 653 | _aalgorithms | ||
| 655 | 4 | _aJournal articles. | |
| 700 | 0 |
_aYanxia Sun _eauthor. |
|
| 773 | 0 |
_tIEEE Access _gVol. 10, (2022), pages/article 99129-99149 _x2169-3536 |
|
| 856 | 4 | 0 |
_uhttps://doi.org/10.1109/access.2022.3207287 _yRead open-access publication _zOpen access. Access and licence reported by the source; this host could not be independently checked by automation. _70 |
| 884 |
_aCourse selection and automated MARC21 enrichment from OpenAlex metadata. _g20261005 _khttps://openalex.org/W4296079469 _qlocal |
||
| 942 | _n0 | ||
| 999 |
_c387 _d387 |
||