A multi-level knee point based multi-objective evolutionary algorithm for AUC maximization

Memetic Computing(2019)

引用 8|浏览11
暂无评分
摘要
The a rea u nder receiver operating characteristic c urve (AUC) is one of the widely used metrics for measuring imbalanced data classification results. Designing multi-objective evolutionary algorithms for AUC maximization problem has attracted much attention of researchers recently. However, most of these methods either search the Pareto front directly, or perform tailored convex hull search for AUC maximization. None of them take the advantage of multi-level knee points found in the process of evolution for AUC maximization. To this end, this paper proposes a multi-level knee point based multi-objective evolutionary algorithm (named MKnEA-AUC) for AUC maximization on the basis of a recently developed knee point driven evolutionary algorithm for multi/many-objective optimization. In MKnEA-AUC, an adaptive clustering strategy is proposed for automatically determining the knee points on the current population. By utilizing the preference of found knee points, the evolution of the population can converge quickly. We verify the effectiveness of the proposed algorithm MKnEA-AUC on 13 widely used benchmark data sets and the experimental results demonstrate that MKnEA-AUC is superior over the state-of-the-art algorithms for AUC maximization.
更多
查看译文
关键词
AUC maximization,Multi-objective evolutionary algorithm,Knee points,Adaptive clustering strategy
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要