• 中国精品科技期刊
  • CCF推荐A类中文期刊
  • 计算领域高质量科技期刊T1类
Advanced Search
Xie Yuancheng and Yang Jingyu. Hierachical Bagging Ensemble Pruning Based on Deleting Worst Base Learner[J]. Journal of Computer Research and Development, 2009, 46(2): 261-267.
Citation: Xie Yuancheng and Yang Jingyu. Hierachical Bagging Ensemble Pruning Based on Deleting Worst Base Learner[J]. Journal of Computer Research and Development, 2009, 46(2): 261-267.

Hierachical Bagging Ensemble Pruning Based on Deleting Worst Base Learner

More Information
  • Published Date: February 14, 2009
  • The problem of selecting the best combination of classifiers from an ensemble has been shown to be NP-complete. Several strategies have been used to reduce the number of the units in ensemble classifier. The main objective of selective ensemble is to find a rapid pruning method for bagging to reduce the storage needs, speed up the classification process and obtain the potential of improving the classification accuracy. Those traditional methods of selective ensemble focus on the diversity of base learners. Diversity implies many-to-many relationship and agreement implies one-to-many relationship, so bagging pruning based on agreement may be an easy way for selective ensemble. A new selective ensemble algorithm(HDW-bagging), which is based on researching on the agreement of base learners, is proposed in this paper. That is to find the worst base learner which can reduce the ensemble generalization error of the rest base learners by deleting itself. Hierachical pruning is used to speed up the new algorithm. The new algorithm's running time is close to bagging and the performance of the new algorithm is superior to the bagging algorithm. The new algorithm's training time efficiency is superior to GASEN's and the performance of the new algorithm is close to that of GASEN. And the new Algorithm supports parallel computing.
  • Related Articles

    [1]Su Huayou, Wen Wen, Li Dongsheng. Optimization and Parallelization Single Particle Cryo-EM Software RELION with GPU[J]. Journal of Computer Research and Development, 2018, 55(2): 409-417. DOI: 10.7544/issn1000-1239.2018.20160873
    [2]Liu Zhixiang, Fang Yong, Song Anping, Xu Lei, Wang Xiaowei, Zhou Liping, Zhang Wu. Large-Scale Scalable Parallel Computing Based on LBM with Multiple-Relaxation-Time Model[J]. Journal of Computer Research and Development, 2016, 53(5): 1156-1165. DOI: 10.7544/issn1000-1239.2016.20148441
    [3]Tang Liang, Luo Zuying, Zhao Guoxing, and Yang Xu. SOR-Based P/G Solving Algorithm of Linear Parallelism for GPU Computing[J]. Journal of Computer Research and Development, 2013, 50(7): 1491-1500.
    [4]Liu Quan, Fu Qiming, Yang Xudong, Jing Ling, Li Jin, Li Jiao. A Scalable Parallel Reinforcement Learning Method Based on Intelligent Scheduling[J]. Journal of Computer Research and Development, 2013, 50(4): 843-851.
    [5]Cai Yong, Li Guangyao, and Wang Hu. Parallel Computing of Central Difference Explicit Finite Element Based on GPU General Computing Platform[J]. Journal of Computer Research and Development, 2013, 50(2): 412-419.
    [6]Liu Yi, Zhang Xin, Li He, Qian Depei. A Heuristic Task Allocation Algorithm for Multi-Core Based Parallel Systems[J]. Journal of Computer Research and Development, 2009, 46(6): 1058-1064.
    [7]Zhao Mingyu and Zhang Tianwen. DAG Scheduling for Synchronous Communication in the Network Computing Environment[J]. Journal of Computer Research and Development, 2008, 45(4): 695-705.
    [8]Li Yan, Li Tian, Xie Bing, Zhang Lu, and Sun Jiasu. A P2P-Based Component Library Interconnection Technique Supporting Query Refactoring[J]. Journal of Computer Research and Development, 2007, 44(12): 2122-2129.
    [9]Tang Lei, Liao Yuan, Li Mingshu, Huai Xiaoyong. The Dynamic Deployment Problem and the Algorithm of Service Component for Pervasive Computing[J]. Journal of Computer Research and Development, 2007, 44(5): 815-822.
    [10]Xu Shengchao, Jin Hai, Zhang Qin, and Shi Ke. Construction of a Cooperative-Server-Group-Based Volunteer Computing Environment[J]. Journal of Computer Research and Development, 2007, 44(3).

Catalog

    Article views (846) PDF downloads (544) Cited by()

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return