Cost-Sensitive and Explainable Machine Learning for Predictive Maintenance Decision Support in Industry 4.0
Keywords:
Predictive maintenance, Explainable artificial intelligence, Class imbalance, Cost-sensitive learning, Probability calibration, Gradient boosting, Industry 4.0Abstract
Unplanned equipment failure remains one of the largest controllable cost drivers in discrete manufacturing, and the sensor infrastructure of Industry 4.0 has made data-driven predictive maintenance a practical alternative to reactive and calendar-based policies. Published benchmarks on this task, however, are dominated by threshold-free accuracy reporting: models are compared on metrics that are optimistic under severe class imbalance, synthetic resampling is applied as a default remedy, the predicted probability is converted into a maintenance action at an arbitrary cut-off of 0.50, and the resulting model is rarely interrogated for the reasoning behind its alarms. The purpose of this study is to develop and validate an integrated decision-support framework that connects classifier selection, imbalance handling, probability calibration, decision-theoretic thresholding and post-hoc explanation within a single reproducible pipeline. The framework is evaluated on the AI4I 2020 predictive maintenance benchmark, which contains 10,000 machining observations with a 3.39% failure rate. Four physics-informed descriptors are derived from the raw signals, eleven classifiers are screened under ten-fold stratified cross-validation with the area under the precision-recall curve as the primary criterion, seven resampling schemes are compared against an unresampled baseline, and differences are tested with the Friedman test followed by Holm-corrected Wilcoxon signed-rank comparisons. Gradient boosting achieves the best cross-validated performance (PR-AUC 0.9145) and a hold-out PR-AUC of 0.8987 with a Matthews correlation coefficient of 0.888; it is statistically indistinguishable from random forest and LightGBM but superior to the remaining eight learners. None of the seven resampling schemes improves ranking quality, and every one of them degrades precision substantially. The operational gain instead comes from the decision layer: isotonic calibration reduces the Brier score from 0.00726 to 0.00654, and combining calibrated probabilities with the cost-minimising threshold lowers expected misclassification cost by 37.2% relative to the default cut-off and by 87.0% relative to a run-to-failure policy. Shapley attributions identify tool wear, rotational speed, the process-air temperature difference and torque as the dominant drivers, reproducing the documented physical failure mechanisms of the benchmark and supporting engineer-facing justification of individual alarms.
Downloads
References
Zonta, T., da Costa, C. A., da Rosa Righi, R., de Lima, M. J., da Trindade, E. S., & Li, G. P. (2020). Predictive maintenance in the Industry 4.0: A systematic literature review. Computers & Industrial Engineering, 150, 106889. https://doi.org/10.1016/j.cie.2020.106889
Carvalho, T. P., Soares, F. A. A. M. N., Vita, R., Francisco, R. P., Basto, J. P., & Alcalá, S. G. S. (2019). A systematic literature review of machine learning methods applied to predictive maintenance. Computers & Industrial Engineering, 137, 106024. https://doi.org/10.1016/j.cie.2019.106024
Susto, G. A., Schirru, A., Pampuri, S., McLoone, S., & Beghi, A. (2015). Machine learning for predictive maintenance: A multiple classifier approach. IEEE Transactions on Industrial Informatics, 11(3), 812–820. https://doi.org/10.1109/TII.2014.2349359
Matzka, S. (2020). Explainable artificial intelligence for predictive maintenance applications. In 2020 Third International Conference on Artificial Intelligence for Industries (AI4I) (pp. 69–74). IEEE. https://doi.org/10.1109/AI4I49448.2020.00023
Gawde, S., Patil, S., Kumar, S., Kamat, P., Kotecha, K., & Alfarhood, S. (2024). Explainable predictive maintenance of rotating machines using LIME, SHAP, PDP, ICE. IEEE Access, 12, 29345–29361. https://doi.org/10.1109/ACCESS.2024.3367110
Ghasemkhani, B., Aktas, O., & Birant, D. (2023). Balanced k-star: An explainable machine learning method for Internet-of-Things-enabled predictive maintenance in manufacturing. Machines, 11(3), 322. https://doi.org/10.3390/machines11030322
He, H., & Garcia, E. A. (2009). Learning from imbalanced data. IEEE Transactions on Knowledge and Data Engineering, 21(9), 1263–1284. https://doi.org/10.1109/TKDE.2008.239
Chawla, N. V., Bowyer, K. W., Hall, L. O., & Kegelmeyer, W. P. (2002). SMOTE: Synthetic minority over-sampling technique. Journal of Artificial Intelligence Research, 16, 321–357. https://doi.org/10.1613/jair.953
Han, H., Wang, W.-Y., & Mao, B.-H. (2005). Borderline-SMOTE: A new over-sampling method in imbalanced data sets learning. In Advances in Intelligent Computing (ICIC 2005), LNCS 3644 (pp. 878–887). Springer. https://doi.org/10.1007/11538059_91
He, H., Bai, Y., Garcia, E. A., & Li, S. (2008). ADASYN: Adaptive synthetic sampling approach for imbalanced learning. In 2008 IEEE International Joint Conference on Neural Networks (pp. 1322–1328). IEEE. https://doi.org/10.1109/IJCNN.2008.4633969
Batista, G. E. A. P. A., Prati, R. C., & Monard, M. C. (2004). A study of the behavior of several methods for balancing machine learning training data. ACM SIGKDD Explorations Newsletter, 6(1), 20–29. https://doi.org/10.1145/1007730.1007735
Saito, T., & Rehmsmeier, M. (2015). The precision-recall plot is more informative than the ROC plot when evaluating binary classifiers on imbalanced datasets. PLOS ONE, 10(3), e0118432. https://doi.org/10.1371/journal.pone.0118432
Chicco, D., & Jurman, G. (2020). The advantages of the Matthews correlation coefficient (MCC) over F1 score and accuracy in binary classification evaluation. BMC Genomics, 21, 6. https://doi.org/10.1186/s12864-019-6413-7
Fawcett, T. (2006). An introduction to ROC analysis. Pattern Recognition Letters, 27(8), 861–874. https://doi.org/10.1016/j.patrec.2005.10.010
Niculescu-Mizil, A., & Caruana, R. (2005). Predicting good probabilities with supervised learning. In Proceedings of the 22nd International Conference on Machine Learning (pp. 625–632). ACM. https://doi.org/10.1145/1102351.1102430
Lundberg, S. M., Erion, G., Chen, H., DeGrave, A., Prutkin, J. M., Nair, B., Katz, R., Himmelfarb, J., Bansal, N., & Lee, S.-I. (2020). From local explanations to global understanding with explainable AI for trees. Nature Machine Intelligence, 2(1), 56–67. https://doi.org/10.1038/s42256-019-0138-9
Ribeiro, M. T., Singh, S., & Guestrin, C. (2016). "Why should I trust you?": Explaining the predictions of any classifier. In Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (pp. 1135–1144). ACM. https://doi.org/10.1145/2939672.2939778
Barredo Arrieta, A., Díaz-Rodríguez, N., Del Ser, J., Bennetot, A., Tabik, S., Barbado, A., García, S., Gil-López, S., Molina, D., Benjamins, R., Chatila, R., & Herrera, F. (2020). Explainable Artificial Intelligence (XAI): Concepts, taxonomies, opportunities and challenges toward responsible AI. Information Fusion, 58, 82–115. https://doi.org/10.1016/j.inffus.2019.12.012
Cortes, C., & Vapnik, V. (1995). Support-vector networks. Machine Learning, 20(3), 273–297. https://doi.org/10.1007/BF00994018
Breiman, L. (2001). Random forests. Machine Learning, 45(1), 5–32. https://doi.org/10.1023/A:1010933404324
Geurts, P., Ernst, D., & Wehenkel, L. (2006). Extremely randomized trees. Machine Learning, 63(1), 3–42. https://doi.org/10.1007/s10994-006-6226-1
Friedman, J. H. (2001). Greedy function approximation: A gradient boosting machine. The Annals of Statistics, 29(5), 1189–1232. https://doi.org/10.1214/aos/1013203451
Chen, T., & Guestrin, C. (2016). XGBoost: A scalable tree boosting system. In Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (pp. 785–794). ACM. https://doi.org/10.1145/2939672.2939785
Downloads
Published
Issue
Section
License
Copyright (c) 2026 Yavuz Selim Balcıoğlu (Author)

This work is licensed under a Creative Commons Attribution 4.0 International License.