Fast decorrelated neural network ensembles with random weights-Reference-Cited by-同舟云学术

Fast decorrelated neural network ensembles with random weights

Published:2014-04 Issue: Volume:264 Page:104-117
ISSN:0020-0255
Container-title:Information Sciences
language:en
Short-container-title:Information Sciences

Author:

Alhamdoosh Monther,Wang Dianhui

Publisher

Elsevier BV

Subject

Artificial Intelligence,Information Systems and Management,Computer Science Applications,Theoretical Computer Science,Control and Systems Engineering,Software

Reference34 articles.

1. Bagging predictors;Breiman;Mach. Learn.,1996

2. The strength of weak learnability;Schapire;Mach. Learn.,1990

3. Y. Freund, Boosting a weak learning algorithm by majority, in: Proceedings of the 3rd Annual Workshop on Computational Learning Theory, Rochester NY, USA, 1990, pp. 202–216.

4. L. Breiman, Radnom Forests – Random Features, Tech. Rep. 567, University of California, Berkeley CA, USA, 1999.

5. Neural network ensembles;Hansen;IEEE Trans. Pattern Anal. Mach. Intell.,1990

Cited by 153 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Greedy deep stochastic configuration networks ensemble with boosting negative correlation learning;Information Sciences;2024-10

2. Deep negative correlation classification;Machine Learning;2024-08-28

3. The impact of random parameter distribution on RVFL model performance in bearing fault diagnosis;International Journal of Machine Learning and Cybernetics;2024-08-14

4. Industry Image Classification Based on Stochastic Configuration Networks and Multi-Scale Feature Analysis;Sensors;2024-07-24

5. A Multiobjective Optimization Algorithm for Fluid Catalytic Cracking Process with Constraints and Dynamic Environments;Mathematics;2024-07-22