Tri-objective optimization-based cascade ensemble pruning for deep forest

被引:0
作者
Ji, Junzhong [1 ]
Li, Junwei [1 ]
机构
[1] Beijing Univ Technol, Beijing Artificial Intelligence Inst, Beijing Municipal Key Lab Multimedia & Intelligent, Fac Informat Technol, Beijing 100124, Peoples R China
关键词
Ensemble learning; Ensemble pruning; Deep forest; Multi-objective optimization; Coupled diversity;
D O I
10.1016/j.patcog.2023.109744
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Deep forest is a new multi-layer ensemble model, where the high time costs and storage requirements inhibit its large-scale application. However, current deep forest pruning methods used to alleviate these drawbacks do not consider its cascade coupling characteristics. Therefore, we propose a tri-objective optimization-based cascade ensemble pruning (TOOCEP) algorithm for it. Concretely, we first present a tri-objective optimization-based single-layer pruning (TOOSLP) method to prune its single-layer by simultaneously optimizing three objectives, namely accuracy, independent diversity, and coupled diversity. Particularly, the coupled diversity is designed for deep forest to deal with the coupling relationships between its adjacent layers. Then, we perform TOOSLP in a cascade framework to prune the deep forest layer-by-layer. Experimental results on 15 UCI datasets show that TOOCEP outperforms several state-ofthe-art methods in accuracy and pruned rate, which significantly reduces the storage space and accelerate the prediction speed of deep forest. & COPY; 2023 Elsevier Ltd. All rights reserved.
引用
收藏
页数:12
相关论文
共 34 条
[1]  
Abualigah, 2019, FEATURE SELECTION EN, DOI [10.1007/978-3-030-10674-4, DOI 10.1007/978-3-030-10674-4]
[2]   Aquila Optimizer: A novel meta-heuristic optimization algorithm [J].
Abualigah, Laith ;
Yousri, Dalia ;
Abd Elaziz, Mohamed ;
Ewees, Ahmed A. ;
Al-qaness, Mohammed A. A. ;
Gandomi, Amir H. .
COMPUTERS & INDUSTRIAL ENGINEERING, 2021, 157 (157)
[3]   An ensemble approach for supporting the respiratory isolation of presumed tuberculosis inpatients [J].
Alves, E. D. S. ;
Souza Filho, Joao B. O. ;
Kritski, A. L. .
NEUROCOMPUTING, 2019, 331 :289-300
[4]   A bi-objective optimization method to produce a near-optimal number of classifiers and increase diversity in Bagging [J].
Asadi, Shahrokh ;
Roshan, Seyed Ehsan .
KNOWLEDGE-BASED SYSTEMS, 2021, 213
[5]   Deep Progressive Hashing for Image Retrieval [J].
Bai, Jiale ;
Ni, Bingbing ;
Wang, Minsi ;
Li, Zefan ;
Cheng, Shuo ;
Yang, Xiaokang ;
Hu, Chuanping ;
Gao, Wen .
IEEE TRANSACTIONS ON MULTIMEDIA, 2019, 21 (12) :3178-3193
[6]   Random forests [J].
Breiman, L .
MACHINE LEARNING, 2001, 45 (01) :5-32
[7]   A novel ensemble pruning algorithm based on randomized greedy selective strategy and ballot [J].
Dai, Qun .
NEUROCOMPUTING, 2013, 122 :258-265
[8]   An Evolutionary Many-Objective Optimization Algorithm Using Reference-Point-Based Nondominated Sorting Approach, Part I: Solving Problems With Box Constraints [J].
Deb, Kalyanmoy ;
Jain, Himanshu .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2014, 18 (04) :577-601
[9]   Ensemble methods in machine learning [J].
Dietterich, TG .
MULTIPLE CLASSIFIER SYSTEMS, 2000, 1857 :1-15
[10]   A non-specialized ensemble classifier using multi-objective optimization [J].
Fletcher, Sam ;
Verma, Brijesh ;
Zhang, Mengjie .
NEUROCOMPUTING, 2020, 409 :93-102