Ensembling neural networks: Many could be better than all

被引:1398
作者
Zhou, ZH [1 ]
Wu, JX [1 ]
Tang, W [1 ]
机构
[1] Nanjing Univ, Natl Lab Novel Software Technol, Nanjing 210093, Peoples R China
关键词
neural networks; neural network ensemble; machine learning; selective ensemble; boosting; bagging; genetic algorithm; bias-variance decomposition;
D O I
10.1016/S0004-3702(02)00190-X
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
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. (C) 2002 Elsevier Science B.V. All rights reserved.
引用
收藏
页码:239 / 263
页数:25
相关论文
共 50 条
[31]   Dynamic Analysis of a General Class of Winner-Take-All Competitive Neural Networks [J].
Fang, Yuguang ;
Cohen, Michael A. ;
Kincaid, Thomas G. .
IEEE TRANSACTIONS ON NEURAL NETWORKS, 2010, 21 (05) :771-783
[32]   Are northeast and western Himalayas earthquake dynamics better "organized" than Central Himalayas: An artificial neural network approach [J].
Lakshmi, S. Sri ;
Tiwari, R. K. .
GEOFISICA INTERNACIONAL, 2007, 46 (01) :65-75
[33]   A winner-take-all approach to emotional neural networks with universal approximation property [J].
Lotfi, E. ;
Akbarzadeh-T, M. -R. .
INFORMATION SCIENCES, 2016, 346 :369-388
[34]   Addi-Reg: A Better Generalization-Optimization Tradeoff Regularization Method for Convolutional Neural Networks [J].
Lu, Yao ;
Zhang, Zheng ;
Lu, Guangming ;
Zhou, Yicong ;
Li, Jinxing ;
Zhang, David .
IEEE TRANSACTIONS ON CYBERNETICS, 2022, 52 (10) :10827-10842
[35]   Local Epigenomic Data are more Informative than Local Genome Sequence Data in Predicting Enhancer-Promoter Interactions Using Neural Networks [J].
Xiao, Mengli ;
Zhuang, Zhong ;
Pan, Wei .
GENES, 2020, 11 (01)
[36]   Not So Robust after All: Evaluating the Robustness of Deep Neural Networks to Unseen Adversarial Attacks [J].
Garaev, Roman ;
Rasheed, Bader ;
Khan, Adil Mehmood .
ALGORITHMS, 2024, 17 (04)
[37]   Physics-Based Approach for a Neural Networks Enabled Design of All-Dielectric Metasurfaces [J].
Tanriover, Ibrahim ;
Hadibrata, Wisnu ;
Aydin, Koray .
ACS PHOTONICS, 2020, 7 (08) :1957-1964
[38]   The sample complexity of pattern classification with neural networks: The size of the weights is more important than the size of the network [J].
Bartlett, PL .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1998, 44 (02) :525-536
[39]   The deep arbitrary polynomial chaos neural network or how Deep Artificial Neural Networks could benefit from data-driven homogeneous chaos theory [J].
Oladyshkin, Sergey ;
Praditia, Timothy ;
Kroeker, Ilja ;
Mohammadi, Farid ;
Nowak, Wolfgang ;
Otte, Sebastian .
NEURAL NETWORKS, 2023, 166 :85-104
[40]   Decision trees work better than feed-forward back-prop neural nets for a specific class of problems [J].
Liu, XM ;
Bowyer, KW ;
Hall, LO .
2004 IEEE INTERNATIONAL CONFERENCE ON SYSTEMS, MAN & CYBERNETICS, VOLS 1-7, 2004, :5969-5974