Change search
Link to record
Permanent link

Direct link
Publications (10 of 48) Show all publications
Kharazian, Z. & Lindgren, T. (2025). Challenges in Industrial Data Access in Predictive Maintenance. IEEE Reliability Magazine, 2(3), 18-22
Open this publication in new window or tab >>Challenges in Industrial Data Access in Predictive Maintenance
2025 (English)In: IEEE Reliability Magazine, E-ISSN 2641-8819, Vol. 2, no 3, p. 18-22Article in journal (Refereed) Published
Abstract [en]

Predictive maintenance reduces downtime and maintenance costs by early detection of equipment failures using sensor data and machine learning techniques. Despite its potential, the progress of this technique is usually affected by limited access to real-world industrial data. Industrial datasets are often not shared due to confidentiality concerns, competitive interests, and regulatory constraints such as the GDPR. This article discusses the challenges of industrial data access, explores alternative approaches to enable data-driven collaboration, and outlines common technical challenges associated with real-world datasets. Addressing these challenges through collaborative, privacy-preserving data sharing is essential for enhancing maintenance strategies and enabling closer collaboration between industry and academia.

Keywords
Maintenance engineering, Data models, Companies, Data privacy, Industries, Synthetic data, Predictive models, Predictive maintenance, Equipment failure
National Category
Information Systems
Research subject
Computer and Systems Sciences
Identifiers
urn:nbn:se:su:diva-246978 (URN)10.1109/MRL.2025.3596571 (DOI)
Available from: 2025-09-15 Created: 2025-09-15 Last updated: 2025-09-15Bibliographically approved
Wang, H., Huang, W., Magnússon, S., Lindgren, T., Chen, C., Wu, J. & Song, Y. (2025). Crowding distance and IGD-driven grey wolf reinforcement learning approach for multi-objective agile earth observation satellite scheduling. International Journal of Digital Earth, 18(1), Article ID 2458024.
Open this publication in new window or tab >>Crowding distance and IGD-driven grey wolf reinforcement learning approach for multi-objective agile earth observation satellite scheduling
Show others...
2025 (English)In: International Journal of Digital Earth, ISSN 1753-8947, E-ISSN 1753-8955, Vol. 18, no 1, article id 2458024Article in journal (Refereed) Published
Abstract [en]

With the rise of low-cost launches, miniaturized space technology, and commercialization, the cost of space missions has dropped, leading to a surge in flexible Earth observation satellites. This increased demand for complex and diverse imaging products requires addressing multi-objective optimization in practice. To this end, we propose a multi-objective agile Earth observation satellite scheduling problem (MOAEOSSP) model and introduce a reinforcement learning-based multi-objective grey wolf optimization (RLMOGWO) algorithm. It aims to maximize observation efficiency while minimizing energy consumption. During population initialization, the algorithm uses chaos mapping and opposition-based learning to enhance diversity and global search, reducing the risk of local optima. It integrates Q-learning into an improved multi-objective grey wolf optimization framework, designing state-action combinations that balance exploration and exploitation. Dynamic parameter adjustments guide position updates, boosting adaptability across different optimization stages. Moreover, the algorithm introduces a reward mechanism based on the crowding distance and inverted generational distance (IGD) to maintain Pareto front diversity and distribution, ensuring a strong multi-objective optimization performance. The experimental results show that the algorithm excels at solving the MOAEOSSP, outperforming competing algorithms across several metrics and demonstrating its effectiveness for complex optimization problems.

