.png){kind=icon}
返回
A multi-level knee point based multi-objective evolutionary algorithm for AUC maximization
.png){kind=icon}
PRE
AI
DOI：10.1007/s12293-019-00280-7.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The area under receiver operating characteristic curve (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.
Keyword:
AUC maximization
Multi-objective evolutionary algorithm
Knee points
Adaptive clustering strategy
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。