Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat

The DOI matches its Crossref record; 44 of the 52 references it cites were found in a registry or an index.

Ensembling neural networks: Many could be better than all

Open access
Zhou, Zhi-Hua, Wu, Jianxin, Tang, Wei · 2002 · Artificial Intelligence

Abstract

Neural network ensemble is a learning paradigm where many neural networks are jointly used to solve a problem. In this paper, the relationship between the ensemble and its component neural networks is analyzed from the context of both regression and classification, which reveals that it may be better to ensemble many instead of all of the neural networks at hand. This result is interesting because at present, most approaches ensemble all the available neural networks for prediction. Then, in order to show that the appropriate neural networks for composing an ensemble can be effectively selected from a set of available neural networks, an approach named GASEN is presented. GASEN trains a number of neural networks at first. Then it assigns random weights to those networks and employs genetic algorithm to evolve the weights so that they can characterize to some extent the fitness of the neural networks in constituting an ensemble. Finally it selects some neural networks based on the evolved weights to make up the ensemble. A large empirical study shows that, compared with some popular ensemble approaches such as Bagging and Boosting, GASEN can generate neural network ensembles with far smaller sizes but stronger generalization ability. Furthermore, in order to understand the working mechanism of GASEN, the bias-variance decomposition of the error is provided in this paper, which shows that the success of GASEN may lie in that it can significantly reduce the bias as well as the variance.

Overview

Integrity signals

Registry

Crossref · 10.1016/s0004-3702(02)00190-x

Cites

44 of 44 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Verification

Claims the paper makes

We couldn’t retrieve this paper’s full text, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

Citations

Cites

Show all 52 references

Cited by

See all 1,964

Metadata

Authors
Zhou, Z.-H., Wu, J., & Tang, W.
Affiliations
Nanjing University (CN)
Corresponding author
Zhou, Zhi-Hua
Venue
Artificial Intelligence
Publisher
Elsevier BV
Published
2002-05
Volume
137
Issue
1-2
Pages
239-263
ISSN
0004-3702 (ISSN-L)
OpenAlex
W2100128988
Cited by
1,964
References
52
Citations by year
2026: 39 · 2025: 65 · 2024: 69 · 2023: 75 · 2022: 112 · 2021: 152 · 2020: 115 · 2019: 120 · 2018: 119 · 2017: 113 · 2016: 91 · 2015: 111 · 2014: 121 · 2013: 89 · 2012: 81
FWCI
21.03
Type
journal article
Language
en
Open access
Licence
Locations
Artificial Intelligence (publishedVersion)
Funders
  • National Natural Science Foundation of China
  • Natural Science Foundation of Jiangsu Province
  • Nanjing University
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Neural Networks and Applications
  • Physical Sciences › Computer Science › Artificial Intelligence › Machine Learning and Data Classification
  • Physical Sciences › Computer Science › Artificial Intelligence › Machine Learning and ELM
Keywords
neural network ensembles, genetic algorithm, ensemble weighting, bias-variance decomposition, regression analysis, classification, model generalization, bagging, boosting

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

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Ensembling neural networks: Many could be better than all. https://app.cochat.ai/papers/10.1016/s0004-3702(02)00190-x
The paper
Zhou, Z.-H., Wu, J., & Tang, W. (2002). Ensembling neural networks: Many could be better than all. Artificial Intelligence. https://doi.org/10.1016/s0004-3702(02)00190-x

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.