Keywords
Earth observation satellite, grey wolf algorithm, multi-objective optimization, Q-learning, reinforcement learning, scheduling
National Category
Computer Sciences
Identifiers
urn:nbn:se:su:diva-240188 (URN)10.1080/17538947.2025.2458024 (DOI)001410804300001 ()2-s2.0-85216608663 (Scopus ID)
Available from: 2025-03-04 Created: 2025-03-04 Last updated: 2025-03-04Bibliographically approved
Randl, K. R., Pavlopoulos, I., Henriksson, A. & Lindgren, T. (2025). Evaluating the Reliability of Self-Explanations in Large Language Models. In: Dino Pedreschi; Anna Monreale; Riccardo Guidotti; Roberto Pellungrini; Francesca Naretto (Ed.), Discovery Science: 27th International Conference, DS 2024, Pisa, Italy, October 14–16, 2024, Proceedings, Part I. Paper presented at Discovery Science, 27th International Conference, DS 2024, 14-16 October 2024, Pisa, Italy. (pp. 36-51). Springer Publishing Company
Open this publication in new window or tab >>Evaluating the Reliability of Self-Explanations in Large Language Models
2025 (English)In: Discovery Science: 27th International Conference, DS 2024, Pisa, Italy, October 14–16, 2024, Proceedings, Part I / [ed] Dino Pedreschi; Anna Monreale; Riccardo Guidotti; Roberto Pellungrini; Francesca Naretto, Springer Publishing Company , 2025, p. 36-51Conference paper, Published paper (Refereed)
Abstract [en]

This paper investigates the reliability of explanations generated by large language models~(LLMs) when prompted to explain their previous output. We evaluate two kinds of such self-explanations -- extractive and counterfactual -- using three state-of-the-art LLMs (2B to 8B parameters) on two different classification tasks (objective and subjective).

Our findings reveal, that, while these self-explanations can correlate with human judgement, they do not fully and accurately follow the model's decision process, indicating a gap between perceived and actual model reasoning.

We show that this gap can be bridged because prompting LLMs for counterfactual explanations can produce faithful, informative, and easy-to-verify results. These counterfactuals offer a promising alternative to traditional explainability methods (e.g. SHAP, LIME), provided that prompts are tailored to specific tasks and checked for validity.

Place, publisher, year, edition, pages
Springer Publishing Company, 2025
Series
Lecture Notes in Computer Science (LNCS), ISSN 0302-9743, E-ISSN 1611-3349 ; 15243
Keywords
Large Language Models, Self-Explanations, Counterfactuals
National Category
Computer Sciences
Research subject
Computer and Systems Sciences
Identifiers
urn:nbn:se:su:diva-239126 (URN)10.1007/978-3-031-78977-9_3 (DOI)2-s2.0-85218499264 (Scopus ID)978-3-031-78976-2 (ISBN)978-3-031-78977-9 (ISBN)
Conference
Discovery Science, 27th International Conference, DS 2024, 14-16 October 2024, Pisa, Italy.
Available from: 2025-02-06 Created: 2025-02-06 Last updated: 2025-04-09Bibliographically approved
Randl, K. R., Pavlopoulos, J., Henriksson, A. & Lindgren, T. (2025). Mind the gap: from plausible to valid self-explanations in large language models. Machine Learning, 114(10), Article ID 220.
Open this publication in new window or tab >>Mind the gap: from plausible to valid self-explanations in large language models
2025 (English)In: Machine Learning, ISSN 0885-6125, E-ISSN 1573-0565, Vol. 114, no 10, article id 220Article in journal (Refereed) Published
Abstract [en]

