Area under the ROC curve estimation based on ranked set sampling via genetic algorithm

In this study, the problem of estimating the area under the receiver operating characteristic (ROC) curve, a widely used accuracy index in the context of medical diagnosis, is addressed under non-normality. Instead of using transformation methods such as Box-Cox, the original data is used when test scores are assumed to follow generalized logistic (GL) distribution which can effectively handle positively skewed, negatively skewed and symmetric data. In selecting the sampling units, ranked set sampling (RSS) method is used as an alternative to the conventional simple random sampling (SRS) method due to its known advantage in improving the efficiency of an estimator. In estimation phase, genetic algorithm (GA) based maximum likelihood (ML) is utilized since the likelihood equations involve nonlinear functions of distribution parameters. Unlike the classical GA, here we use a data driven search space as an efficient alternative to the fixed search space. The performances of the proposed AUC estimators are assessed in term of bias, efficiency and robustness criteria via an extensive Monte Carlo simulation study. The performances of RSS based AUC estimators are also evaluated under imperfect ranking conditions. Finally, the proposed methodology is applied to a diabetes data set to demonstrate the practical implementation of it.

Authors

Institutions

Publication Details

Journal
Journal of King Saud University - Science
Published
2026-03-13
DOI
https://doi.org/10.25259/jksus_1138_2025
Primary Topic
Imbalanced Data Classification Techniques
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Area under the ROC curve estimation based on ranked set sampling via genetic algorithm

Adil Kılıç, Gamze Güven, Birdal Şenoğlu, Özge Gürer
Journal of King Saud University - Science
Imbalanced Data Classification Techniques
article

Area under the ROC curve estimation based on ranked set sampling via genetic algorithm

Adil Kılıç, Gamze Güven, Birdal Şenoğlu, Özge Gürer
article en

Abstract

In this study, the problem of estimating the area under the receiver operating characteristic (ROC) curve, a widely used accuracy index in the context of medical diagnosis, is addressed under non-normality. Instead of using transformation methods such as Box-Cox, the original data is used when test scores are assumed to follow generalized logistic (GL) distribution which can effectively handle positively skewed, negatively skewed and symmetric data. In selecting the sampling units, ranked set sampling (RSS) method is used as an alternative to the conventional simple random sampling (SRS) method due to its known advantage in improving the efficiency of an estimator. In estimation phase, genetic algorithm (GA) based maximum likelihood (ML) is utilized since the likelihood equations involve nonlinear functions of distribution parameters. Unlike the classical GA, here we use a data driven search space as an efficient alternative to the fixed search space. The performances of the proposed AUC estimators are assessed in term of bias, efficiency and robustness criteria via an extensive Monte Carlo simulation study. The performances of RSS based AUC estimators are also evaluated under imperfect ranking conditions. Finally, the proposed methodology is applied to a diabetes data set to demonstrate the practical implementation of it.

Journal of King Saud University - ScienceVol. 0
Ankara University (TR), Usak University (TR), Eskişehir Osmangazi University (TR)
Openalex Percentile: Top 28%
Imbalanced Data Classification Techniques
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.