Multi-objective evolutionary algorithm for optimizing the partial area under the ROC curve

被引:13
作者
Cheng, Fan [1 ,2 ]
Fu, Guanglong [1 ]
Zhang, Xingyi [1 ,2 ]
Qiu, Jianfeng [1 ,2 ]
机构
[1] Anhui Univ, Sch Comp Sci & Technol, Hefei 230601, Anhui, Peoples R China
[2] Anhui Univ, Key Lab Intelligent Comp & Signal Proc, Minist Educ, Hefei 230039, Anhui, Peoples R China
基金
中国国家自然科学基金;
关键词
Partial AUC; Multi-objective optimization; Classification; Preference information; PARTIAL AUC MAXIMIZATION; OPTIMIZATION; BIOMARKERS;
D O I
10.1016/j.knosys.2019.01.029
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
The measure called partial area under the curve (pAUC) has attracted increasing interest in recent years due to the wide range of real-world applications it can be used for, such as biomarker selection and pedestrian detection. Compared with AUC, pAUC only acts upon a partial (instead of a full) area under the ROC curve. In this paper, a multi-objective evolutionary algorithm termed MOPA is proposed to optimize the pAUC in an arbitrary false positive range. Within this range, two important components are proposed to focus on a particular region within the AUC. First, a new metric (K-FPR), is proposed that is created by considering the partial range of the false positive rate (FPR), This is combined with the true positive rate (TPR) to provide the two optimized objectives of MOPA. Second, a preference-based multi-objective evolutionary algorithm is developed within the framework of a recently proposed algorithm (AR-MOEA), by which the search is concentrated on a partial area under the ROC curve. Numerical experiments on different data sets demonstrate the competitiveness of the proposed method in comparison with stateof-the-art algorithms. (C) 2019 Elsevier By. All rights reserved.
引用
收藏
页码:61 / 69
页数:9
相关论文
共 38 条
[1]  
[Anonymous], 2009, Proc. VLDB Endow.
[2]  
Back Thomas., 2000, Evolutionary computation 1: Basic algorithms and operators, V1
[3]   SMOTE: Synthetic minority over-sampling technique [J].
Chawla, Nitesh V. ;
Bowyer, Kevin W. ;
Hall, Lawrence O. ;
Kegelmeyer, W. Philip .
2002, American Association for Artificial Intelligence (16)
[4]  
Cheng F., 2016, J COMPUT THEOR NANOS, V13, P928
[5]   SUPPORT-VECTOR NETWORKS [J].
CORTES, C ;
VAPNIK, V .
MACHINE LEARNING, 1995, 20 (03) :273-297
[6]   A fast and elitist multiobjective genetic algorithm: NSGA-II [J].
Deb, K ;
Pratap, A ;
Agarwal, S ;
Meyarivan, T .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2002, 6 (02) :182-197
[7]   Pedestrian Detection: An Evaluation of the State of the Art [J].
Dollar, Piotr ;
Wojek, Christian ;
Schiele, Bernt ;
Perona, Pietro .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2012, 34 (04) :743-761
[8]   Convex hull-based multi-objective evolutionary computation for maximizing receiver operating characteristics performance [J].
Hong, Wenjing ;
Tang, Ke .
MEMETIC COMPUTING, 2016, 8 (01) :35-44
[9]   Biomarker selection for medical diagnosis using the partial area under the ROC curve [J].
Hsu M.-J. ;
Chang Y.-C.I. ;
Hsueh H.-M. .
BMC Research Notes, 7 (1)
[10]   The linear combinations of biomarkers which maximize the partial area under the ROC curves [J].
Hsu, Man-Jen ;
Hsueh, Huey-Miin .
COMPUTATIONAL STATISTICS, 2013, 28 (02) :647-666