<?xml version="1.0" encoding="UTF-8"?>
<article xmlns:xlink="http://www.w3.org/1999/xlink">
<front><article-meta>
<title-group><article-title>A Machine Learning Models for Early Stroke Prediction</article-title></title-group>
<contrib-group>
<contrib contrib-type="author"><name><surname>Shiravand</surname><given-names>Sahel</given-names></name><xref ref-type="aff" rid="aff1"/></contrib>
<contrib contrib-type="author"><name><surname>Fathi</surname><given-names>Abdolreza</given-names></name><xref ref-type="aff" rid="aff1"/></contrib>
<aff id="aff1">Department of Computer Engineering, Razi University, Kermanshah, Iran.</aff>
</contrib-group>
<abstract><p>Stroke is a leading cause of mortality and long-term disability, and early prediction using machine learning models can support clinical decision-making. In this study, a hybrid, stable, and interpretable feature selection framework is employed together with the LightGBM algorithm for stroke prediction. First, SHAP values derived from an XGBoost model are used to quantify the importance of each feature. Then, the absolute correlation of each feature with the target variable stroke and its stability across cross-validation folds (i.e., the number of times it appears among the top 10 features) are considered as complementary criteria. These three measures are combined into a weighted composite score, and the top 10 features are selected for model training. The results show that, although some previous studies report higher overall accuracy, the proposed model achieves a Recall of 100% in identifying stroke patients, along with a Precision of 97.12% and an appropriate F1-score, providing a favorable balance between reducing missed cases and limiting false alarms.</p></abstract>
<kwd-group kwd-group-type="author"><kwd>Stroke prediction</kwd><kwd>Machine learning</kwd><kwd>Feature selection</kwd><kwd>LightGBM</kwd><kwd>SHAP</kwd></kwd-group>
</article-meta></front>
<body>
<sec id="sec-1"><label>1</label><title>Introduction</title>
<sec id="sec-2"><label>1.1</label><title>Clinical and Societal Impact of Stroke</title>
<p>Stroke is a neurological condition caused by a disruption of blood supply to the brain, leading to rapid cell death and potential long-term disability. The Global Burden of Disease study reports over 7.25 million stroke-related deaths in 2021, with ischemic stroke contributing the largest share. Stroke affects 12 million people annually, and the lifetime risk is one in four individuals over the age of 25. This condition also incurs substantial economic costs, estimated at over US $890 billion, representing 0.66% of the global GDP <xref ref-type="bibr" rid="ref-1">[1]</xref>, <xref ref-type="bibr" rid="ref-2">[2]</xref>.</p>
<p>A brain clot or ruptured blood artery in the brain interrupts blood flow to a portion of the brain, resulting in a stroke, also known as a brain attack. Certain brain regions suffer harm or even die in both situations <xref ref-type="bibr" rid="ref-2">[2]</xref>.</p>
</sec>
<sec id="sec-3"><label>1.2</label><title>Machine Learning, Data Challenges, and the Role of Feature Selection</title>
<p>Machine learning algorithms have shown promise in revolutionizing stroke prediction by analyzing extensive datasets encompassing demographic information, medical histories, and physiological markers like age, blood pressure, and glucose levels <xref ref-type="bibr" rid="ref-3">[3]</xref>, <xref ref-type="bibr" rid="ref-4">[4]</xref>.</p>
<p>These models can capture complex, non-linear relationships that traditional statistical approaches may miss. However, stroke datasets are typically highly imbalanced, with far fewer stroke cases than non-stroke cases, making classical metrics such as overall accuracy insufficient to evaluate model performance <xref ref-type="bibr" rid="ref-5">[5]</xref>, <xref ref-type="bibr" rid="ref-6">[6]</xref>. In addition, the presence of many potentially redundant or correlated variables introduces the risk of overfitting and reduces model interpretability. Under these conditions, robust feature selection becomes crucial: it can improve predictive performance, enhance generalization, and highlight the most influential factors contributing to stroke, which is important for clinical acceptance. At the same time, evaluation must emphasize sensitivity-oriented metrics, such as Recall, to ensure that true stroke cases are not overlooked <xref ref-type="bibr" rid="ref-7">[7]</xref>, <xref ref-type="bibr" rid="ref-8">[8]</xref>.</p>
</sec>
<sec id="sec-4"><label>1.3</label><title>Motivation, Research Gap, and Contribution of This Study</title>
<p>Despite the growing use of machine learning in stroke prediction, important gaps remain. Many existing studies rely on a single feature selection method or focus primarily on model accuracy without thoroughly analyzing feature importance or the stability of selected features across different validation folds. Moreover, the trade-off between Recall and Precision, which is crucial in high-risk medical applications, is often not explicitly addressed.</p>
<p>To address these limitations, this study proposes a hybrid, stable, and interpretable feature selection framework tailored to stroke prediction. First, an XGBoost model is employed to compute SHAP values and quantify the contribution of each feature. These values are combined with the absolute correlation of each feature with the target variable stroke and with a stability indicator that counts how frequently each feature appears among the top predictors across cross-validation folds. A weighted composite score is then defined to select the top 10 features. Based on this compact and informative feature set, a LightGBM classifier is trained and evaluated. The results demonstrate that the proposed framework achieves 100% Recall in identifying stroke patients while maintaining high Precision (97.12%) and a suitable F1-score, providing a favorable balance between minimizing missed stroke cases and controlling false alarms.</p>
</sec>
</sec>
<sec id="sec-5"><label>2</label><title>Data Preprocessing</title>
<sec id="sec-6"><label>2.1</label><title>Dataset Preparation and Initial Cleaning</title>
<p>The experiments were conducted on the Healthcare Stroke Dataset. After loading the dataset, the following preprocessing steps were applied:</p>
<p>I. The identifier column id was removed because it does not carry any analytical or predictive information. II. Records with gender = &apos;Other&apos; were removed to ensure a homogeneous definition of the gender variable. After preprocessing, the final dataset included:</p>
<p>n = 5110</p>
<p>samples.</p>
</sec>
<sec id="sec-7"><label>2.2</label><title>Missing Value Imputation for BMI</title>
<p>The BMI attribute contained missing values. Instead of discarding these records, BMI was imputed using the median BMI within subgroups defined by gender and work_type.</p>
<p>Let BMIi denote the BMI value of record i, which belongs to a subgroup with gender and work type w. Define:</p>
<p>I. The index set of records in the same subgroup with observed BMI:</p>
<p>Sg,w={j∣genderj=g, work_typej=w, BMIj is observed}.</p>
<p>II. The group-wise median BMI for this subgroup in Eq. (1):</p>
<p>BMI ̃ g,w = median⁡({BMIj ∣ j ∈ Sg,w}). (1)</p>
<p>Then missing BMI values are imputed according to:</p>
<p>BMIi={BMIi if BMI is observed,\[4pt]BMI~g,w,if BMI is missing.</p>
<p>This conditional median imputation leverages demographic and occupational structure to provide robust estimates for BMI while preserving all records.</p>
</sec>
<sec id="sec-8"><label>2.3</label><title>Categorical Variable Encoding</title>
<p>Several predictors in the dataset are categorical and cannot be directly used by tree-based or gradient-boosting models in raw form. Therefore, the following categorical variables were transformed using One-Hot Encoding:</p>
<p> gender  ever_married  work_type  Residence_type  smoking_status</p>
<p>For a generic categorical variable X with categories {c1, c2, … , cK}, One-Hot Encoding creates K binary variables X1, … , XK such that in Eq. (2):</p>
<p>1, if⁡X = ck,</p>
<p>Xk = { k = 1, … , K. (2)</p>
<p>0, otherwise,</p>
<p>This transformation yields a purely numerical feature space suitable for the subsequent modeling and feature selection steps.</p>
</sec>
<sec id="sec-9"><label>2.4</label><title>Handling Class Imbalance</title>
<p>The target variable stroke is highly imbalanced, with the stroke class (positive cases) being much smaller than the non-stroke class (negative cases). To mitigate this issue and avoid bias toward the majority class, an oversampling strategy was applied to increase the number of minority-class samples.</p>
<p>Let Nmajor and Nminor denote the number of samples in the majority and minority classes, respectively. Oversampling was used to obtain a new minority class size Nminor (new) such that in Eq. (3):</p>
<p>Nminor (new) ≈ Nmajor. (3)</p>
<p>The focus of this step is to improve the model’s ability to correctly identify stroke cases by providing a more balanced training distribution.</p>
</sec>
<sec id="sec-10"><label>2.5</label><title>Cross-Validation Strategy</title>
<p>Model evaluation and feature scoring were performed using Stratified 5-Fold Cross Validation. The full dataset D was split into five approximately equal folds in Eq (4):</p>
<p>D = D1 ∪ D2 ∪ ⋯ ∪ D5, (4)</p>
<p>such that the class distribution in each fold Dk is similar to the overall distribution (stratification). For the k-th fold (k = 1, … ,5) in Eq. (5):</p>
<p>D( train k) = D ∖ Dk, D( test k) = Dk. (5)</p>
<p>For each fold, a model (here, XGBoost for feature scoring) was trained on D( train k) and evaluated on D( test k). The stratified design ensures that performance estimates and feature scores are robust across different subsets of the data, especially under class imbalance.</p>
</sec>
<sec id="sec-11"><label>2.6</label><title>Feature Selection Framework</title>
<p>A hybrid feature selection framework was used to identify the most informative predictors for stroke. The final feature score for each variable combines three complementary criteria:</p>
<p>I. SHAP-based importance (from XGBoost).</p>
<p>II. Absolute correlation with the target stroke.</p>
<p>III. Stability of the feature across CV folds.</p>
<p>The goal is to select the top 10 features that are simultaneously important, predictive, and stable.</p>
<sec id="sec-12"><label>2.6.1</label><title>SHAP-based importance</title>
<p>For each fold k, an XGBoost model was trained on the corresponding training set D( train k) . Using SHAP TreeExplainer, SHAP values were computed for all features <xref ref-type="bibr" rid="ref-9">[9]</xref>, <xref ref-type="bibr" rid="ref-10">[10]</xref>.</p>
<p>Let ϕ( i,k f) denote the SHAP value of feature f for sample i in fold k. The fold-wise SHAP importance of feature f in fold k is defined as the mean absolute SHAP value in Eq. (6):</p>
<p>(k) 1 (k)</p>
<p>SHAP_impf = nk ∑ ∣ ϕi,f ∣, (6)</p>
<p>i∈Dtrain</p>
<p>where nk =∣ D( train k) ∣.</p>
<p>The overall SHAP score for feature f is then obtained by averaging over all 5 folds in Eq. (7):</p>
<p>1 (k)</p>
<p>SHAP_Scoref = ∑ SHAP_impf . (7)</p>
<p>This score reflects how strongly feature f contributes, on average, to the model’s predictions across different training splits.</p>
<sec id="sec-13"><title>Correlation with the target</title>
<p>For each fold k, the Pearson correlation coefficient between each feature f and the binary target stroke was computed. Let Xf (k) be the vector of values of feature f and Y(k) be the corresponding target vector in fold k. The Pearson correlation is <xref ref-type="bibr" rid="ref-7">[7]</xref> in Eq. (8):</p>
<p>rf(k) = corr⁡(Xf (k), Y(k)). (8)</p>
<p>To obtain a fold-invariant correlation measure, the absolute correlation coefficients were averaged over the 5 folds in Eq. (9):</p>
<p>1 (k)</p>
<p>Corr_Scoref = ∑ ∣ rf ∣. (9)</p>
<p>This score captures the linear association between each feature and the stroke outcome, aggregated across cross-validation splits.</p>
<p>To better understand the relationships among numeric variables and to assess potential multicollinearity, we computed the Pearson correlation matrix for age, hypertension, heart disease, average glucose level, BMI, and the stroke label.</p>
<p>As shown in <xref ref-type="fig" rid="fig1">Fig. 1</xref>, none of the pairwise correlations exceeds 0.4, indicating that strong linear dependencies are absent in this subset of features. BMI shows the highest correlation with age, while all predictors exhibit only mild correlations with the stroke outcome. This pattern suggests that stroke risk is driven by the joint interaction of several factors rather than by a single dominant variable.</p>
<fig id="fig1"><label>Figure 1</label><caption><p>Pearson correlation matrix for numeric features (age, hypertension, heart disease, average glucose level, BMI, and stroke).</p></caption><graphic content-type="pdf-region" xlink:href="pdf-region:4:66,272.9,537.1,441.4"/><p content-type="note">This figure is shown in the PDF version of the article.</p></fig>
</sec>
<sec id="sec-14"><title>Stability across folds</title>
<p>To quantify the stability of a feature, SHAP-based rankings were used within each fold. For every fold k:</p>
<p>I. Features were sorted in descending order of SHAP_impf (k).</p>
<p>II. The top 10 features in that fold were selected.</p>
<p>Let {⋅} denote the indicator function. The stability count of feature f is defined as the number of folds in which f appears among the top 10 features in Eq. (10):</p>
<p>Stability_countf = ∑ (f ∈ Top10(k)), (10) where Top⁡10(k) is the set of ten most important features (by SHAP) in fold k:</p>
<p>This count can be normalized to obtain a stability score in [0, 1] in Eq. (11):</p>
<p>Stability_countf</p>
<p>Stability_Scoref = . (11)</p>
<p>A feature with Stability_Scoref = 0.8 (i.e., appearing in 4 out of 5 folds) is considered highly stable.</p>
</sec>
<sec id="sec-15"><title>Combined feature score and optuna-based weight optimization</title>
<p>The three criteria above were combined into a single Final Feature Score using a weighted linear combination. For each feature f:</p>
<p>FinalScoref=α⋅SHAP_Scoref+β⋅Corr_Scoref+γ⋅Stability_Scoref,</p>
<p>where α, β, γ ≥ 0⁡are the weights assigned to SHAP importance, correlation with the target, and stability across folds, respectively.</p>
<p>The weights α, β, γ were automatically tuned using the hyperparameter optimization framework Optuna. In each Optuna trial:</p>
<p>I. Candidate values for α, β, γ were sampled in the interval [0, 1].</p>
<p>II. The three weights were then normalized to ensure in Eq. (12):</p>
<p>α + β + γ = 1. (12)</p>
<p>Using these weights, FinalScoref was computed for all features, and the top 10 features with the highest FinalScore were selected.</p>
<p>After computing the final hybrid feature score for each variable, the features were ranked in descending order.</p>
<p><xref ref-type="fig" rid="fig2">Fig. 2</xref> illustrates the top 10 features selected by the proposed automated scoring scheme. Age, average glucose level, hypertension, and heart disease appear as the most influential predictors, followed by BMI and several socio-demographic and lifestyle factors such as urban residence, marital status, gender, and smoking status.</p>
<p>This ranking confirms that the hybrid score is able to prioritize clinically meaningful variables while still capturing complementary information from demographic and behavioral features.</p>
<fig id="fig2"><label>Figure 2</label><caption><p>Top 10 features ranked by the proposed automated feature score. Age, average glucose level, hypertension, and heart disease are the most influential predictors for stroke risk, followed by BMI and selected socio-demographic and lifestyle variables.</p></caption><graphic content-type="pdf-region" xlink:href="pdf-region:5:66,116.8,537.1,269.6"/><p content-type="note">This figure is shown in the PDF version of the article.</p></fig>
<p>An XGBoost model was then trained using only these selected features and evaluated via Stratified 5-Fold Cross Validation.</p>
<p>The objective of the Optuna optimization was to maximize the mean AUC across the 5 folds. The combination of weights (α\*, β\*, γ\*) that yielded the highest cross-validated AUC was chosen as the optimal setting for the feature selection framework.</p>
</sec>
<sec id="sec-16"><title>Hyperparameter and weight optimization</title>
<p>In addition to tuning the hyperparameters of the gradient boosting models, Optuna was used to optimize the weights of the hybrid feature score (α, β, γ) assigned to SHAP importance, correlation strength, and stability, respectively.</p>
<p><xref ref-type="fig" rid="fig3">Fig. 3</xref> shows the evolution of the normalized values of α, β, and γ across 50 optimization trials. The search does not converge to a trivial solution where one component dominates; instead, the final configuration balances all three criteria, with slightly higher emphasis on SHAP-based importance and stability. This behavior supports the idea that combining complementary signals leads to a more robust feature ranking than relying on a single criterion.</p>
<fig id="fig3"><label>Figure 3</label><caption><p>Evolution of the normalized weights , , and across Optuna trials.</p></caption><graphic content-type="pdf-region" xlink:href="pdf-region:6:66,419.5,537.1,543.8"/><p content-type="note">This figure is shown in the PDF version of the article.</p></fig>
</sec>
</sec>
</sec>
</sec>
<sec id="sec-17"><label>3</label><title>Machine Learning Models</title>
<p>In this study, five machine learning algorithms were implemented in order to evaluate their predictive capability for stroke risk prediction. Each model was trained using its optimized hyperparameters, obtained through the tuning process, to ensure that the comparison between models reflects their best achievable performance on the dataset.</p>
<p>The models used in the experiments include:</p>
<p>I. XGBoost <xref ref-type="bibr" rid="ref-11">[11]</xref> II. LightGBM <xref ref-type="bibr" rid="ref-12">[12]</xref> III. CatBoost <xref ref-type="bibr" rid="ref-13">[13]</xref> IV. Support Vector Machine (SVM) <xref ref-type="bibr" rid="ref-14">[14]</xref> V. Logistic Regression <xref ref-type="bibr" rid="ref-15">[15]</xref> The selected algorithms represent two major categories of machine learning methods. The first category consists of gradient boosting–based ensemble models, including CatBoost, LightGBM, and XGBoost. These models construct predictive functions by sequentially combining multiple weak learners, typically decision trees, allowing them to capture complex nonlinear relationships and feature interactions within structured datasets.</p>
<p>The second category includes classical machine learning algorithms, namely SVM and Logistic Regression. These models were included as baseline methods to provide a comparative perspective and to evaluate whether more advanced ensemble approaches can achieve improved predictive performance in the context of stroke prediction.</p>
</sec>
<sec id="sec-18"><label>4</label><title>Evaluation Metrics</title>
<p>The performance of the implemented models was assessed using five commonly used evaluation metrics in classification tasks:</p>
<p> Accuracy  Precision  Recall  F1-score  ROC–AUC</p>
<p>To obtain reliable performance estimates and reduce the effect of randomness in the training–testing split, the experiments were conducted using Stratified 5-Fold Cross Validation <xref ref-type="bibr" rid="ref-16">[16]</xref>. In this validation strategy, the dataset is divided into five folds while preserving the distribution of the target classes. Each fold is used once as a validation set while the remaining folds are used for training.</p>
<p>The final performance values reported in the study correspond to the average results obtained across the five folds.</p>
</sec>
<sec id="sec-19"><label>5</label><title>Model Performance Results</title>
<p>The performance results obtained from the 5-fold cross-validation experiments are presented in <xref ref-type="table" rid="tab1">Table 1</xref>. This table summarizes the average values of Accuracy, Precision, Recall, F1-score, and AUC for all evaluated models <xref ref-type="bibr" rid="ref-17">[17]</xref>.</p>
<table-wrap id="tab1"><label>Table 1</label><caption><p>Performance of machine learning models (average 5 fold cross validation).</p></caption><graphic content-type="pdf-region" xlink:href="pdf-region:7:66,274.1,537.1,368.2"/><p content-type="note">This table is shown in the PDF version of the article.</p></table-wrap>
<p>As illustrated in <xref ref-type="table" rid="tab1">Table 1</xref>, the three gradient boosting algorithms achieved consistently higher performance across nearly all evaluation metrics compared with the traditional classification models.</p>
<sec id="sec-20"><label>5.1</label><title>Overall Model Performance</title>
<p><xref ref-type="table" rid="tab1">Table 1</xref> reports the mean performance of the five evaluated models over stratified 5-fold cross-validation. To provide a more intuitive comparison, <xref ref-type="fig" rid="fig4">Fig. 4</xref> summarizes Accuracy, Precision, Recall, and F1-score for each algorithm.</p>
<p>As illustrated in <xref ref-type="fig" rid="fig4">Fig. 4</xref>, the three gradient boosting models (CatBoost, LightGBM, and XGBoost) clearly outperform the classical SVM and Logistic Regression baselines. LightGBM achieves the best overall balance between Precision and Recall, while all three boosting models obtain a Recall of 1.00, indicating that no stroke cases were missed during cross-validation. In contrast, SVM and Logistic Regression show noticeably lower Recall and F1-scores, confirming that they are less suitable for this highly imbalanced medical prediction task.</p>
<fig id="fig4"><label>Figure 4</label><caption><p>Comparison of model performance (Accuracy, Precision, Recall, and F1-score) for CatBoost, LightGBM, XGBoost, SVM, and Logistic Regression.</p></caption><graphic content-type="pdf-region" xlink:href="pdf-region:8:66,640.4,537.1,778.2"/><p content-type="note">This figure is shown in the PDF version of the article.</p></fig>
</sec>
</sec>
<sec id="sec-21"><label>6</label><title>Results Analysis</title>
<p>The experimental results presented in <xref ref-type="table" rid="tab1">Table 1</xref> reveal several important observations regarding the comparative performance of the evaluated machine learning models.</p>
<p>First, the boosting-based models (CatBoost, LightGBM, and XGBoost) clearly outperform the classical algorithms. These models achieved significantly higher values in terms of Accuracy, Precision, F1-score, and AUC, demonstrating their strong capability to capture complex relationships within the dataset.</p>
<p>Among all evaluated algorithms, LightGBM achieved the highest Accuracy (0.985185) and F1-score (0.985402). These results indicate that LightGBM provides the most balanced predictive performance among the tested models.</p>
<p>The CatBoost model achieved the highest AUC value (0.999646), indicating an almost perfect ability to discriminate between stroke and non-stroke instances. Such a high AUC reflects the strong discriminative capacity of the model in distinguishing between the two classes across different decision thresholds.</p>
<p>Similarly, XGBoost demonstrated competitive performance, achieving results very close to those of LightGBM and CatBoost. The consistency of high scores across all metrics confirms the effectiveness of gradient boosting algorithms for structured medical datasets.</p>
<p>Another significant observation is that the Recall value for all boosting models equals 1.000000. This indicates that all actual stroke cases in the validation folds were successfully identified by these models. In the context of medical prediction systems, this behavior is particularly desirable because it minimizes the risk of failing to detect patients who may suffer from stroke.</p>
<p>In contrast, SVM and Logistic Regression showed noticeably weaker performance. Although SVM achieved moderate results, its accuracy and AUC values remain substantially lower than those of the boosting models. Logistic Regression produced the lowest performance among all evaluated models, suggesting that linear modeling approaches may not adequately capture the complex patterns present in the dataset.</p>
</sec>
<sec id="sec-22"><label>7</label><title>Comparison with Previous Studies</title>
<p>To further evaluate the effectiveness of the proposed framework, the obtained results were compared with several recent studies in the literature. The comparison is summarized in <xref ref-type="table" rid="tab2">Table 2</xref>, which presents the methods and performance metrics reported by previous research works alongside the results achieved in this study. As shown in <xref ref-type="table" rid="tab2">Table 2</xref>, the proposed framework achieves highly competitive results compared with previously published methods. In particular, the proposed approach achieved 100% recall, indicating that all stroke cases were correctly detected in the experimental evaluation.</p>
<table-wrap id="tab2"><label>Table 2</label><caption><p>Comparison with existing studies.</p></caption><graphic content-type="pdf-region" xlink:href="pdf-region:8:66,50.2,537.1,73"/><graphic content-type="pdf-region" xlink:href="pdf-region:9:66,645.6,537.1,772.1"/><p content-type="note">This table is shown in the PDF version of the article.</p></table-wrap>
<p>Although some previous works report slightly higher accuracy values, the proposed model demonstrates a strong balance between precision, recall, and F1-score, while maintaining perfect recall for the minority class.</p>
</sec>
<sec id="sec-23"><label>8</label><title>Proposed Method and Contribution</title>
<p>The primary contribution of this research lies in the development of a complete predictive framework for stroke risk assessment, integrating several stages including data preprocessing, class balancing, feature selection, and machine learning modeling.</p>
<p>The proposed methodology introduces a hybrid feature selection strategy designed to identify the most informative and stable features. Instead of relying on a single importance measure, the proposed method computes a final feature score based on the combination of three complementary criteria:</p>
<p>I. SHAP feature importance II. Statistical correlation with the target variable III. Feature stability across cross-validation folds <xref ref-type="bibr" rid="ref-8">[8]</xref>.</p>
<p>These criteria are combined into a unified score:</p>
<p>Final⁡Feature⁡Score⁡=⁡α⁡×⁡SHAP⁡+⁡β⁡×⁡Correlation⁡+⁡γ⁡×⁡Stability.</p>
<p>The optimal weights assigned to these three components are automatically determined using the Optuna optimization framework, which searches for the combination that maximizes the cross-validated predictive performance of the models.</p>
<p>Unlike traditional feature selection techniques that rely on a single metric, this hybrid approach simultaneously considers model interpretability, statistical relevance, and robustness across validation folds. As a result, the selected feature subset provides both stable and highly informative predictors for stroke classification</p>
</sec>
<sec id="sec-24"><label>9</label><title>Conclusion</title>
<p>In this study, a comprehensive machine learning framework was developed for stroke risk prediction using structured clinical data. The proposed pipeline integrates systematic data preprocessing, class balancing, hybrid feature selection, and a comparative evaluation of multiple machine learning models.</p>
<p>The experimental results demonstrate that gradient boosting algorithms—particularly LightGBM and CatBoost—outperform classical models such as SVM and Logistic Regression. Due to the nonlinear relationships among clinical variables and the presence of class imbalance in medical datasets, gradient boosting models are better suited to capture complex feature interactions and learn predictive patterns effectively.</p>
<p>A key outcome of this research is achieving 100% Recall in identifying stroke patients. Although some previous studies have reported slightly higher overall accuracy values, the proposed model prioritizes Recall, which is critically important in medical decision‑making. High recall indicates the model’s strong ability to correctly identify actual stroke cases and significantly reduce false negatives, which is essential in healthcare applications where missing a true patient may lead to severe consequences.</p>
<p>In addition to its perfect recall, the proposed model maintains a high Precision (97.12%) and achieves a strong F1‑score, demonstrating a well-balanced trade‑off between correctly identifying stroke patients and minimizing false alarms.</p>
<p>Furthermore, the proposed hybrid feature selection framework, optimized using Optuna <xref ref-type="bibr" rid="ref-24">[24]</xref>, improves model robustness by selecting features that are not only highly informative but also stable across different cross‑validation folds. This approach enhances both the reliability and generalization capability of the predictive model.</p>
<p>Overall, the findings suggest that the proposed methodology—combining intelligent feature selection with advanced gradient boosting techniques—provides an effective and reliable approach for stroke risk prediction systems and has strong potential for supporting clinical decision‑making in healthcare environments.</p>
</sec>
</body>
<back><ref-list><title>References</title>
<ref id="ref-1"><label>1</label><mixed-citation>Feigin, V. L., Stark, B. A., Johnson, C. O., Roth, G. A., Bisignano, C., Abady, G. G., … ., &amp; Murray, C. J. L. (2021). Global, regional, and national burden of stroke and its risk factors, 1990&amp;#x2013;2019: A systematic analysis for the Global Burden of Disease Study 2019. The Lancet Neurology, 20(10), 795–820. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/S1474-4422(21)00252-0">https://doi.org/10.1016/S1474-4422(21)00252-0</ext-link></mixed-citation></ref>
<ref id="ref-2"><label>2</label><mixed-citation>World Health Organization. (2026). Stroke. <ext-link ext-link-type="uri" xlink:href="https://www.who.int/news-room/fact-sheets/detail/stroke">https://www.who.int/news-room/fact-sheets/detail/stroke</ext-link></mixed-citation></ref>
<ref id="ref-3"><label>3</label><mixed-citation>Topol, E. J. (2019). High-performance medicine: The convergence of human and artificial intelligence. Nature Medicine, 25(1), 44–56. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1038/s41591-018-0300-7">https://doi.org/10.1038/s41591-018-0300-7</ext-link></mixed-citation></ref>
<ref id="ref-4"><label>4</label><mixed-citation>Alvin, R., Jeffrey, D., &amp; Isaac, K. (2019). Machine learning in medicine. New England Journal of Medicine, 380(14), 1347–1358. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1056/NEJMra1814259">https://doi.org/10.1056/NEJMra1814259</ext-link></mixed-citation></ref>
<ref id="ref-5"><label>5</label><mixed-citation>Chawla, N. V, Bowyer, K. W., Hall, L. O., &amp; Kegelmeyer, W. P. (2002). SMOTE: Synthetic minority over-sampling technique. Journal of Artificial Intelligence Research, 16, 321–357. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1613/jair.953">https://doi.org/10.1613/jair.953</ext-link></mixed-citation></ref>
<ref id="ref-6"><label>6</label><mixed-citation>Zhang, Z., Wen, J., Sun, L., Deng, Q., Su, S., &amp; Yao, P. (2017). Efficient incremental dynamic link prediction algorithms in social network. Knowledge-Based Systems, 132, 226–235. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/j.knosys.2017.06.035">https://doi.org/10.1016/j.knosys.2017.06.035</ext-link></mixed-citation></ref>
<ref id="ref-7"><label>7</label><mixed-citation>Wang, X., Shangguan, H., Huang, F., Wu, S., &amp; Jia, W. (2024). MEL: Efficient multi-task evolutionary learning for high-dimensional feature selection. IEEE Transactions on Knowledge and Data Engineering, 36(8), 4020–4033. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1109/TKDE.2024.3366333">https://doi.org/10.1109/TKDE.2024.3366333</ext-link></mixed-citation></ref>
<ref id="ref-8"><label>8</label><mixed-citation>Zhong, F., Chen, Z., &amp; Min, G. (2018). Deep discrete cross-modal hashing for cross-media retrieval. Pattern Recognition, 83, 64–77. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/j.patcog.2018.05.018">https://doi.org/10.1016/j.patcog.2018.05.018</ext-link></mixed-citation></ref>
<ref id="ref-9"><label>9</label><mixed-citation>Lundberg, S. M., &amp; Lee, S. I. (2017). A unified approach to interpreting model predictions. Advances in Neural Information Processing Systems (Vol. 30). Curran Associates, Inc. <ext-link ext-link-type="uri" xlink:href="https://proceedings.neurips.cc/paper_files/paper/2017/file/8a20a8621978632d76c43dfd28b67767-Paper.pdf">https://proceedings.neurips.cc/paper_files/paper/2017/file/8a20a8621978632d76c43dfd28b67767-Paper.pdf</ext-link></mixed-citation></ref>
<ref id="ref-10"><label>10</label><mixed-citation>Lundberg, S. M., Erion, G., Chen, H., DeGrave, A., Prutkin, J. M., Nair, B., … ., &amp; Lee, S. I. (2020). From local explanations to global understanding with explainable AI for trees. Nature Machine Intelligence, 2(1), 56–67. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1038/s42256-019-0138-9">https://doi.org/10.1038/s42256-019-0138-9</ext-link></mixed-citation></ref>
<ref id="ref-11"><label>11</label><mixed-citation>Nalluri, M., Pentela, M., &amp; Eluri, N. R. (2020). A scalable tree boosting system: XG boost. Int. j. res. stud. sci. eng. technol, 7(12), 36–51.</mixed-citation></ref>
<ref id="ref-12"><label>12</label><mixed-citation>Ke, G., Meng, Q., Finley, T., Wang, T., Chen, W., Ma, W., … ., &amp; Liu, T. Y. (2017). LightGBM: A highly efficient gradient boosting decision tree. Advances in Neural Information Processing Systems (pp. 3146–3154). Curran Associates, Inc. <ext-link ext-link-type="uri" xlink:href="https://proceedings.neurips.cc/paper_files/paper/2017/file/6449f44a102fde848669bdd9eb6b76fa-Paper.pdf">https://proceedings.neurips.cc/paper_files/paper/2017/file/6449f44a102fde848669bdd9eb6b76fa-Paper.pdf</ext-link></mixed-citation></ref>
<ref id="ref-13"><label>13</label><mixed-citation>Prokhorenkova, L., Gusev, G., Vorobev, A., Dorogush, A. V., &amp; Gulin, A. (2018). CatBoost: Unbiased boosting with categorical features. Advances in Neural Information Processing Systems (pp. 6638–6648). Curran Associates, Inc. <ext-link ext-link-type="uri" xlink:href="https://proceedings.neurips.cc/paper_files/paper/2018/file/14491b756b3a51daac41c24863285549-Paper.pdf">https://proceedings.neurips.cc/paper_files/paper/2018/file/14491b756b3a51daac41c24863285549-Paper.pdf</ext-link></mixed-citation></ref>
<ref id="ref-14"><label>14</label><mixed-citation>Cortes, C., &amp; Vapnik, V. (1995). Support-vector networks. Machine Learning, 20(3), 273–297. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1007/BF00994018">https://doi.org/10.1007/BF00994018</ext-link></mixed-citation></ref>
<ref id="ref-15"><label>15</label><mixed-citation>Hosmer, D. W., Lemeshow, S., &amp; Sturdivant, R. X. (2013). Applied logistic regression. Wiley. <ext-link ext-link-type="uri" xlink:href="https://books.google.com/books?id=bRoxQBIZRd4C">https://books.google.com/books?id=bRoxQBIZRd4C</ext-link></mixed-citation></ref>
<ref id="ref-16"><label>16</label><mixed-citation>Chowdhury, A. S., Bhandarkar, S. M., Robinson, R. W., &amp; Yu, J. C. (2009). Virtual craniofacial reconstruction using computer vision, graph theory and geometric constraints. Pattern Recognition Letters, 30(10), 931–938. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/j.patrec.2009.03.010">https://doi.org/10.1016/j.patrec.2009.03.010</ext-link></mixed-citation></ref>
<ref id="ref-17"><label>17</label><mixed-citation>Majnik, M., &amp; Bosnić, Z. (2013). ROC analysis of classifiers in machine learning: A survey. Intelligent Data Analysis, 17(3), 531–558. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.3233/IDA-130592">https://doi.org/10.3233/IDA-130592</ext-link></mixed-citation></ref>
<ref id="ref-18"><label>18</label><mixed-citation>Peri, A. Ş., Katı, N., &amp; Uçar, F. (2025). Machine learning approaches in medical data processing: A proposal for an intelligent stroke diagnosis system. Firat University Journal of Experimental and Computational Engineering, 4(2), 446–459. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.62520/fujece.1694558">https://doi.org/10.62520/fujece.1694558</ext-link></mixed-citation></ref>
<ref id="ref-19"><label>19</label><mixed-citation>Tashkova, A., Eftimov, S., Ristov, B., &amp; Kalajdziski, S. (2025). Comparative analysis of stroke prediction models using machine learning. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.48550/arXiv.2505.09812">https://doi.org/10.48550/arXiv.2505.09812</ext-link></mixed-citation></ref>
<ref id="ref-20"><label>20</label><mixed-citation>Beba, E., Mehanović, D., Vreto, S., &amp; Dželihodžić, A. (2024). A comparative analysis of machine learning models for early stroke prediction. International Journal of Advances in Engineering and Management, 6(5), 972–980. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.35629/5252-0605972980">https://doi.org/10.35629/5252-0605972980</ext-link></mixed-citation></ref>
<ref id="ref-21"><label>21</label><mixed-citation>Kitova, K., Ivanov, I., &amp; Hooper, V. (2024). Stroke dataset modeling: Comparative study of machine learning classification methods. Algorithms, 17(12), 1–16. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.3390/a17120571">https://doi.org/10.3390/a17120571</ext-link></mixed-citation></ref>
<ref id="ref-22"><label>22</label><mixed-citation>Chakraborty, P., Bandyopadhyay, A., Sahu, P. P., Burman, A., Mallik, S., Alsubaie, N., … ., &amp; Soufiene, B. O. (2024). Predicting stroke occurrences: A stacked machine learning approach with feature selection and data preprocessing. BMC Bioinformatics, 25(1), 329. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1186/s12859-024-05866-8">https://doi.org/10.1186/s12859-024-05866-8</ext-link></mixed-citation></ref>
<ref id="ref-23"><label>23</label><mixed-citation>Saleem, M. A., Javeed, A., Akarathanawat, W., Chutinet, A., Suwanwela, N. C., Kaewplung, P., … ., &amp; Benjapolakul, W. (2024). An intelligent learningsystem based on electronic health records for unbiased stroke prediction. Scientific Reports, 14(1), 23052. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1038/s41598-024-73570-x">https://doi.org/10.1038/s41598-024-73570-x</ext-link></mixed-citation></ref>
<ref id="ref-24"><label>24</label><mixed-citation>Akiba, T., Sano, S., Yanase, T., Ohta, T., &amp; Koyama, M. (2019). Optuna: A next-generation hyperparameter optimization framework. Proceedings of the 25th ACM Sigkdd International Conference on Knowledge Discovery &amp; Data Mining (pp. 2623–2631). ACM Digital library. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1145/3292500.3330701">https://doi.org/10.1145/3292500.3330701</ext-link></mixed-citation></ref>
</ref-list></back>
</article>