提出了一种应用于分类问题,以分类回归树为基学习器,并综合了Ada Boost.M1和Bagging算法特点,利用变相似度聚类技术和贪婪算法来进行选择性集成学习的算法——SEC-Ada Boost Bagging Trees,并将其与几种常用的机器学习算法比较研究得出,该算法往往比其他算法具有更好的泛化性能和更高的运行效率。
This paper introduced a new ensemble algorithm, SEC-AdaBoostBagging Trees ensemble algorithm, which was a combination of tree classifiers and was based on variational similarity cluster technology and greedy method, and it was also combined with the features of AdaBoost. M1 and Bagging. Compared with a series of other learning algorithms, it often has better generalization ability and higher efficiency.