The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
Neural network ensembles: evaluation of aggregation algorithms
Open accessAbstract
Ensembles of artificial neural networks show improved generalization capabilities that outperform those of single networks. However, for aggregation to be effective, the individual networks must be as accurate and diverse as possible. An important problem is, then, how to tune the aggregate members in order to have an optimal compromise between these two conflicting conditions. We present here an extensive evaluation of several algorithms for ensemble construction, including new proposals and comparing them with standard methods in the literature. We also discuss a potential problem with sequential aggregation algorithms: the non-frequent but damaging selection through their heuristics of particularly bad ensemble members. We introduce modified algorithms that cope with this problem by allowing individual weighting of aggregate members. Our algorithms and their weighted modifications are favorably tested against other methods in the literature, producing a sensible improvement in performance on most of the standard statistical databases used as benchmarks.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Breiman, L. (2001) · Machine Learning · doi:10.1023/a:1010933404324 · Cited by 133,538
Greedy function approximation: A gradient boosting machine
Friedman, J. H. (2001) · The Annals of Statistics · doi:10.1214/aos/1013203451 · Cited by 30,731
A decision-theoretic generalization of on-line learning and an application to boosting
Freund, Y., & Schapire, R. E. (1997) · Journal of Computer and System Sciences · doi:10.1006/jcss.1997.1504 · Cited by 20,466
Neural Networks and the Bias/Variance Dilemma
Geman, S., Bienenstock, E., & Doursat, R. (1992) · Neural Computation · doi:10.1162/neco.1992.4.1.1 · Cited by 3,578 · cited 2×
“Formal support to this property is provided by the so-called bias/variance dilemma [12], based on a suitable decomposition of the prediction error.”
MethodEnsembling neural networks: Many could be better than all
Zhou, Z.-H., Wu, J., & Tang, W. (2002) · Artificial Intelligence · doi:10.1016/s0004-3702(02)00190-x · Cited by 1,964 · cited 2×
“Before closing, we want to comment on a recent work[24] partially related to the present one.”
BackgroundMethod
Cited by
Distributed learning of deep neural network over multiple agents
Gupta, O., & Raskar, R. (2018) · Journal of Network and Computer Applications · doi:10.1016/j.jnca.2018.05.003 · Cited by 726
Ensemble approaches for regression: A survey
Mendes-Moreira, J., Soares, C., Jorge, A. M., & Sousa, J. F. D. (2012) · ACM Computing Surveys · doi:10.1145/2379776.2379786 · Cited by 667
Ensembles for feature selection: A review and future trends
Bolón-Canedo, V., & Alonso-Betanzos, A. (2019) · Information Fusion · doi:10.1016/j.inffus.2018.11.008 · Cited by 541
A dynamic ensemble learning algorithm for neural networks
Alam, K. M. R., Siddique, N., & Adeli, H. (2020) · Neural Computing and Applications · doi:10.1007/s00521-019-04359-7 · Cited by 536
A Survey on ensemble learning under the era of deep learning
Yang, Y., Lv, H., & Chen, N. (2023) · Artificial Intelligence Review · doi:10.1007/s10462-022-10283-5 · Cited by 369
Ensemble deep learning in bioinformatics
Cao, Y., Geddes, T. A., Yang, J. Y. H., & Yang, P. (2020) · Nature Machine Intelligence · doi:10.1038/s42256-020-0217-y · Cited by 354
Lambert, B., Forbes, F., Doyle, S., Dehaene, H., & Dojat, M. (2024) · Artificial Intelligence in Medicine · doi:10.1016/j.artmed.2024.102830 · Cited by 269
A Q-learning-based multi-agent system for data classification
Pourpanah, F., Tan, C. J., Lim, C. P., & Mohamad-Saleh, J. (2017) · Applied Soft Computing · doi:10.1016/j.asoc.2016.10.016 · Cited by 38
Arnold, S., Tanaka, D., & Yamazaki, K. (2023) · Frontiers in Neurorobotics · doi:10.3389/fnbot.2022.1045747 · Cited by 6
Metadata
- Authors
- Granitto, P. M., Verdes, P. F., & Ceccatto, H. A.
- Venue
- Artificial Intelligence
- Publisher
- Elsevier BV
- Published
- 2005-04
- Volume
- 163
- Issue
- 2
- Pages
- 139-162
- ISSN
- 0004-3702 (ISSN-L)
- OpenAlex
- W2022747340
- Cited by
- 167
- References
- 5
- FWCI
- 5.08
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.