Back

Bagged Fuzzy-Rough Nearest Neighbors (BFRNN): A Novel Ensemble Learning Algorithm for Disease Diagnosis and Prognosis Prediction

Cheruvu, A. S.

2023-10-22 health informatics
10.1101/2023.10.21.23297353 medRxiv
Show abstract

Purpose of the study is to develop a novel machine learning (ML) algorithm that can accurately predict malignant versus benign tumors. A novel ML hybrid ensemble model called "Bagged Fuzzy-Rough k-Nearest Neighbors" (BFRNN) was developed. BFRNN is an improvement over the widely used k-Nearest Neighbors algorithm due to its use of fuzzy-rough logic and an unique ensemble voting algorithm. Initially, graphical libraries were used to visualize the Wisconsin Breast Cancer biomarker dataset (WBCBD) to capture useful insights about the data. Following preprocessing of the data (e.g. encoding categorical data snd removing outliers), a small subset of the most important breast cancer biomarkers were chosen based on feature selection technique and applying breast cancer domain knowledge. The performance of BFRNN was compared with a sample of five commonly used ML classification algorithms. The criteria for the evaluation the performance of ML was based on accuracy, area under the Receiver Operating Characteristic curve, and the ability to overcome overfitting. Discussion: Among the algorithms evaluated, BFRNN was the best classifier of WBCBD achieving an average training score of 98.47% and an average testing score of 99.09%. Among the other common ML algorithms evaluated, the highest test accuracy observed was 95.1% for Random Forest, with significant overfitting. In addition, outlier removal from the dataset and Pearsons Correlation evaluation steps can be avoided for the implementation of the BFRNN algorithm. BFRNN has shown high accuracy in classifying the malignant versus benign characteristics and this algorithm could be a useful tool in disease diagnosis.

Matching journals

The top 7 journals account for 50% of the predicted probability mass.

50% of probability mass above

"Similar papers" are the closest papers from that journal in the model's embedding space. They show what the match is built on, but the ranking comes mostly from a classifier over the whole training set, not from these examples alone.