This paper investigates the reliability of explanations generated by large language models (LLMs) when prompted to explain their previous output. We evaluate two kinds of such self-explanations (SE)—extractive and counterfactual—using state-of-the-art LLMs (1B to 70B parameters) on three different classification tasks (both objective and subjective). In line with Agarwal et al. (Faithfulness versus plausibility: On the (Un)reliability of explanations from large language models. 2024. https://doi.org/10.48550/arXiv.2402.04614), our findings indicate a gap between perceived and actual model reasoning: while SE largely correlate with human judgment (i.e. are plausible), they do not fully and accurately follow the model’s decision process (i.e. are not faithful). Additionally, we show that counterfactual SE are not even necessarily valid in the sense of actually changing the LLM’s prediction. Our results suggest that extractive SE provide the LLM’s “guess” at an explanation based on training data. Conversely, counterfactual SE can help understand the LLM’s reasoning: We show that the issue of validity can be resolved by sampling counterfactual candidates at high temperature—followed by a validity check—and introducing a formula to estimate the number of tries needed to generate valid explanations. This simple method produces plausible and valid explanations that offer a 16 times faster alternative to SHAP on average in our experiments.

Keywords
Attention-based explainability, Counterfactuals, Gradient-based explainability, Interpretability, Large language models (LLMs), Self-explanations
National Category
Natural Language Processing
Identifiers
urn:nbn:se:su:diva-246656 (URN)10.1007/s10994-025-06838-6 (DOI)001563123000001 ()2-s2.0-105014633582 (Scopus ID)
Available from: 2025-09-09 Created: 2025-09-09 Last updated: 2025-10-06Bibliographically approved
Kharazian, Z., Lindgren, T., Magnússon, S., Steinert, O. & Andersson Reyna, O. (2025). SCANIA Component X dataset: a real-world multivariate time series dataset for predictive maintenance. Scientific Data, 12, Article ID 493.
Open this publication in new window or tab >>SCANIA Component X dataset: a real-world multivariate time series dataset for predictive maintenance
Show others...
2025 (English)In: Scientific Data, E-ISSN 2052-4463, Vol. 12, article id 493Article in journal (Refereed) Published
Abstract [en]

Predicting failures and maintenance time in predictive maintenance is challenging due to the scarcity of comprehensive real-world datasets, and among those available, few are of time series format. This paper introduces a real-world, multivariate time series dataset collected exclusively from a single anonymized engine component (Component X) across a fleet of SCANIA trucks. The dataset includes operational data, repair records, and specifications related to Component X while maintaining confidentiality through anonymization. It is well-suited for a range of machine learning applications, including classification, regression, survival analysis, and anomaly detection, particularly in predictive maintenance scenarios. The dataset’s large population size, diverse features (in the form of histograms and numerical counters), and temporal information make it a unique resource in the field. The objective of releasing this dataset is to give a broad range of researchers the possibility of working with real-world data from an internationally well-known company and introduce a standard benchmark to the predictive maintenance field, fostering reproducible research.

National Category
Reliability and Maintenance
Identifiers
urn:nbn:se:su:diva-241823 (URN)10.1038/s41597-025-04802-6 (DOI)001451143800005 ()2-s2.0-105000887799 (Scopus ID)
Available from: 2025-04-10 Created: 2025-04-10 Last updated: 2025-04-10Bibliographically approved
Randl, K. R., Pavlopoulos, I., Henriksson, A., Lindgren, T. & Bakagianni, J. (2025). SemEval-2025 Task 9: The Food Hazard Detection Challenge. In: Sara Rosenthal; Aiala Rosá; Debanjan Ghosh; Marcos Zampieri (Ed.), Proceedings of the 19th International Workshop on Semantic Evaluation (SemEval-2025): . Paper presented at The 19th International Workshop on Semantic Evaluation, July 2025, Vienna, Austria. (pp. 2523-2534). Association for Computational Linguistics
Open this publication in new window or tab >>SemEval-2025 Task 9: The Food Hazard Detection Challenge
Show others...
2025 (English)In: Proceedings of the 19th International Workshop on Semantic Evaluation (SemEval-2025) / [ed] Sara Rosenthal; Aiala Rosá; Debanjan Ghosh; Marcos Zampieri, Association for Computational Linguistics , 2025, p. 2523-2534Conference paper, Published paper (Refereed)
Abstract [en]

In this challenge, we explored text-based food hazard prediction with long tail distributed classes. The task was divided into two subtasks: (1) predicting whether a web text implies one of ten food-hazard categories and identifying the associated food category, and (2) providing a more fine-grained classification by assigning a specific label to both the hazard and the product. Our findings highlight that large language model-generated synthetic data can be highly effective for oversampling long-tail distributions. Furthermore, we find that fine-tuned encoder-only, encoder-decoder, and decoder-only systems achieve comparable maximum performance across both subtasks. During this challenge, we gradually released (under CC BY-NC-SA 4.0) a novel set of 6,644 manually labeled food-incident reports.

Place, publisher, year, edition, pages
Association for Computational Linguistics, 2025
National Category
Computer Sciences
Research subject
Computer and Systems Sciences
Identifiers
urn:nbn:se:su:diva-247395 (URN)979-8-89176-273-2 (ISBN)
Conference
The 19th International Workshop on Semantic Evaluation, July 2025, Vienna, Austria.
Available from: 2025-09-24 Created: 2025-09-24 Last updated: 2025-09-24Bibliographically approved
Kuratomi Hernandez, A., Lee, Z., Tsaparas, P., Pitoura, E., Lindgren, T., Chaliane Junior, G. D. & Papapetrou, P. (2025). Subgroup fairness based on shared counterfactuals. Knowledge and Information Systems
Open this publication in new window or tab >>Subgroup fairness based on shared counterfactuals
Show others...
2025 (English)In: Knowledge and Information Systems, ISSN 0219-1377, E-ISSN 0219-3116Article in journal (Refereed) Epub ahead of print
Abstract [en]

CounterFair is a group counterfactual search algorithm that detects and minimizes biases among sensitive groups and identifies relevant subgroups inside these sensitive groups based on shared counterfactual instances. We investigate the latter capability, analyzing the found subgroups from the perspective of fairness based on counterfactual reasoning, in order to evaluate whether they present different biases with respect to each other and to the sensitive feature groups they belong to. We perform these measurements on the subgroups extracted by CounterFair over six binary classification datasets, providing figures and their respective analysis on the presence of bias.

Keywords
Bias, Counterfactual, Explainability, Fairness, Subgroups
National Category
Human Computer Interaction
Identifiers
urn:nbn:se:su:diva-247063 (URN)10.1007/s10115-025-02555-7 (DOI)001551587300001 ()2-s2.0-105013550551 (Scopus ID)
Available from: 2025-09-25 Created: 2025-09-25 Last updated: 2025-09-25
Majyambere, S., Lindgren, T., Twizere, C. & Nyiringango, G. (2025). Using Explainable Machine Learning for Diabetes Management in Emergency Departments. In: Svetlana Herasevich (Ed.), eTELEMED 2025, The Seventeenth International Conference on eHealth, Telemedicine, and Social Medicine: . Paper presented at eTELEMED 2025, The Seventeenth International Conference on eHealth, Telemedicine, and Social Medicine,Nice, France, 18-22 May, 2025. (pp. 22-29). International Academy, Research and Industry Association (IARIA)
Open this publication in new window or tab >>Using Explainable Machine Learning for Diabetes Management in Emergency Departments
2025 (English)In: eTELEMED 2025, The Seventeenth International Conference on eHealth, Telemedicine, and Social Medicine / [ed] Svetlana Herasevich, International Academy, Research and Industry Association (IARIA) , 2025, p. 22-29Conference paper, Published paper (Refereed)
Abstract [en]

Uncontrolled diabetes can lead to severe complications and Intensive Care Unit (ICU) admissions. This study presents an explainable machine learning model using electronic health records to predict ICU admissions and estimate hospital stay duration for diabetic patients. AdaBoost model outperformed other models on ICU admission prediction, while CatBoost exhibited superior performance in estimating ICU length of stays among diabetic patients admitted to the emergency departments. The results demonstrate the potential of explainable machine learning in ICU risk assessment and can aid healthcare providers in early intervention and resource utilization. The clinician and the proposed model agree on the top 25 features identified by Shapley Additive exPlanations (SHAP) methods for predicting ICU admission, but they differ in the ranking of the top five most significant predictors.

Place, publisher, year, edition, pages
International Academy, Research and Industry Association (IARIA), 2025
Series
International Conference on eHealth, Telemedicine, and Social Medicine (eTELEMED), E-ISSN 2308-4359
Keywords
Explainable Machine Learning, Intensive Care Unit, Diabetes, Length of Stay, SHAP.
National Category
Computer Sciences
Research subject
Computer and Systems Sciences
Identifiers
urn:nbn:se:su:diva-250985 (URN)978-1-68558-270-8 (ISBN)
Conference
eTELEMED 2025, The Seventeenth International Conference on eHealth, Telemedicine, and Social Medicine,Nice, France, 18-22 May, 2025.
Available from: 2026-01-11 Created: 2026-01-11 Last updated: 2026-01-16Bibliographically approved
Wang, H., Huang, W., Magnússon, S., Lindgren, T., Wang, R. & Song, Y. (2024). A Strategy Fusion-Based Multiobjective Optimization Approach for Agile Earth Observation Satellite Scheduling Problem. IEEE Transactions on Geoscience and Remote Sensing, 62, 1-14, Article ID 5930214.
Open this publication in new window or tab >>A Strategy Fusion-Based Multiobjective Optimization Approach for Agile Earth Observation Satellite Scheduling Problem
Show others...
2024 (English)In: IEEE Transactions on Geoscience and Remote Sensing, ISSN 0196-2892, E-ISSN 1558-0644, Vol. 62, p. 1-14, article id 5930214Article in journal (Refereed) Published
Abstract [en]

Agile satellite imaging scheduling plays a vital role in improving emergency response, urban planning, national defense, and resource management. With the rise in the number of in-orbit satellites and observation windows, the need for diverse agile Earth observation satellite (AEOS) scheduling has surged. However, current research seldom addresses multiple optimization objectives, which are crucial in many engineering practices. This article tackles a multiobjective AEOS scheduling problem (MOAEOSSP) that aims to optimize total observation task profit, satellite energy consumption, and load balancing. To address this intricate problem, we propose a strategy-fused multiobjective dung beetle optimization (SFMODBO) algorithm. This novel algorithm harnesses the position update characteristics of various dung beetle populations and integrates multiple high-adaptability strategies. Consequently, it strikes a better balance between global search capability and local exploitation accuracy, making it more effective at exploring the solution space and avoiding local optima. The SFMODBO algorithm enhances global search capabilities through diverse strategies, ensuring thorough coverage of the search space. Simultaneously, it significantly improves local optimization precision by fine-tuning solutions in promising regions. This dual approach enables more robust and efficient problem-solving. Simulation experiments confirm the effectiveness and efficiency of the SFMODBO algorithm. Results indicate that it significantly outperforms competitors across multiple metrics, achieving superior scheduling schemes. In addition to these enhanced metrics, the proposed algorithm also exhibits advantages in computation time and resource utilization. This not only demonstrates the algorithm’s robustness but also underscores its efficiency and speed in solving the MOAEOSSP.

Keywords
Satellites, Optimization, Scheduling, Mathematical models, Earth, Processor scheduling, Heuristic algorithms, Search problems, Energy consumption, Computational modeling, Agile Earth observation satellite (AEOS), multiobjective dung beetle optimization (MODBO), remote sensing, satellite observation scheduling
National Category
Computer Sciences
Research subject
Computer and Systems Sciences
Identifiers
urn:nbn:se:su:diva-237872 (URN)10.1109/TGRS.2024.3472749 (DOI)001338406700001 ()2-s2.0-85206199686 (Scopus ID)
Available from: 2025-01-14 Created: 2025-01-14 Last updated: 2025-01-14Bibliographically approved
Pavlopoulos, I., Romell, A., Curman, J., Steinert, O., Lindgren, T., Borg, M. & Randl, K. (2024). Automotive fault nowcasting with machine learning and natural language processing. Machine Learning, 113(2), 843-861
Open this publication in new window or tab >>Automotive fault nowcasting with machine learning and natural language processing
Show others...
2024 (English)In: Machine Learning, ISSN 0885-6125, E-ISSN 1573-0565, Vol. 113, no 2, p. 843-861Article in journal (Refereed) Published
Abstract [en]

Automated fault diagnosis can facilitate diagnostics assistance, speedier troubleshooting, and better-organised logistics. Currently, most AI-based prognostics and health management in the automotive industry ignore textual descriptions of the experienced problems or symptoms. With this study, however, we propose an ML-assisted workflow for automotive fault nowcasting that improves on current industry standards. We show that a multilingual pre-trained Transformer model can effectively classify the textual symptom claims from a large company with vehicle fleets, despite the task’s challenging nature due to the 38 languages and 1357 classes involved. Overall, we report an accuracy of more than 80% for high-frequency classes and above 60% for classes with reasonable minimum support, bringing novel evidence that automotive troubleshooting management can benefit from multilingual symptom text classification.

Keywords
Automotive fault nowcasting, Natural language processing, Multilingual text classification
National Category
Computer Sciences
Research subject
Computer and Systems Sciences
Identifiers
urn:nbn:se:su:diva-222622 (URN)10.1007/s10994-023-06398-7 (DOI)001075969400001 ()2-s2.0-85173121401 (Scopus ID)
Available from: 2023-10-13 Created: 2023-10-13 Last updated: 2024-02-22Bibliographically approved
Organisations
Identifiers
ORCID iD: ORCID iD iconorcid.org/0000-0001-7713-1381

Search in DiVA

Show all publications