George A. Vouros
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
George A. Vouros has a total of 82 co-authors. Here are the top co-authors by number of shared publications:
- Christos Doulkeridis
Department of Digital Systems, University of Piraeus, 18534 Piraeus, Greece
6 shared publications - Konstantinos Kotis
Intelligent Systems Lab, Department of Cultural Technology and Communication, University of the Aegean, 81100 Mytilene, Greece
6 shared publications - Georgios M. Santipantakis
Department of Digital Systems, School of Information and Communication Technologies, University of Piraeus, Piraeus, Greece
5 shared publications Christos Doulkeridis
University of Piraeus Greece
4 shared publicationsJose Manuel Cordero Garcia
CRIDA, Madrid, Spain
4 shared publications- Konstantinos Blekas
Department of Computer Science and Engineering, University of Ioannina, Ioannina, Greece
4 shared publications
Latest Publications
- Open Access
Leveraging LLMs for Collaborative Ontology Engineering in Parkinson Disease Monitoring and Alerting
Ontology engineering plays a critical role in clinical decision support systems for Parkinson’s Disease (PD) monitoring and alerting. While Large Language Models (LLMs) have shown promise in knowledge modeling tasks, their effectiveness in autonomously constructing comprehensive ontologies for complex clinical domains remains unclear. This study investigates four ontology engineering methodologies for PD monitoring and alerting: One-shot (OS) prompting, Decomposed Sequential Prompting (DSP), X-HCOME, and SimX-HCOME+. Multiple LLMs were evaluated across these methodologies. Generated ontologies were assessed against a reference PD ontology using structural evaluation metrics focused on classes and object properties. Expert review was additionally conducted to analyze knowledge extensions beyond the gold standard. LLMs were able to autonomously generate syntactically valid and semantically meaningful ontologies using OS and DSP prompting; however, these ontologies exhibited limited conceptual coverage. Incorporating human expertise through X-HCOME significantly improved ontology completeness and evaluation metrics. Expert review further validated clinically relevant concepts absent from the reference ontology. SimX-HCOME+ demonstrated that iterative, supervised collaboration supports ontology refinement, although challenges persisted in natural language-to-rule formalization. The findings suggest that LLMs are more effective as collaborative assistants rather than standalone ontology engineers in the PD domain. Structured human–LLM collaboration is associated with improved ontology coverage and facilitates the identification of potential knowledge extensions in clinical monitoring applications. While the present evaluation focuses primarily on structural ontology elements, the proposed methodologies provide useful insights for LLM-assisted ontology engineering in complex healthcare domains.
Open AccessLeveraging LLMs for Collaborative Ontology Engineering in Parkinson Disease Monitoring and Alerting
Ontology engineering plays a critical role in clinical decision support systems for Parkinson’s Disease (PD) monitoring and alerting. While Large Language Models (LLMs) have shown promise in knowledge modeling tasks, their effectiveness in autonomously constructing comprehensive ontologies for complex clinical domains remains unclear. This study investigates four ontology engineering methodologies for PD monitoring and alerting: One-shot (OS) prompting, Decomposed Sequential Prompting (DSP), X-HCOME, and SimX-HCOME+. Multiple LLMs were evaluated across these methodologies. Generated ontologies were assessed against a reference PD ontology using structural evaluation metrics focused on classes and object properties. Expert review was additionally conducted to analyze knowledge extensions beyond the gold standard. LLMs were able to autonomously generate syntactically valid and semantically meaningful ontologies using OS and DSP prompting; however, these ontologies exhibited limited conceptual coverage. Incorporating human expertise through X-HCOME significantly improved ontology completeness and evaluation metrics. Expert review further validated clinically relevant concepts absent from the reference ontology. SimX-HCOME+ demonstrated that iterative, supervised collaboration supports ontology refinement, although challenges persisted in natural language-to-rule formalization. The findings suggest that LLMs are more effective as collaborative assistants rather than standalone ontology engineers in the PD domain. Structured human–LLM collaboration is associated with improved ontology coverage and facilitates the identification of potential knowledge extensions in clinical monitoring applications. While the present evaluation focuses primarily on structural ontology elements, the proposed methodologies provide useful insights for LLM-assisted ontology engineering in complex healthcare domains.
- Open Access
Scalable Univariate and Multivariate Time-Series Classifiers with Deep Learning Methods Exploiting Symbolic Representations
Time-series classification (TSC) is an important task across sciences. Symbolic representations (especially SFA) are very effective at combating noise. In this paper, we employ symbolic representations to create state-of-the-art time-series classifiers, with the aim to advance scalability without sacrificing accuracy. First, we create a graph representation of the time series based on SFA words. We use this representation together with graph kernels and an SVM classifier to create a scalable time-series classifier. Next, we use the graph representation together with a Graph Convolutional Neural Network to test how it fares against state-of-the-art time-series classifiers. Additionally, we devised deep neural networks exploiting the SFA representation, inspired by the text classification domain, to study how they fare against state-of-the-art classifiers. The proposed deep learning classifiers have been adapted and evaluated for the multivariate time-series case and also against state-of-the-art time-series classification algorithms based on symbolic representations.
Open AccessScalable Univariate and Multivariate Time-Series Classifiers with Deep Learning Methods Exploiting Symbolic Representations
Time-series classification (TSC) is an important task across sciences. Symbolic representations (especially SFA) are very effective at combating noise. In this paper, we employ symbolic representations to create state-of-the-art time-series classifiers, with the aim to advance scalability without sacrificing accuracy. First, we create a graph representation of the time series based on SFA words. We use this representation together with graph kernels and an SVM classifier to create a scalable time-series classifier. Next, we use the graph representation together with a Graph Convolutional Neural Network to test how it fares against state-of-the-art time-series classifiers. Additionally, we devised deep neural networks exploiting the SFA representation, inspired by the text classification domain, to study how they fare against state-of-the-art classifiers. The proposed deep learning classifiers have been adapted and evaluated for the multivariate time-series case and also against state-of-the-art time-series classification algorithms based on symbolic representations.
- Open Access
- 14 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 53-61
A Multimodal Alignment-Based Anomaly Detection Method for Bankruptcy Prediction
- 14 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 53-61
Open AccessA Multimodal Alignment-Based Anomaly Detection Method for Bankruptcy Prediction
- Open Access
Learning safe, constrained policies via imitation learning: Connection to Probabilistic Inference and a Naive Algorithm
This article introduces an imitation learning method for learning maximum entropy policies that comply with constraints demonstrated by expert trajectories executing a task. The formulation of the method takes advantage of results connecting performance to bounds for the KL-divergence between demonstrated and learned policies, and its objective is rigorously justified through a connection to a probabilistic inference framework for reinforcement learning, incorporating the reinforcement learning objective and the objective to abide by constraints in an entropy maximization setting. The proposed algorithm optimizes the learning objective with dual gradient descent, supporting effective and stable training. Experiments show that the proposed method can learn effective policy models for constraints-abiding behaviour, in settings with multiple constraints of different types, accommodating different modalities of demonstrated behaviour, and with abilities to generalize.
Open AccessLearning safe, constrained policies via imitation learning: Connection to Probabilistic Inference and a Naive Algorithm
This article introduces an imitation learning method for learning maximum entropy policies that comply with constraints demonstrated by expert trajectories executing a task. The formulation of the method takes advantage of results connecting performance to bounds for the KL-divergence between demonstrated and learned policies, and its objective is rigorously justified through a connection to a probabilistic inference framework for reinforcement learning, incorporating the reinforcement learning objective and the objective to abide by constraints in an entropy maximization setting. The proposed algorithm optimizes the learning objective with dual gradient descent, supporting effective and stable training. Experiments show that the proposed method can learn effective policy models for constraints-abiding behaviour, in settings with multiple constraints of different types, accommodating different modalities of demonstrated behaviour, and with abilities to generalize.
- Open Access
- 14 November 2024
- Published by Association for Computing Machinery (ACM)
- p. 453-460
Bankruptcy Prediction: Data Augmentation, LLMs and the Need for Auditor's Opinion
Predicting bankruptcy is crucial for managing financial risk in corporations. This study emphasizes incorporating the auditor’s opinion text into prediction models to improve their ability to assess financial health. These opinions provide essential insights as they offer an independent assessment, complementing other predictive inputs like the management’s discussion and analysis. However, the rarity of bankruptcy cases in the data introduces a challenging issue due to severe class imbalance. To address this, we propose a method to generate synthetic positive samples using a variational autoencoder and integrate the multi-source input in a late fusion setting. We showcase that both data augmentation and using multiple textual sources improve the performance of existing models on a related benchmark dataset. Additionally, we evaluate LLMs when used for data augmentation in the proposed method and in a zero-shot prediction setting, discussing important aspects to consider when incorporating them in a predictive pipeline.
- 14 November 2024
- Published by Association for Computing Machinery (ACM)
- p. 453-460
Open AccessBankruptcy Prediction: Data Augmentation, LLMs and the Need for Auditor's Opinion
Predicting bankruptcy is crucial for managing financial risk in corporations. This study emphasizes incorporating the auditor’s opinion text into prediction models to improve their ability to assess financial health. These opinions provide essential insights as they offer an independent assessment, complementing other predictive inputs like the management’s discussion and analysis. However, the rarity of bankruptcy cases in the data introduces a challenging issue due to severe class imbalance. To address this, we propose a method to generate synthetic positive samples using a variational autoencoder and integrate the multi-source input in a late fusion setting. We showcase that both data augmentation and using multiple textual sources improve the performance of existing models on a related benchmark dataset. Additionally, we evaluate LLMs when used for data augmentation in the proposed method and in a zero-shot prediction setting, discussing important aspects to consider when incorporating them in a predictive pipeline.
- Open Access
Machine-Learning Methods Estimating Flights’ Hidden Parameters for the Prediction of KPIs
Complex microscopic simulation models of strategic Air Traffic Management (ATM) performance assessment and decision-making are hindered by several factors. One of the most important is the existence of hidden parameters—such as aircraft take-off weight (TOW) and the selected cost index (CI)—which, if known, would allow for more effective performance modeling methodologies for assessing Key Performance Indicators (KPIs) at various levels of abstraction/detail, e.g., system-wide, or at the level of individual flights. This research proposes a data-driven methodology for the estimation of flights’ hidden parameters combining mechanistic and advanced Artificial Intelligence/Machine Learning (AI/ML) models. Aiming at microsimulation models, our goal is to study the effect of these estimations on the prediction of flights’ KPIs. In so doing, we propose a novel methodology according to which data-driven methods are trained given optimal trajectories (produced by mechanistic models) corresponding to known hidden parameter values, with the aim of predicting hidden parameters’ values of unseen trajectories. The results show that estimations of hidden parameters support the accurate prediction of KPIs regarding the efficiency of flights: fuel consumption, gate-to-gate time and distance flown.
Open AccessMachine-Learning Methods Estimating Flights’ Hidden Parameters for the Prediction of KPIs
Complex microscopic simulation models of strategic Air Traffic Management (ATM) performance assessment and decision-making are hindered by several factors. One of the most important is the existence of hidden parameters—such as aircraft take-off weight (TOW) and the selected cost index (CI)—which, if known, would allow for more effective performance modeling methodologies for assessing Key Performance Indicators (KPIs) at various levels of abstraction/detail, e.g., system-wide, or at the level of individual flights. This research proposes a data-driven methodology for the estimation of flights’ hidden parameters combining mechanistic and advanced Artificial Intelligence/Machine Learning (AI/ML) models. Aiming at microsimulation models, our goal is to study the effect of these estimations on the prediction of flights’ KPIs. In so doing, we propose a novel methodology according to which data-driven methods are trained given optimal trajectories (produced by mechanistic models) corresponding to known hidden parameter values, with the aim of predicting hidden parameters’ values of unseen trajectories. The results show that estimations of hidden parameters support the accurate prediction of KPIs regarding the efficiency of flights: fuel consumption, gate-to-gate time and distance flown.
- 21 June 2024
- Published by Springer Nature
- p. 360-374
Integrating LLMs in the Engineering of a SAR Ontology
- 21 June 2024
- Published by Springer Nature
- p. 360-374
Integrating LLMs in the Engineering of a SAR Ontology
- 3 June 2024
- Published by Springer Nature in Applied Intelligence
- Vol. 54 (11-12) , 7118-7134
Modelling flight trajectories with multi-modal generative adversarial imitation learning
- 3 June 2024
- Published by Springer Nature in Applied Intelligence
- Vol. 54 (11-12) , 7118-7134
Modelling flight trajectories with multi-modal generative adversarial imitation learning
- Open Access
- 28 January 2024
- Published by MDPI AG in Electronics
- Vol. 13 (3) , 526
Real-Time Semantic Data Integration and Reasoning in Life- and Time-Critical Decision Support Systems
Natural disasters such as earthquakes, floods, and forest fires involve critical situations in which human lives and infrastructures are in jeopardy. People are often injured and/or trapped without being able to be assisted by first responders on time. Moreover, in most cases, the harsh environment jeopardizes first responders by significantly increasing the difficulty of their mission. In such scenarios, time is crucial and often of vital importance. First responders must have a clear and complete view of the current situation every few seconds/minutes to efficiently and timely tackle emerging challenges, ensuring the safety of both victims and personnel. Advances in related technology including robots, drones, and Internet of Things (IoT)-enabled equipment have increased their usability and importance in life- and time-critical decision support systems such as the ones designed and developed for Search and Rescue (SAR) missions. Such systems depend on efficiency in their ability to integrate large volumes of heterogeneous and streaming data and reason with this data in (near) real time. In addition, real-time critical data integration and reasoning need to be performed on edge devices that reside near the missions, instead of using cloud infrastructure. The aim of this paper is twofold: (a) to review technologies and approaches related to real-time semantic data integration and reasoning on IoT-enabled collaborative entities and edge devices in life- and time-critical decision support systems, with a focus on systems designed for SAR missions and (b) to identify open issues and challenges focusing on the specific topic. In addition, this paper proposes a novel approach that will go beyond the state-of-the-art in efficiently recognizing time-critical high-level events, supporting commanders and first responders with meaningful and life-critical insights about the current and predicted state of the environment in which they operate.
- 28 January 2024
- Published by MDPI AG in Electronics
- Vol. 13 (3) , 526
Open AccessReal-Time Semantic Data Integration and Reasoning in Life- and Time-Critical Decision Support Systems
Natural disasters such as earthquakes, floods, and forest fires involve critical situations in which human lives and infrastructures are in jeopardy. People are often injured and/or trapped without being able to be assisted by first responders on time. Moreover, in most cases, the harsh environment jeopardizes first responders by significantly increasing the difficulty of their mission. In such scenarios, time is crucial and often of vital importance. First responders must have a clear and complete view of the current situation every few seconds/minutes to efficiently and timely tackle emerging challenges, ensuring the safety of both victims and personnel. Advances in related technology including robots, drones, and Internet of Things (IoT)-enabled equipment have increased their usability and importance in life- and time-critical decision support systems such as the ones designed and developed for Search and Rescue (SAR) missions. Such systems depend on efficiency in their ability to integrate large volumes of heterogeneous and streaming data and reason with this data in (near) real time. In addition, real-time critical data integration and reasoning need to be performed on edge devices that reside near the missions, instead of using cloud infrastructure. The aim of this paper is twofold: (a) to review technologies and approaches related to real-time semantic data integration and reasoning on IoT-enabled collaborative entities and edge devices in life- and time-critical decision support systems, with a focus on systems designed for SAR missions and (b) to identify open issues and challenges focusing on the specific topic. In addition, this paper proposes a novel approach that will go beyond the state-of-the-art in efficiently recognizing time-critical high-level events, supporting commanders and first responders with meaningful and life-critical insights about the current and predicted state of the environment in which they operate.
- Open Access
- 13 January 2024
- Published by MDPI AG in Applied Sciences
- Vol. 14 (2) , 689
SCALE-BOSS-MR: Scalable Time Series Classification Using Multiple Symbolic Representations
Time-Series-Classification (TSC) is an important machine learning task for many branches of science. Symbolic representations of time series, especially Symbolic Fourier Approximation (SFA), have been proven very effective for this task, given their abilities to reduce noise. In this paper, we improve upon SCALE-BOSS using multiple symbolic representations of time series. More specifically, the proposed SCALE-BOSS-MR incorporates into the process a variety of window sizes combined with multiple dilation parameters applied to the original and to first-order differences’ time series, with the latter modeling trend information. SCALE-BOSS-MR has been evaluated using the eight datasets with the largest training size of the UCR time series repository. The results indicate that SCALE-BOSS-MR can be instantiated to classifiers that are able to achieve state-of-the-art accuracy and can be tuned for scalability.
- 13 January 2024
- Published by MDPI AG in Applied Sciences
- Vol. 14 (2) , 689
Open AccessSCALE-BOSS-MR: Scalable Time Series Classification Using Multiple Symbolic Representations
Time-Series-Classification (TSC) is an important machine learning task for many branches of science. Symbolic representations of time series, especially Symbolic Fourier Approximation (SFA), have been proven very effective for this task, given their abilities to reduce noise. In this paper, we improve upon SCALE-BOSS using multiple symbolic representations of time series. More specifically, the proposed SCALE-BOSS-MR incorporates into the process a variety of window sizes combined with multiple dilation parameters applied to the original and to first-order differences’ time series, with the latter modeling trend information. SCALE-BOSS-MR has been evaluated using the eight datasets with the largest training size of the UCR time series repository. The results indicate that SCALE-BOSS-MR can be instantiated to classifiers that are able to achieve state-of-the-art accuracy and can be tuned for scalability.