The DOI matches its Crossref record; 28 of the 28 references it cites were found in a registry or an index.
Evolutionary ensembles with negative correlation learning
Abstract
Based on negative correlation learning and evolutionary learning, this paper presents evolutionary ensembles with negative correlation learning (EENCL) to address the issues of automatic determination of the number of individual neural networks (NNs) in an ensemble and the exploitation of the interaction between individual NN design and combination. The idea of EENCL is to encourage different individual NNs in the ensemble to learn different parts or aspects of the training data so that the ensemble can learn better the entire training data. The cooperation and specialization among different individual NNs are considered during the individual NN design. This provides an opportunity for different NNs to interact with each other and to specialize. Experiments on two real-world problems demonstrate that EENCL 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
Genetic algorithms in search, optimization, and machine learning
(1989) · Choice Reviews Online · doi:10.5860/choice.27-0936 · Cited by 49,010
(1967) · Cited by 23,719
Genetic Algorithms in Search, Optimization and Machine Learning
Goldberg, D. E., & Robson, D. (1988) · Cited by 18,391
Learning Internal Representations by Error Propagation
Rumelhart, D. E., Hinton, G. E., & Williams, R. J. (1985) · doi:10.21236/ada164453 · Cited by 16,172
Cross validatory choice and assessment of statistical predictions
Stone, M. (1974) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1974.tb00994.x · Cited by 10,881
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
The Strength of Weak Learnability
Schapire, R. E. (1990) · Machine Learning · doi:10.1007/bf00116037 · Cited by 4,600
Hansen, L. K., & Salamon, P. (1990) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.58871 · Cited by 4,260
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
Evolutionary Computation: Towards a New Philosophy of Machine Intelligence
Fogel, D. B. (1995) · IEEE Press eBooks · Cited by 2,283
Machine Learning, Neural and Statistical Classification
Fulkerson, B. (1995) · Technometrics · doi:10.1080/00401706.1995.10484383 · Cited by 2,209
Evolutionary computation: Toward a new philosophy of machine intelligence
B�ck, T. (1997) · Complexity · doi:10.1002/(sici)1099-0526(199703/04)2:4<28::aid-cplx7>3.0.co;2-2 · Cited by 1,533
Niching methods for genetic algorithms
Mahfoud, S. W. (1996) · Cited by 897
A new evolutionary system for evolving artificial neural networks
Yao, X., & Liu, Y. (1997) · IEEE Transactions on Neural Networks · doi:10.1109/72.572107 · Cited by 874
Self-citationOn Combining Artificial Neural Nets
SHARKEY, A. J. C. (1996) · Connection Science · doi:10.1080/095400996116785 · Cited by 513
Jacobs, R. A., Jordan, M. I., & Barto, A. G. (1991) · Cognitive Science · doi:10.1207/s15516709cog1502_2 · Cited by 490
Pandemonium: a paradigm for learning
Selfridge, O. G. (1988) · The MIT Press eBooks · Cited by 470
Learning machines: foundations of trainable pattern-classifying systems
Nilsson, N. J. (1965) · Cited by 456
Boosting and Other Ensemble Methods
Drucker, H., Cortes, C., Jackel, L. D., LeCun, Y., & Vapnik, V. (1994) · Neural Computation · doi:10.1162/neco.1994.6.6.1289 · Cited by 357
Simultaneous training of negatively correlated neural networks in an ensemble
Liu, Y., & Yao, X. (1999) · IEEE Transactions on Systems, Man and Cybernetics, Part B (Cybernetics) · doi:10.1109/3477.809027 · Cited by 267
Self-citationMaking use of population information in evolutionary artificial neural networks
Yao, X., & Liu, Y. (1998) · IEEE Transactions on Systems, Man and Cybernetics, Part B (Cybernetics) · doi:10.1109/3477.678637 · Cited by 257
Self-citationEnsemble Learning Using Decorrelated Neural Networks
ROSEN, B. E. (1996) · Connection Science · doi:10.1080/095400996116820 · Cited by 248
Improving Performance in Neural Networks Using a Boosting Algorithm
Drucker, H., Schapire, R. E., & Simard, P. (1992) · neural information processing systems · Cited by 157
A competitive modular connectionist architecture
Jacobs, R. A., & Jordan, M. I. (1990) · Cited by 140
Speciation as automatic categorical modularization
Darwen, P. J., & Yao, X. (1997) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.687878 · Cited by 128
Self-citationImplicit Niching in a Learning Classifier System: Nature's Way
Horn, J., Goldberg, D. E., & Deb, K. (1994) · Evolutionary Computation · doi:10.1162/evco.1994.2.1.37 · Cited by 127
Bias/Variance Analyses of Mixtures-of-Experts Architectures
Jacobs, R. A. (1997) · Neural Computation · doi:10.1162/neco.1997.9.2.369 · Cited by 82
A cooperative ensemble learning system
Liu, Y., & Yao, X. (2002) · International Joint Conference on Neural Networks (IJCNN) · doi:10.1109/ijcnn.1998.687202 · Cited by 41
Self-citation
Cited by
Multiobjective Deep Belief Networks Ensemble for Remaining Useful Life Estimation in Prognostics
Zhang, C., Lim, P., Qin, A. K., & Tan, K. C. (2017) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2016.2582798 · Cited by 870
Group 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
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
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
Metadata
- Authors
- Higuchi, T., Yao, X., & Liu, Y.
- Venue
- IEEE Transactions on Evolutionary Computation
- Published
- 2000
- Volume
- 4
- Issue
- 4
- Pages
- 380-387
- ISSN
- 1089-778X (ISSN-L)
- OpenAlex
- W2145833756
- Cited by
- 445
- References
- 28
- FWCI
- 10.41
- 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.