Fatma Indriani
Universitas Lambung Mangkurat, Indonesia

Published : 2 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 2 Documents
Search

Optimasi Recursive Feature Elimination menggunakan Shapley Additive Explanations dalam Prediksi Cacat Software dengan klasifikasi LightGBM Hartati Hartati; Rudy Herteno; Mohammad Reza Faisal; Fatma Indriani; Friska Abadi
JURNAL INFOTEL Vol 17 No 1 (2025): February 2025
Publisher : LPPM INSTITUT TEKNOLOGI TELKOM PURWOKERTO

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.20895/infotel.v17i1.1159

Abstract

Software defect refers to issues where the software does not function properly. The mistakes in the software development process are the reasons for software defects. Software defect prediction is performed to ensure the software is defect-free. Machine learning classification is used to classify defects in software. To improve the classification model, it is necessary to select the best features from the dataset. Recursive Feature Elimination (RFE) is a feature selection method. Shapley Additive Explanations (SHAP) is a method that can optimize feature selection algorithms to produce better results. In this research, the popular boosting algorithm LightGBM will be selected as a classifier to predict software defects. Meanwhile, RFE-SHAP will be used for feature selection to identify the best subset of features. The results and discussion show that RFE-SHAP feature selection slightly outperforms RFE, with average AUC values of 0.864 and 0.858, respectively. Moreover, RFE-SHAP produces more significant results in feature selection compared to RFE. The RFE feature selection T-Test results are Pvalue = 0.039 < α = 0.05 and tcount = 3.011 > ttable = 2.776. On the contrary, the RFE-SHAP feature selection T-Test results are Pvalue = 0.000 < α = 0.05 and tcount = 11.91 > ttable = 2.776.
Evaluating Ordinal Regression Approaches for Automated Knee Osteoarthritis Severity Classification Using ResNet-18 on Radiographic X-Ray Images Muhammad Kamal Khatami; Fatma Indriani; Andi Farmadi; Muliadi; Muhammad Itqan Mazdadi
Journal of Vocational, Informatics and Computer Education Vol 4, No 2 (2026): June 2026
Publisher : Academic Bright Collaboration

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.66053/voice.v4i2.845

Abstract

Purpose – This study examines whether explicitly modeling ordinal severity relationships improves automated Knee Osteoarthritis (KOA) grading compared to conventional multi-class classification. Most existing studies treat KL grade prediction as a categorical problem, overlooking the ordered structure inherent to disease severity progression. Methods – A comparative experimental study was conducted using the publicly available Knee Osteoarthritis (KOA) dataset obtained from Kaggle (Tiwari, 2021). Although the original dataset contains 9,786 knee X-ray images categorized into five Kellgren–Lawrence (KL) severity grades, only the predefined training, validation, and testing subsets were utilized, resulting in a total of 8,260 images for model development and evaluation. Four classification approaches were evaluated under identical experimental conditions: conventional multi-class classification (baseline), Cumulative Link Model (CLM), Binary Cross-Entropy (BCE), and Consistent Rank Logits (CORAL), all using a pretrained ResNet-18 backbone. Performance was assessed using Accuracy, AUC, MAE, Quadratic Weighted Kappa (QWK), and F1-score. Findings – BCE achieved the highest observed performance among the evaluated approaches under the current predefined experimental setting, obtaining 67.81% ACC, 89.72% AUC, 0.3702 MAE, 0.8393 QWK, and 0.6750 F1-score. The baseline model remained competitive with 64.01% ACC and 0.7948 QWK, while CLM produced the lowest QWK (0.7713) and CORAL recorded the lowest F1-score (0.3769). Across all methods, Grade 1 remained the most challenging severity category, indicating persistent difficulty in distinguishing early-stage KOA cases. Research implications – The findings suggest that threshold-based ordinal decomposition may provide a practical balance between ordinal awareness and predictive flexibility for severity grading tasks under the current experimental setting. The study is limited to a single dataset and backbone architecture, and external validation is needed before broader clinical deployment. Originality – This study provides a controlled comparative evaluation of multiple ordinal regression formulations for KOA severity grading, demonstrating that ordinal learning effectiveness depends heavily on how rank relationships are modeled rather than on ordinal awareness alone.