Lung Cancer Classification with High Accuracy based on Enhanced K- Nearest Neighbor Algorithm

Lung diseases have newly increased, with lung cancer being the most serious, as a result of the widespread use of electronic cigarettes and the high demand for them among youth. Misdiagnosis of this disease has resulted in a high death rate around the world, which further complicates matters. So the researchers have tended to concentrate on and study this illness. After extracting the crucial characteristics for this cancer's classification, several studies implemented multiple artificial intelligence algorithms with different techniques, nonetheless, the primary difference between those studies persisted in the classification accuracy. In this paper, after selecting the methods of pre-processing the data and extracting the critical features in addition to evaluating the strength of the associations between the data variables by applying the correlation coefficient method. The K-Nearest Neighbor (KNN) algorithm was implemented and tested after being enhanced by using the Random Forest (RF) algorithm to classify lung cancer diseases. The experimental results after collecting lung cancer data set from UCI's machine learning repository for diagnosing three types of cancers showed obtaining a competitive classification accuracy of higher than 97.4%. This competitive accuracy motivates us and other researchers to use the proposed system to diagnose other types of diseases.

Authors

Publication Details

Journal
Baghdad Science Journal
Published
2025-10-28
DOI
https://doi.org/10.21123/2411-7986.5098
Primary Topic
Lung Cancer Diagnosis and Treatment
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Lung Cancer Classification with High Accuracy based on Enhanced K- Nearest Neighbor Algorithm

Ali Azawii Abdul Lateef, Ahmed Subhi Abdalkafor
Baghdad Science Journal
Lung Cancer Diagnosis and Treatment
article

Lung Cancer Classification with High Accuracy based on Enhanced K- Nearest Neighbor Algorithm

Ali Azawii Abdul Lateef, Ahmed Subhi Abdalkafor
article en

Abstract

Lung diseases have newly increased, with lung cancer being the most serious, as a result of the widespread use of electronic cigarettes and the high demand for them among youth. Misdiagnosis of this disease has resulted in a high death rate around the world, which further complicates matters. So the researchers have tended to concentrate on and study this illness. After extracting the crucial characteristics for this cancer's classification, several studies implemented multiple artificial intelligence algorithms with different techniques, nonetheless, the primary difference between those studies persisted in the classification accuracy. In this paper, after selecting the methods of pre-processing the data and extracting the critical features in addition to evaluating the strength of the associations between the data variables by applying the correlation coefficient method. The K-Nearest Neighbor (KNN) algorithm was implemented and tested after being enhanced by using the Random Forest (RF) algorithm to classify lung cancer diseases. The experimental results after collecting lung cancer data set from UCI's machine learning repository for diagnosing three types of cancers showed obtaining a competitive classification accuracy of higher than 97.4%. This competitive accuracy motivates us and other researchers to use the proposed system to diagnose other types of diseases.

Baghdad Science JournalVol. 22(10)
Openalex Percentile: Top 55%
Lung Cancer Diagnosis and Treatment
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.