Ensembling neural networks: many could be better than all
Artificial Intelligence
Pruning and dynamic scheduling of cost-sensitive ensembles
Eighteenth national conference on Artificial intelligence
Clustering ensembles of neural network models
Neural Networks
Ensemble selection from libraries of models
ICML '04 Proceedings of the twenty-first international conference on Machine learning
Reduced Ensemble Size Stacking
ICTAI '04 Proceedings of the 16th IEEE International Conference on Tools with Artificial Intelligence
Pruning in ordered bagging ensembles
ICML '06 Proceedings of the 23rd international conference on Machine learning
Getting the Most Out of Ensemble Selection
ICDM '06 Proceedings of the Sixth International Conference on Data Mining
Managing Diversity in Regression Ensembles
The Journal of Machine Learning Research
Using boosting to prune bagging ensembles
Pattern Recognition Letters
Ensemble Pruning Via Semi-definite Programming
The Journal of Machine Learning Research
Genetic fingerprinting for copyright protection of multicast media
Soft Computing - A Fusion of Foundations, Methodologies and Applications - Special Issue on Bio-Inspired Information Hiding; Guest editors: Jeng-Shyang Pan, Ajith Abraham
An Analysis of Ensemble Pruning Techniques Based on Ordered Aggregation
IEEE Transactions on Pattern Analysis and Machine Intelligence
Genetic Algorithm with Histogram Construction Technique
ICETET '09 Proceedings of the 2009 Second International Conference on Emerging Trends in Engineering & Technology
Hi-index | 0.00 |
Committee machines are a set of experts that their outputs are combined to improve the performance of the whole system which tend to grow into unnecessarily large size in most of the time. This can lead to extra memory usage, computational costs, and occasional decreases in effectiveness. Expert pruning is an intermediate technique to search for a good subset of all members before combining them. In this paper we studied an expert pruning method based on genetic algorithm to prune regression members. The proposed algorithm searches to find a best subset of experts by creating a logical weight for each member and chooses which member that the related weight is equal to one. The final weights for selected experts are calculated by genetic algorithm method. The results showed that MSE and R-square for the pruned CM are 0.148 and 0.9032 respectively that are reasonable rather than all experts separately.