Design of lightweight incremental ensemble learning algorithm

被引:0
|
作者
Ding J. [1 ]
Tang J. [1 ]
Yu Z. [1 ]
机构
[1] School of Electronic Engineering, Xidian University, Xi'an
关键词
Classification and regression tree (CART); Computational complexity; Emitter classification; Ensemble learning; Open set recognition;
D O I
10.12305/j.issn.1001-506X.2021.04.01
中图分类号
学科分类号
摘要
Conventional classification and regression tree (CART) can only increase the cognition of new categories by retraining the entire model, causing a great increase in training costs when the number of sample categories is large. To solve this problem, a lightweight incremental ensemble learning algorithm is proposed. When new categories enter the training set, we can classify those new categories by only adding CART base classifiers with the ability of open set recognition into the original ensemble learning algorithm. No retraining is required, so the computational complexity is reduced and the learning process is simplified. In the simulation experiments with the background of emitter classification, the results show that this algorithm can maintain the classification accuracy of more than 90% when the signal noise ratio equal to or larger than -4 dB. In the case of a large number of categories to be classified, this algorithm can significantly reduce the training cost compared with conventional CART. © 2021, Editorial Office of Systems Engineering and Electronics. All right reserved.
引用
收藏
页码:861 / 867
页数:6
相关论文
共 26 条
  • [11] LI B, HAN R, HE Y G, Et al., Applications of the improved random forest algorithm in fault diagnosis of motor bearings, Proceedings of the CSEE, 40, 4, pp. 1310-1319, (2020)
  • [12] ZHOU X Y, LU P, ZHENG Z J, Et al., Accident prediction accuracy assessment for highway-rail grade crossings using random forest algorithm compared with decision tree, Reliability Engineering and System Safety, 200, (2020)
  • [13] ZHAO Y, SHI C, YANG T, Et al., Low-complexity and joint modulation format identification and OSNR estimation using random forest for flexible coherent receivers, Optics Communications, 457, (2020)
  • [14] LITTLESTONE N., From on-line to batch learning, Proc.of the Workshop on Computational Learning Theory, pp. 269-284, (1989)
  • [15] DING S F, ZHANG N, ZHANG J, Et al., Unsupervised extreme learning machine with representational features, International Journal of Machine Learning and Cybernetics, 8, 2, pp. 587-595, (2017)
  • [16] ZHANG J, DING S F, ZHANG N, Et al., Incremental extreme learning machine based on deep feature embedded, International Journal of Machine Learning and Cybernetics, 7, 1, pp. 111-120, (2016)
  • [17] WANG W Z, WU H, SUO Z Y, Et al., A fast radar emitter recognition algorithm based on rough k-means combined with Adaboost, Journal of Air Force Engineering University (Natural Science Edition), 17, 1, pp. 51-55, (2016)
  • [18] XU X, XIONG Z H, WANG W., Incremental discriminant analysis on interval-valued parameters for emitter identification
  • [19] FANG Z W, ZHANG J Y, LI K, Et al., Semi-supervised feature extraction of communication emitter under small sample condition, Systems Engineering and Electronics, 42, 10, pp. 239-247, (2020)
  • [20] HUANG Y K, JIN W D, YU Z B, Et al., Radar emitter signal recognition based on deep learning and ensemble learning, Systems Engineering and Electronics, 40, 11, pp. 2420-2425, (2018)