.png){kind=icon}
返回
Training distributed GP ensemble with a selective algorithm based on clustering and pruning for pattern classification
.png){kind=icon}
PRE
AI
DOI：10.1109/TEVC.2007.906658.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
A boosting algorithm based on cellular genetic programming (GP) to build an ensemble of predictors is proposed. The method evolves a population of trees for a fixed number of rounds and, after each round, it chooses the predictors to include in the ensemble by applying a clustering algorithm to the population of classifiers. Clustering the population allows the selection of the most diverse and fittest trees that best contribute to improve classification accuracy. The method proposed runs on a distributed hybrid environment that combines the island and cellular models of parallel GP. The combination of the two models provides an efficient implementation of distributed GP, and, at the same time, the generation of low sized and accurate decision trees. The large amount of memory required to store the ensemble affects the performance of the method. This paper shows that, by applying suitable pruning strategies, it is possible to select a subset of the classifiers without increasing misclassification errors; indeed for some data sets, for up to 30% of pruning, ensemble accuracy increases. Experimental results show that the combination of clustering and pruning enhances classification accuracy of the ensemble approach.
Keyword:
boosting
classification
clustering
data mining
ensemble
genetic programming (GP)
期刊
IF:
12
论文数:
1.9K
被引数:
2.4W
机构
引用论文
Thiol-functionalized silica colloids, grains, and membranes for irreversible adsorption of metal(oxide) nanoparticles用于金属 (氧化物) 纳米颗粒不可逆吸附的硫醇官能化二氧化硅胶体，颗粒和膜
OAAI
OAAI分享收藏
分享收藏An experimental comparison of three methods for constructing ensembles of decision trees: Bagging, boosting, and randomization.png)
MACHINE LEARNINGOAAI
MACHINE LEARNINGIF2.9
OAAI分享收藏
查看更多内容