The DOI matches its Crossref record; 50 of the 50 references it cites were found in a registry or an index.
A constructive algorithm for training cooperative neural network ensembles
Abstract
Presents a constructive algorithm for training cooperative neural-network ensembles (CNNEs). CNNE combines ensemble architecture design with cooperative training for individual neural networks (NNs) in ensembles. Unlike most previous studies on training ensembles, CNNE puts emphasis on both accuracy and diversity among individual NNs in an ensemble. In order to maintain accuracy among individual NNs, the number of hidden nodes in individual NNs are also determined by a constructive approach. Incremental training based on negative correlation is used in CNNE to train individual NNs for different numbers of training epochs. The use of negative correlation learning and different training epochs for training individual NNs reflect CNNEs emphasis on diversity among individual NNs in an ensemble. CNNE has been tested extensively on a number of benchmark problems in machine learning and neural networks, including Australian credit card assessment, breast cancer, diabetes, glass, heart disease, letter recognition, soybean, and Mackey-Glass time series prediction problems. The experimental results show that CNNE can produce NN ensembles with good generalization ability.
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
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
Breiman, L. (1996) · Machine Learning · doi:10.1007/bf00058655 · Cited by 16,325
Learning Internal Representations by Error Propagation
Rumelhart, D. E., Hinton, G. E., & Williams, R. J. (1985) · doi:10.21236/ada164453 · Cited by 16,172
Adaptive Mixtures of Local Experts
Jacobs, R. A., Jordan, M. I., Nowlan, S. J., & Hinton, G. E. (1991) · Neural Computation · doi:10.1162/neco.1991.3.1.79 · Cited by 5,384
Hansen, L. K., & Salamon, P. (1990) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.58871 · Cited by 4,260
Oscillation and Chaos in Physiological Control Systems
Mackey, M. C., & Glass, L. (1977) · Science · doi:10.1126/science.267326 · Cited by 4,135
Popular Ensemble Methods: An Empirical Study
Opitz, D., & Maclin, R. (1999) · Journal of Artificial Intelligence Research · doi:10.1613/jair.614 · Cited by 2,953 · cited 10×
“For each tenfold cross-validation, they first partitioned the original dataset into ten equal-sized sets, then each set was in turn used as the test set while the remaining nine sets were used for training individual NNs in an ensemble [40].”
BackgroundMethodInfluentialDietterich, T. G. (2000) · Machine Learning · doi:10.1023/a:1007607513941 · Cited by 2,941
Hierarchical Mixtures of Experts and the EM Algorithm
Jordan, M. I., & Jacobs, R. A. (1994) · Neural Computation · doi:10.1162/neco.1994.6.2.181 · Cited by 2,673
An Empirical Comparison of Voting Classification Algorithms: Bagging, Boosting, and Variants
Bauer, E., & Kohavi, R. (1999) · Machine Learning · doi:10.1023/a:1007515423169 · Cited by 2,638
Cited by
Rokach, L. (2010) · Artificial Intelligence Review · doi:10.1007/s10462-009-9124-7 · Cited by 2,657
Diversity creation methods: a survey and categorisation
Brown, G., Wyatt, J., Harris, R., & Yao, X. (2005) · Information Fusion · doi:10.1016/j.inffus.2004.04.004 · Cited by 985
Self-citationGroup Search Optimizer: An Optimization Algorithm Inspired by Animal Searching Behavior
He, S., Wu, Q. H., & Saunders, J. R. (2009) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2009.2011992 · Cited by 724
Comprehensive Review of Neural Network-Based Prediction Intervals and New Advances
Khosravi, A., Nahavandi, S., Creighton, D., & Atiya, A. F. (2011) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.2011.2162110 · Cited by 694
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
Metaheuristic design of feedforward neural networks: A review of two decades of research
Ojha, V. K., Abraham, A., & Snášel, V. (2017) · Engineering Applications of Artificial Intelligence · doi:10.1016/j.engappai.2017.01.013 · Cited by 606
Mixture of experts: a literature survey
Masoudnia, S., & Ebrahimpour, R. (2014) · Artificial Intelligence Review · doi:10.1007/s10462-012-9338-y · Cited by 561
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
An efficient hybrid multilayer perceptron neural network with grasshopper optimization
Heidari, A. A., Faris, H., Aljarah, I., & Mirjalili, S. (2019) · Soft Computing · doi:10.1007/s00500-018-3424-2 · Cited by 283
Rokach, L. (2009) · Computational Statistics & Data Analysis · doi:10.1016/j.csda.2009.07.017 · Cited by 253
Metadata
- Authors
- Islam, M. M., Yao, X., & Murase, K.
- Venue
- IEEE Transactions on Neural Networks
- Published
- 2003-07
- Volume
- 14
- Issue
- 4
- Pages
- 820-834
- ISSN
- 1045-9227 (ISSN-L)
- OpenAlex
- W2106390255
- Cited by
- 294
- References
- 50
- FWCI
- 17.67
- Type
- journal article
- Language
- en
- Open access
- closed
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.