Asma Belhadi
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Asma Belhadi has a total of 27 co-authors. Here are the top co-authors by number of shared publications:
- Youcef Djenouri
Department of Microsystems, University of South-Eastern Norway, Kongsberg, Norway
19 shared publications - Gautam Srivastava
Sogang University, Seoul, Republic of Korea
13 shared publications - Jerry Chun-Wei Lin
Silesian University of Technology
13 shared publications - Djamel Djenouri
Department of Computer Science and Creative Technologies, University of the West of England, Bristol BS16 1QY, UK
6 shared publications - Andrea Arcuri
Kristiania University of Applied Sciences, Oslo, Norway
4 shared publications - Man Zhang
State Key Laboratory of Complex & Critical Software Environment, Beihang University, China
4 shared publications
Latest Publications
- Open Access
- 13 October 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Computing for Healthcare
- Vol. 6  (4) , 1-29
EEG Data Classification: Review and Taxonomy
EEG data classification plays a pivotal role in understanding brain activity and its applications in various domains. Deep learning has emerged as a powerful paradigm for automatically learning complex patterns from raw data, eliminating the need for manual feature extraction. However, in the context of medical data, and in particular for EEG analysis, the use of deep learning approaching while having been very successful is not being included in medical diagnosis routines, yet. The aim of this survey is twofold. On one side, it provides a comprehensive overview of the current state-of-the-art in EEG data classification, with a specific focus on the use of deep learning techniques. On the other side, it also addresses the clinician community, explaining the power and trustfulness of such new approaches. The survey begins with an introduction highlighting the limitations of traditional model-based approaches and the potential of deep learning in EEG data classification. The fundamental principles and architectures of deep learning models are presented, including convolutional neural networks (CNNs), recurrent neural networks (RNNs), and graph convolution neural networks (GCNNs) that have been successfully applied to EEG data classification tasks. A detailed review and analysis of existing literature on deep learning-based EEG data classification are provided, categorizing the studies based on the type of the input data, e.g., sequences, images, graphs, or multi-modalities. We also discuss about the existing tools and technologies for EEG data classification and highlights the challenges and limitations associated with deep learning in EEG data classification, including limited data availability, interpretability of deep models, and bias mitigation. Potential solutions and ongoing research efforts to overcome these challenges are explored, providing insights into the future directions of this field. This survey serves as a valuable resource for researchers, practitioners, and healthcare professionals involved in EEG data classification. It provides an extensive understanding of the advancements, challenges, and potential applications of deep learning techniques in this domain, guiding further research and development of accurate and interpretable approaches for EEG data analysis and interpretation.
- 13 October 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Computing for Healthcare
- Vol. 6  (4) , 1-29
Open AccessEEG Data Classification: Review and Taxonomy
EEG data classification plays a pivotal role in understanding brain activity and its applications in various domains. Deep learning has emerged as a powerful paradigm for automatically learning complex patterns from raw data, eliminating the need for manual feature extraction. However, in the context of medical data, and in particular for EEG analysis, the use of deep learning approaching while having been very successful is not being included in medical diagnosis routines, yet. The aim of this survey is twofold. On one side, it provides a comprehensive overview of the current state-of-the-art in EEG data classification, with a specific focus on the use of deep learning techniques. On the other side, it also addresses the clinician community, explaining the power and trustfulness of such new approaches. The survey begins with an introduction highlighting the limitations of traditional model-based approaches and the potential of deep learning in EEG data classification. The fundamental principles and architectures of deep learning models are presented, including convolutional neural networks (CNNs), recurrent neural networks (RNNs), and graph convolution neural networks (GCNNs) that have been successfully applied to EEG data classification tasks. A detailed review and analysis of existing literature on deep learning-based EEG data classification are provided, categorizing the studies based on the type of the input data, e.g., sequences, images, graphs, or multi-modalities. We also discuss about the existing tools and technologies for EEG data classification and highlights the challenges and limitations associated with deep learning in EEG data classification, including limited data availability, interpretability of deep models, and bias mitigation. Potential solutions and ongoing research efforts to overcome these challenges are explored, providing insights into the future directions of this field. This survey serves as a valuable resource for researchers, practitioners, and healthcare professionals involved in EEG data classification. It provides an extensive understanding of the advancements, challenges, and potential applications of deep learning techniques in this domain, guiding further research and development of accurate and interpretable approaches for EEG data analysis and interpretation.
- Open Access
- 27 May 2025
- Published by Frontiers Media SA in Frontiers in Neuroscience
- Vol. 19, 1541062
Enhanced visibility graph for EEG classification
Electroencephalography (EEG) holds immense potential for decoding complex brain patterns associated with cognitive states and neurological conditions. In this paper, we propose an end-to-end framework for EEG classification that integrates power spectral density (PSD) and visibility graph (VG) features together with deep learning (DL) techniques. Our framework offers a holistic approach for capturing both frequency-domain characteristics and temporal dynamics of EEG signals. We evaluate four DL architectures, namely multilayer perceptron (MLP), long short-term memory (LSTM) networks, InceptionTime and ChronoNet, applied to several datasets and in different experimental conditions. Results demonstrate the efficacy of our framework in accurately classifying EEG data, in particular when using VG features. We also shed new light on the relative strengths and limitations of different feature extraction methods and DL architectures in the context of EEG classification. Our work contributes to advancing EEG analysis and facilitating the development of more accurate and reliable EEG-based systems for neuroscience and beyond. The full code of this research work is available on https://github.com/asmab89/VisibilityGraphs.git.
- 27 May 2025
- Published by Frontiers Media SA in Frontiers in Neuroscience
- Vol. 19, 1541062
Open AccessEnhanced visibility graph for EEG classification
Electroencephalography (EEG) holds immense potential for decoding complex brain patterns associated with cognitive states and neurological conditions. In this paper, we propose an end-to-end framework for EEG classification that integrates power spectral density (PSD) and visibility graph (VG) features together with deep learning (DL) techniques. Our framework offers a holistic approach for capturing both frequency-domain characteristics and temporal dynamics of EEG signals. We evaluate four DL architectures, namely multilayer perceptron (MLP), long short-term memory (LSTM) networks, InceptionTime and ChronoNet, applied to several datasets and in different experimental conditions. Results demonstrate the efficacy of our framework in accurately classifying EEG data, in particular when using VG features. We also shed new light on the relative strengths and limitations of different feature extraction methods and DL architectures in the context of EEG classification. Our work contributes to advancing EEG analysis and facilitating the development of more accurate and reliable EEG-based systems for neuroscience and beyond. The full code of this research work is available on https://github.com/asmab89/VisibilityGraphs.git.
- 12 May 2025
- Published by Springer Nature
- p. 18-34
Neurosymbolic Visual Transform Based on Logic Tensor Network for Defect Detection
- 12 May 2025
- Published by Springer Nature
- p. 18-34
Neurosymbolic Visual Transform Based on Logic Tensor Network for Defect Detection
- Open Access
- 8 May 2024
- Published by Springer Nature in Cognitive Computation
- Vol. 16  (5) , 2551-2565
Federated Constrastive Learning and Visual Transformers for Personal Recommendation
This paper introduces a novel solution for personal recommendation in consumer electronic applications. It addresses, on the one hand, the data confidentiality during the training, by exploring federated learning and trusted authority mechanisms. On the other hand, it deals with data quantity, and quality by exploring both transformers and consumer clustering. The process starts by clustering the consumers into similar clusters using contrastive learning and k-means algorithm. The local model of each consumer is trained on the local data. The local models of the consumers with the clustering information are then sent to the server, where integrity verification is performed by a trusted authority. Instead of traditional federated learning solutions, two kinds of aggregation are performed. The first one is the aggregation of all models of the consumers to derive the global model. The second one is the aggregation of the models of each cluster to derive a local model of similar consumers. Both models are sent to the consumers, where each consumer decides which appropriate model might be used for personal recommendation. Robust experiments have been carried out to demonstrate the applicability of the method using MovieLens-1M, and Amazon-book. The results reveal the superiority of the proposed method compared to the baseline methods, where it reaches an average accuracy of 0.27, against the other methods that do not exceed 0.25.
- 8 May 2024
- Published by Springer Nature in Cognitive Computation
- Vol. 16  (5) , 2551-2565
Open AccessFederated Constrastive Learning and Visual Transformers for Personal Recommendation
This paper introduces a novel solution for personal recommendation in consumer electronic applications. It addresses, on the one hand, the data confidentiality during the training, by exploring federated learning and trusted authority mechanisms. On the other hand, it deals with data quantity, and quality by exploring both transformers and consumer clustering. The process starts by clustering the consumers into similar clusters using contrastive learning and k-means algorithm. The local model of each consumer is trained on the local data. The local models of the consumers with the clustering information are then sent to the server, where integrity verification is performed by a trusted authority. Instead of traditional federated learning solutions, two kinds of aggregation are performed. The first one is the aggregation of all models of the consumers to derive the global model. The second one is the aggregation of the models of each cluster to derive a local model of similar consumers. Both models are sent to the consumers, where each consumer decides which appropriate model might be used for personal recommendation. Robust experiments have been carried out to demonstrate the applicability of the method using MovieLens-1M, and Amazon-book. The results reveal the superiority of the proposed method compared to the baseline methods, where it reaches an average accuracy of 0.27, against the other methods that do not exceed 0.25.
- Open Access
- 5 April 2024
- Published by Elsevier in Engineering Applications of Artificial Intelligence
- Vol. 133
Enhancing smart road safety with federated learning for Near Crash Detection to advance the development of the Internet of Vehicles
- 5 April 2024
- Published by Elsevier in Engineering Applications of Artificial Intelligence
- Vol. 133
Open AccessEnhancing smart road safety with federated learning for Near Crash Detection to advance the development of the Internet of Vehicles
- Open Access
- 5 January 2024
- Published by Association for Computing Machinery (ACM) in ACM Transactions on the Web
- Vol. 18  (1) , 1-41
Random Testing and Evolutionary Testing for Fuzzing GraphQL APIs
The Graph Query Language (GraphQL) is a powerful language for application programming interface (API) manipulation in web services. It has been recently introduced as an alternative solution for addressing the limitations of RESTful APIs. This article introduces an automated solution for GraphQL API testing. We present a full framework for automated API testing, from the schema extraction to test case generation. In addition, we consider two kinds of testing: white-box and black-box testing. The white-box testing is performed when the source code of the GraphQL API is available. Our approach is based on evolutionary search. Test cases are evolved to intelligently explore the solution space while maximizing code coverage and fault-finding criteria. The black-box testing does not require access to the source code of the GraphQL API. It is therefore of more general applicability, albeit it has worse performance. In this context, we use a random search to generate GraphQL data. The proposed framework is implemented and integrated into the open source EvoMaster tool. With enabled white-box heuristics (i.e., white-box mode), experiments on 7 open source GraphQL APIs and three search algorithms show statistically significant improvement of the evolutionary approach compared to the baseline random search. In addition, experiments on 31 online GraphQL APIs reveal the ability of the black-box mode to detect real faults.
- 5 January 2024
- Published by Association for Computing Machinery (ACM) in ACM Transactions on the Web
- Vol. 18  (1) , 1-41
Open AccessRandom Testing and Evolutionary Testing for Fuzzing GraphQL APIs
The Graph Query Language (GraphQL) is a powerful language for application programming interface (API) manipulation in web services. It has been recently introduced as an alternative solution for addressing the limitations of RESTful APIs. This article introduces an automated solution for GraphQL API testing. We present a full framework for automated API testing, from the schema extraction to test case generation. In addition, we consider two kinds of testing: white-box and black-box testing. The white-box testing is performed when the source code of the GraphQL API is available. Our approach is based on evolutionary search. Test cases are evolved to intelligently explore the solution space while maximizing code coverage and fault-finding criteria. The black-box testing does not require access to the source code of the GraphQL API. It is therefore of more general applicability, albeit it has worse performance. In this context, we use a random search to generate GraphQL data. The proposed framework is implemented and integrated into the open source EvoMaster tool. With enabled white-box heuristics (i.e., white-box mode), experiments on 7 open source GraphQL APIs and three search algorithms show statistically significant improvement of the evolutionary approach compared to the baseline random search. In addition, experiments on 31 online GraphQL APIs reveal the ability of the black-box mode to detect real faults.
- 12 December 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computational Social Systems
- Vol. 11  (3) , 3966-3977
Social Web in IoT: Can Evolutionary Computation and Clustering Improve Ontology Matching for Social Web of Things?
Many Internet of Things (IoT) applications can benefit from Social Web of Things (S-WoT) methods that enable knowledge discovery and help solving interoperability problems. The semantic modeling of S-WoT is the main emphasis of this work where we suggest a novel solution, evolutionary clustering for ontology matching (ECOM), to explore correlations between S-WoT data using clustering and evolutionary computation methodologies. The ECOM approach uses a variety of clustering techniques to aggregate S-WoT data’s strongly related ontologies into comparable categories. The principle is to match concepts of similar groups rather than full concepts of two ontologies, which necessitates splitting examples of each ontology into similar groups. We design two clustering algorithms for ontology matching using conventional methods, as well as sophisticated clustering techniques. Moreover, we develop an intelligent matching algorithm that uses evolutionary computation to quickly converge to (or ideally identify) optimal matches. Numerous simulations have been conducted using various ontology databases to demonstrate the application and precision of ECOM. Our findings clearly show that ECOM has better results when compared to cutting-edge ontology matching methods. The F-measure of ECOM exceeds 95% whereas it does not reach 90% for all baseline methods. The results also confirm that ECOM scales with big data in S-WoT environments.
- 12 December 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computational Social Systems
- Vol. 11  (3) , 3966-3977
Social Web in IoT: Can Evolutionary Computation and Clustering Improve Ontology Matching for Social Web of Things?
Many Internet of Things (IoT) applications can benefit from Social Web of Things (S-WoT) methods that enable knowledge discovery and help solving interoperability problems. The semantic modeling of S-WoT is the main emphasis of this work where we suggest a novel solution, evolutionary clustering for ontology matching (ECOM), to explore correlations between S-WoT data using clustering and evolutionary computation methodologies. The ECOM approach uses a variety of clustering techniques to aggregate S-WoT data’s strongly related ontologies into comparable categories. The principle is to match concepts of similar groups rather than full concepts of two ontologies, which necessitates splitting examples of each ontology into similar groups. We design two clustering algorithms for ontology matching using conventional methods, as well as sophisticated clustering techniques. Moreover, we develop an intelligent matching algorithm that uses evolutionary computation to quickly converge to (or ideally identify) optimal matches. Numerous simulations have been conducted using various ontology databases to demonstrate the application and precision of ECOM. Our findings clearly show that ECOM has better results when compared to cutting-edge ontology matching methods. The F-measure of ECOM exceeds 95% whereas it does not reach 90% for all baseline methods. The results also confirm that ECOM scales with big data in S-WoT environments.
- Open Access
- 28 September 2023
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Software Engineering and Methodology
- Vol. 32  (6) , 1-29
JavaScript SBST Heuristics to Enable Effective Fuzzing of NodeJS Web APIs
JavaScript is one of the most popular programming languages. However, its dynamic nature poses several challenges to automated testing techniques. In this paper, we propose an approach and open-source tool support to enable white-box testing of JavaScript applications using Search-Based Software Testing (SBST) techniques. We provide an automated approach to collect search-based heuristics like the common Branch Distance and to enable Testability Transformations . To empirically evaluate our results, we integrated our technique into the EvoMaster test generation tool, and carried out analyses on the automated system testing of RESTful and GraphQL APIs. Experiments on eight Web APIs running on NodeJS show that our technique leads to significantly better results than existing black-box and grey-box testing tools, in terms of code coverage and fault detection.
- 28 September 2023
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Software Engineering and Methodology
- Vol. 32  (6) , 1-29
Open AccessJavaScript SBST Heuristics to Enable Effective Fuzzing of NodeJS Web APIs
JavaScript is one of the most popular programming languages. However, its dynamic nature poses several challenges to automated testing techniques. In this paper, we propose an approach and open-source tool support to enable white-box testing of JavaScript applications using Search-Based Software Testing (SBST) techniques. We provide an automated approach to collect search-based heuristics like the common Branch Distance and to enable Testability Transformations . To empirically evaluate our results, we integrated our technique into the EvoMaster test generation tool, and carried out analyses on the automated system testing of RESTful and GraphQL APIs. Experiments on eight Web APIs running on NodeJS show that our technique leads to significantly better results than existing black-box and grey-box testing tools, in terms of code coverage and fault detection.
- Open Access
- 9 May 2023
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Asian and Low-Resource Language Information Processing
- Vol. 22  (5) , 1-19
Fast and Accurate Framework for Ontology Matching in Web of Things
The Web of Things (WoT) can help with knowledge discovery and interoperability issues in many Internet of Things (IoT) applications. This article focuses on semantic modeling of WoT and proposes a new approach called Decomposition for Ontology Matching (DOM) to discover relevant knowledge by exploring correlations between WoT data using decomposition strategies. The DOM technique adopts several decomposition techniques to order highly linked ontologies of WoT data into similar groups. The main idea is to decompose the instances of each ontology into similar groups and then match instances of similar groups instead of entire instances of two ontologies. Three main algorithms for decomposition have been developed. The first algorithm is based on radar scanning, which determines the distribution of distances between each instance and all other instances to determine the cluster centroid. The second algorithm is based on adaptive grid clustering, where it focuses on distribution information and the construction of spanning trees. The third algorithm is based on split index clustering, where instances are divided into groups of cells from which noise is removed during the merging process. Several studies were conducted with different ontology databases to illustrate the use of the DOM technique. The results show that DOM outperforms state-of-the-art ontology matching models in terms of computational cost while maintaining the quality of the matching. Moreover, these results demonstrate that DOM is capable of handling various large datasets in WoT contexts.
- 9 May 2023
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Asian and Low-Resource Language Information Processing
- Vol. 22  (5) , 1-19
Open AccessFast and Accurate Framework for Ontology Matching in Web of Things
The Web of Things (WoT) can help with knowledge discovery and interoperability issues in many Internet of Things (IoT) applications. This article focuses on semantic modeling of WoT and proposes a new approach called Decomposition for Ontology Matching (DOM) to discover relevant knowledge by exploring correlations between WoT data using decomposition strategies. The DOM technique adopts several decomposition techniques to order highly linked ontologies of WoT data into similar groups. The main idea is to decompose the instances of each ontology into similar groups and then match instances of similar groups instead of entire instances of two ontologies. Three main algorithms for decomposition have been developed. The first algorithm is based on radar scanning, which determines the distribution of distances between each instance and all other instances to determine the cluster centroid. The second algorithm is based on adaptive grid clustering, where it focuses on distribution information and the construction of spanning trees. The third algorithm is based on split index clustering, where instances are divided into groups of cells from which noise is removed during the merging process. Several studies were conducted with different ontology databases to illustrate the use of the DOM technique. The results show that DOM outperforms state-of-the-art ontology matching models in terms of computational cost while maintaining the quality of the matching. Moreover, these results demonstrate that DOM is capable of handling various large datasets in WoT contexts.
- Open Access
- 6 March 2023
- Published by Springer Nature in Software Quality Journal
- Vol. 31  (3) , 947-990
Building an open-source system test generation tool: lessons learned and empirical analyses with EvoMaster
Research in software testing often involves the development of software prototypes. Like any piece of software, there are challenges in the development, use and verification of such tools. However, some challenges are rather specific to this problem domain. For example, often these tools are developed by PhD students straight out of bachelor/master degrees, possibly lacking any industrial experience in software development. Prototype tools are used to carry out empirical studies, possibly studying different parameters of novel designed algorithms. Software scaffolding is needed to run large sets of experiments efficiently. Furthermore, when using AI-based techniques like evolutionary algorithms, care needs to be taken to deal with their randomness, which further complicates their verification. The aforementioned represent some of the challenges we have identified for this domain. In this paper, we report on our experience in building the open-source EvoMaster tool, which aims at system-level test case generation for enterprise applications. Many of the challenges we faced would be common to any researcher needing to build software testing tool prototypes. Therefore, one goal is that our shared experience here will boost the research community, by providing concrete solutions to many development challenges in the building of such kind of research prototypes. Ultimately, this will lead to increase the impact of scientific research on industrial practice.
- 6 March 2023
- Published by Springer Nature in Software Quality Journal
- Vol. 31  (3) , 947-990
Open AccessBuilding an open-source system test generation tool: lessons learned and empirical analyses with EvoMaster
Research in software testing often involves the development of software prototypes. Like any piece of software, there are challenges in the development, use and verification of such tools. However, some challenges are rather specific to this problem domain. For example, often these tools are developed by PhD students straight out of bachelor/master degrees, possibly lacking any industrial experience in software development. Prototype tools are used to carry out empirical studies, possibly studying different parameters of novel designed algorithms. Software scaffolding is needed to run large sets of experiments efficiently. Furthermore, when using AI-based techniques like evolutionary algorithms, care needs to be taken to deal with their randomness, which further complicates their verification. The aforementioned represent some of the challenges we have identified for this domain. In this paper, we report on our experience in building the open-source EvoMaster tool, which aims at system-level test case generation for enterprise applications. Many of the challenges we faced would be common to any researcher needing to build software testing tool prototypes. Therefore, one goal is that our shared experience here will boost the research community, by providing concrete solutions to many development challenges in the building of such kind of research prototypes. Ultimately, this will lead to increase the impact of scientific research on industrial practice.