Maximizing receiver operating characteristics convex hull via dynamic reference point-based multi-objective evolutionary algorithm

被引:10
作者
Cheng, Fan [1 ]
Zhang, Qiangqiang [1 ]
Tian, Ye [2 ]
Zhang, Xingyi [1 ,3 ]
机构
[1] Anhui Univ, Key Lab Intelligent Comp Signal Proc, Minist Educ, Sch Comp Sci & Technol, Hefei 230601, Anhui, Peoples R China
[2] Anhui Univ, Inst Phys Sci & Informat Technol, Hefei 230601, Anhui, Peoples R China
[3] Northeastern Univ, State Key Lab Synthet Automat Proc Ind, Shenyang 110819, Liaoning, Peoples R China
基金
中国国家自然科学基金;
关键词
Receiver operating characteristic; Evolutionary optimization; Reference point; ROC CURVE; OPTIMIZATION; CLASSIFIERS; AREA; TESTS;
D O I
10.1016/j.asoc.2019.105896
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
The receiver operating characteristic convex hull (ROCCH) is a popular technique for analyzing the performance of classifiers, which is particularly effective for the tasks with unbalanced data distribution. Although maximization of ROCCH can be tackled as a bi-objective optimization problem, existing multi-objective evolutionary algorithms (MOEAs) encounter difficulties in obtaining an ROCCH, since ROCCH is always convex but the Pareto front obtained by MOEAs may be concave. To address the issue, in this paper, a dynamic reference point-based MOEA, namely DR-MOEA is proposed for maximizing ROCCH performance. Specifically, in DR-MOEA, a reference point-based sorting is suggested, where the solutions are sorted by their distances to the reference points instead of Pareto dominance. Hence an ROCCH rather than a Pareto front is expected to be obtained. In addition, a reference point adaptation strategy is also designed, with which the reference points are dynamically adjusted during the evolutionary process, and the performance of DR-MOEA is further enhanced. Empirical studies are conducted by comparing the proposed algorithm with several state-of-the-arts on different data sets. Experimental results demonstrate the superiority of DR-MOEA over the comparison methods in solving the ROCCH maximization problem. (C) 2019 Elsevier B.V. All rights reserved.
引用
收藏
页数:11
相关论文
共 42 条
[1]  
[Anonymous], 2017, UCI Machine Learning Repository
[2]  
[Anonymous], P 2002 INT C MACH LE
[3]  
[Anonymous], IEEE T CYBERN
[4]  
[Anonymous], 2011, Acm T. Intel. Syst. Tec., DOI DOI 10.1145/1961189.1961199
[5]  
[Anonymous], P 2005 INT C MACH LE
[6]  
Barreno M., 2007, Adv. Neural Inf. Process. Syst., V20, P57, DOI DOI 10.1002/PMJ
[7]   Evolving Diverse Ensembles Using Genetic Programming for Classification With Unbalanced Data [J].
Bhowan, Urvesh ;
Johnston, Mark ;
Zhang, Mengjie ;
Yao, Xin .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2013, 17 (03) :368-386
[8]   The use of the area under the roc curve in the evaluation of machine learning algorithms [J].
Bradley, AP .
PATTERN RECOGNITION, 1997, 30 (07) :1145-1159
[9]   A new multi-objective evolutionary algorithm based on convex hull for binary classifier optimization [J].
Cococcioni, Marco ;
Ducange, Pietro ;
Lazzerini, Beatrice ;
Marcelloni, Francesco .
2007 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION, VOLS 1-10, PROCEEDINGS, 2007, :3150-3156
[10]   Evolutionary multi-objective optimization: A historical view of the field [J].
Coello Coello, Carlos A. .
IEEE COMPUTATIONAL INTELLIGENCE MAGAZINE, 2006, 1 (01) :28-36