An Evolutionary Multitasking Method for High-Dimensional Receiver Operating Characteristic Convex Hull Maximization

被引:2
|
作者
Cheng, Fan [1 ,2 ]
Shu, Shengda [3 ]
Zhang, Lei [1 ,2 ]
Tan, Ming [4 ]
Qiu, Jianfeng [1 ,2 ]
机构
[1] Anhui Univ, Inst Informat Mat, Sch Artificial Intelligence, Hefei 230601, Peoples R China
[2] Anhui Univ, Sch Artificial Intelligence, Intelligent Sensing Lab Anhui Prov, Hefei 230601, Peoples R China
[3] Anhui Univ, Sch Comp Sci & Technol, Hefei 230601, Peoples R China
[4] Hefei Univ, Sch Artificial Intelligence & Big Data, Hefei 230601, Peoples R China
基金
中国国家自然科学基金;
关键词
Evolutionary computation; Evolutionary multitasking; ROC convex hull; multi-objective evolutionary algorithm; knowledge transfer; classification; OPTIMIZATION; ALGORITHM; CLASSIFICATION; CLASSIFIERS; AREA;
D O I
10.1109/TETCI.2024.3354101
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Maximizing receiver operating characteristic convex hull (ROCCH) is a hot research topic of binary classification, since it can obtain good classifiers under either balanced or imbalanced situation. Recently, evolutionary algorithms (EAs) especially multi-objective evolutionary algorithms (MOEAs) have shown their competitiveness in addressing the problem of ROCCH maximization. Thus, a series of MOEAs with promising performance have been proposed to tackle it. However, designing a MOEA for high-dimensional ROOCH maximization is much more challenging due to the "curse of dimension". To this end, in this paper, an evolutionary multitasking approach (termed as EMT-ROCCH) is proposed, where a low-dimensional ROCCH maximization task T-a is constructed to assist the original high-dimensional task T-o. Specifically, in EMT-ROCCH, a low-dimensional assisted task T-a is firstly created. Then, two populations, P-a and P-o, are used to evolve tasks T-a and T-o, respectively. During the evolution, a knowledge transfer from P-a to P-o is designed to transfer the useful knowledge from P-a to accelerate the convergence of P-o. Moreover, a knowledge transfer from P-o to P-a is developed to utilize the useful knowledge in P-o to repair the individuals in P-a, aiming to avoid P-a being trapped into the local optima. Experiment results on 12 high-dimensional datasets have shown that compared with the state-of-the-arts, the proposed EMT-ROCCH could achieve ROCCH with higher quality.
引用
下载
收藏
页码:1699 / 1713
页数:15
相关论文
共 50 条
  • [41] Evolutionary Subspace Clustering Algorithm for High-Dimensional Data
    Nourashrafeddin, S. N.
    Arnold, Dirk V.
    Milios, Evangelos
    PROCEEDINGS OF THE FOURTEENTH INTERNATIONAL CONFERENCE ON GENETIC AND EVOLUTIONARY COMPUTATION COMPANION (GECCO'12), 2012, : 1497 - 1498
  • [43] Improving evolutionary algorithms with scouting: High-dimensional problems
    Bousmalis, Konstantinos
    Pfaffmann, Jeffrey O.
    Hayes, Gillian M.
    ARTIFICIAL INTELLIGENCE AND SOFT COMPUTING - ICAISC 2008, PROCEEDINGS, 2008, 5097 : 365 - +
  • [44] Pattern Alternating Maximization Algorithm for Missing Data in High-Dimensional Problems
    Stadler, Nicolas
    Stekhoven, Daniel J.
    Buehlmann, Peter
    JOURNAL OF MACHINE LEARNING RESEARCH, 2014, 15 : 1903 - 1928
  • [45] The nearest polyhedral convex conic regions for high-dimensional classification
    Cevikalp, Hakan
    Cimen, Emre
    Ozturk, Gurkan
    TURKISH JOURNAL OF ELECTRICAL ENGINEERING AND COMPUTER SCIENCES, 2021, 29 (02) : 913 - 928
  • [46] Introduction to the LASSO A Convex Optimization Approach for High-dimensional Problems
    Gauraha, Niharika
    RESONANCE-JOURNAL OF SCIENCE EDUCATION, 2018, 23 (04): : 439 - 464
  • [47] A convex formulation for high-dimensional sparse sliced inverse regression
    Tan, Kean Ming
    Wang, Zhaoran
    Zhang, Tong
    Liu, Han
    Cook, R. Dennis
    BIOMETRIKA, 2018, 105 (04) : 769 - 782
  • [48] Pattern alternating maximization algorithm for missing data in high-dimensional problems
    Städler, Nicolas
    Stekhoven, Daniel J.
    Bühlmann, Peter
    Journal of Machine Learning Research, 2014, 15 : 1903 - 1928
  • [49] Design of High-Dimensional Grassmannian Frames via Block Minorization Maximization
    Jyothi, R.
    Babu, Prabhu
    Stoica, Petre
    IEEE COMMUNICATIONS LETTERS, 2021, 25 (11) : 3624 - 3628
  • [50] Efficient Symbolic Representation of Convex Polyhedra in High-Dimensional Spaces
    Boigelot, Bernard
    Mainz, Isabelle
    AUTOMATED TECHNOLOGY FOR VERIFICATION AND ANALYSIS (ATVA 2018), 2018, 11138 : 284 - 299