Computer Science – Artificial Intelligence
Scientific paper
2005-02-01
Computer Science
Artificial Intelligence
35 pages, 2 figures, In press AI Journal
Scientific paper
Ensembles of artificial neural networks show improved generalization capabilities that outperform those of single networks. However, for aggregation to be effective, the individual networks must be as accurate and diverse as possible. An important problem is, then, how to tune the aggregate members in order to have an optimal compromise between these two conflicting conditions. We present here an extensive evaluation of several algorithms for ensemble construction, including new proposals and comparing them with standard methods in the literature. We also discuss a potential problem with sequential aggregation algorithms: the non-frequent but damaging selection through their heuristics of particularly bad ensemble members. We introduce modified algorithms that cope with this problem by allowing individual weighting of aggregate members. Our algorithms and their weighted modifications are favorably tested against other methods in the literature, producing a sensible improvement in performance on most of the standard statistical databases used as benchmarks.
Ceccatto H. A.
Granitto Pablo M.
Verdes P. F.
No associations
LandOfFree
Neural network ensembles: Evaluation of aggregation algorithms does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Neural network ensembles: Evaluation of aggregation algorithms, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Neural network ensembles: Evaluation of aggregation algorithms will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-60906