Schizophrenia is a complex neuropsychiatric disorder that affects cognitive function and brain activity. Electroencephalography (EEG) has emerged as a valuable tool for detecting schizophrenia-related neural patterns, but accurate classification remains a challenge due to the intricate nature of EEG signals. In this study, we propose a Hybrid Visibility Graph and Long Short-Term Memory (VG-LSTM) framework for schizophrenia detection. Our approach transforms EEG time series into graph structures using visibility graphs (VGs) to capture the underlying topological properties of brain activity. We then employ LSTM networks to model sequential dependencies, effectively integrating both structural and sequential information for robust classification. Experimental results on publicly available schizophrenia EEG datasets demonstrate that our VG-LSTM framework achieves superior performance compared to conventional deep learning approaches. The results highlight the potential of combining graph-theoretic and deep sequential modeling techniques for EEG-based neuropsychiatric disorder detection. The full code of this research work is available on https://github.com/YousIA/VG-LSTM.

In recent years, there has been growing interest in applying deep learning techniques for visual anomaly detection, particularly in the manufacturing sector. Various models have been developed to identify defects in manufacturing data, yet selecting and optimizing these models for anomaly detection in intelligent manufacturing environments remains a significant challenge. This research focuses on general-purpose visual anomaly detection, aiming to reduce dependence on domain-specific knowledge and create flexible, generic models. We propose a novel deep learning framework in which multiple models are trained for each image. The visual features and loss values from these models are computed and stored during training. During the testing phase, this stored information is used to select the most appropriate model for each new image using a k-Nearest Neighbors (kNN) approach. The proposed method, KGDL-VAD (Knowledge-Guided Deep Learning for Visual Anomaly Detection), was evaluated on the MVTec AD, and standard aerospace defect detection datasets, achieving an area under the curve (AUC) score of 0.96, outperforming baseline methods. In addition, KGDL-VAD surpasses ensemble learning approaches across multiple domain-independent datasets with varying numbers of trained classes.

This paper targets a new foundation for designing general-purpose learning systems, by establishing a consensus method that facilitates self-adaptation and flexibility to deal with different learning tasks and different data distribution. We present the Shapely Consensus Deep Learning (SCDL) as a consensus method for general-purpose solutions that do not require the help of domain experts. SCDL is two-level based learning process. In the first level, several deep learning models are trained and the Shapley Value is used to determine the contribution of each subset of models in the training. The models are pruned according to their contribution in the learning process. In the second level, the loss information of each data distribution is saved in the knowledge base. Both levels are explored to prune the models for each new observation. We present the evaluation of the generality of SCDL using different datasets with different shapes, and complexities. The results reveal the effectiveness of SCDL for weakly classification. Concretely, SCDL achieved 90% of AUC with less than 86% for the baseline solutions.

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.

As the metaverse grows in popularity and complexity, securing its virtual environment is critical. Metaverse intrusion detection involves identifying and preventing unauthorized access, malicious activities, and potential threats. To address these challenges, we propose a novel Metaverse intrusion detection system (MIDS) that combines generative adversarial networks (GAN) and Transformer-based classifiers. The system operates in three stages: 1) generating diverse and realistic network traffic using GAN; 2) detecting intrusions with a Transformer-based classifier; and 3) ensuring data privacy through federated learning and a trusted authority mechanism. Unlike traditional methods, our approach employs dual aggregation, generating both global and local models tailored to users’ needs. Tested on public datasets, the method achieves state-of-the-art performance with an F1-score of 0.9984, demonstrating its effectiveness in generating realistic training data and improving MIDS performance. This approach can extend to other security domains requiring diverse data for training.

We present a novel approach for addressing computer vision tasks in intelligent transportation systems, with a strong focus on data security during training through federated learning. Our method leverages visual transformers, training multiple models for each image. By calculating and storing visual image features as well as loss values, we propose a novel Shapley value model based on model performance consistency to select the most appropriate models during testing. To enhance security, we introduce an intelligent federated learning strategy, where users are grouped into clusters based on constrastive clustering for creating a global model as well as customized local models. Users receive both global as well as local models, enabling tailored computer vision applications. We evaluated KGVT-ITS (Knowledge Guided Visual Transformers for Intelligent Transportation Systems) on various ITS challenges, including pedestrian detection, abnormal event detection, as well as near-crash detection. The results demonstrate the superiority of KGVT-ITS over baseline solutions, showcasing its effectiveness and robustness in intelligent transportation scenarios. More particularly, KGVT-ITS achieves significant improvements of about 8% against the existing ITS methods.

We introduce an innovative methodology for the identification of vehicular collisions within Internet of Vehicles (IoV) applications. This approach combines a knowledge base system with deep learning for model selection in an ensemble learning setting. It is designed to provide a general near-crash detection capability without relying on domain-specific knowledge, enabling the development of generic deep learning models. Our proposed methodology employs a novel deep learning approach, wherein multiple learning models are individually trained for each image. Subsequently, visual features are computed and stored for each trained image, along with the associated loss values from the training phase. This stored information is utilized to select the most suitable models for processing new image data during the testing phase. To facilitate efficient model selection, we employ a kNN (k Nearest Neighbors) strategy. To enhance both data and model security in IoV environments, we implement an intelligent federated learning (FL) strategy. Users are organized into clusters, and we employ two distinct aggregation methods, departing from conventional federated learning approaches. In the initial stage, we aggregate model data from all users to create a global model representing collective knowledge. In the subsequent stage, we aggregate models from each cluster to generate customized local models. Users are provided with both global and local models, allowing them to select the most suitable model for their specific crash detection needs. We test our approach, that we call Knowledge Guided Deep Learning for Near Crash Detection (KGDL-NCD), on well-known NCD benchmarks. The results demonstrate that KGDL-NCD surpasses baseline solutions, achieving an AUC (Area Under Curve) metric of 0.95.

Abstract In this paper, we present a novel paradigm for disease detection. We build an artificial intelligence based system where various biomedical data are retrieved from distributed and homogeneous sensors. We use different deep learning architectures (VGG16, RESNET, and DenseNet) with ensemble learning and attention mechanisms to study the interactions between different biomedical data to detect and diagnose diseases. We conduct extensive testing on biomedical data. The results show the benefits of using deep learning technologies in the field of artificial intelligence of medical things to diagnose diseases in the healthcare decision‐making process. For example, the disease detection rate using the proposed methodology achieves 92%, which is greatly improved compared to the higher‐level disease detection models.

In this paper, a new generic parallel pattern mining framework called multi-objective Decomposition for Parallel Pattern-Mining (MD-PPM) is developed to solve challenges in the Internet of Medical Things through big data exploration. MD-PPM discovers important patterns by using decomposition and parallel mining methods to explore connectivity between medical data. First, a new technique, the multi-objective k-means algorithm, is used to aggregate medical data. A parallel pattern mining approach based on GPU and MapReduce architectures is also used to create useful patterns. To ensure complete privacy and security of the medical data, blockchain technology has been integrated throughout the system. Several tests were conducted to demonstrate the high performance of two sequential and graph pattern mining problems on large medical data and to evaluate the developed MD-PPM framework. From our results, our proposed MD-PPM has achieved strong results in terms of memory usage and computation time in terms of efficiency. Moreover, MD-PPM performs well in terms of accuracy and feasibility compared to existing models.

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.

This article proposes the use of deep learning in human-computer interaction and presents a new explainable hybrid framework for recommending relevant hashtags on a set of orpheline tweets, which are tweets with hashtags. The approach starts by determining the set of batches used in the convolution neural network based on frequent pattern mining solutions. The convolutional neural network is then applied to the set of batches of tweets to learn the hashtags of the tweets. An optimization strategy has been proposed to accurately perform the learning process by reducing the number of frequent patterns. Moreover, eXplainable AI is introduced for hashtag recommendations by analyzing the user preferences and understanding the different weights of the deep learning model used in the learning process. This is performed by learning the hyper-parameters of the deep architecture using the genetic algorithm. GPU computing is also investigated to achieve high speed and enable the execution of the overall framework in real time. Extensive experimental analysis has been performed to show that our methodology is useful on different collections of tweets. The experimental results clearly show the efficiency of our proposed approach compared to baseline approaches in terms of both runtime and accuracy. Thus, the proposed solution achieves an accuracy of 90% when analyzing complex Wikipedia data while the other algorithms did not achieve 85% when processing the same amount of data.

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.

Web Services like REST, GraphQL and RPC APIs are widely used in industry. They form the backends of modern Cloud Applications. In recent years, there has been an increase interest in the research community about fuzzing web services. However, there is no clear, common benchmark in the literature that can be used for comparing techniques and ease experimentation. Even if nowadays it is not so difficult to find web services on open-source repositories such as GitHub, quite a bit of work might be required to setup databases and authentication information (e.g., hashed passwords). Furthermore, how to start and stop the applications might vary greatly among the different frameworks (e.g., Spring and DropWizard) used to implement such services. For all these reasons, since 2017 we have created and maintained a corpus of web services called EMB, together with all the tooling and configurations needed to run software testing experiments. Originally, EMB was created for evaluating the fuzzer EvoMaster, but it can be (and has been) used by other tools/researchers as well. This paper discusses how EMB is designed and how its libraries can be used to run experiments on these APIs. An introductory video for EMB can be currently accessed at https://youtu.be/wJs34ATgLEw

This paper presents a new framework for intrusion detection in the next-generation Internet of Things. MinMax normalization strategy is used to collect and preprocess data. The Marine Predator algorithm is then used to select relevant features to be used in the learning process. The selected features are then trained with an advanced and state-of-the-art recurrent neural network that includes an attention mechanism. Finally, Shapely values are calculated to determine how much each feature contributes to the final output. The dataset NSL-KDD was used for intensive simulations. The results show the advantages of the proposed system as well as its superiority over state-of-the-art methods. In fact, the proposed solution achieved a rate of more than 94% for both true negative and true position, while the rates of the existing solutions are below 90% for the challenging NSL-KDD datasets.

In this study, we combine graph optimization and prediction in a single pipeline to investigate an innovative convolutional graph-based neural network for urban traffic flow prediction in an edge IoT environment. Pre-processing of the linked graph is first performed to remove noise from the set of original road networks of urban traffic data. Outlier detection strategy is used to efficiently explore the road network and remove irrelevant patterns and noise. The resulting graph is then implemented to train an extended graph convolutional neural network to estimate the traffic flow in the city. To accurately tune the hyperparameter values of the proposed framework, a new optimization technique is developed based on branch and bound. For comparison, an intensive evaluation is conducted with multiple datasets and baseline methods. The results show that the proposed framework outperforms the baseline solutions, especially when the number of nodes in the graph is large.

This article introduced a new deep learning framework for fault diagnosis in electrical power systems. The framework integrates the convolution neural network and different regression models to visually identify which faults have occurred in electric power systems. The approach includes three main steps: 1) data preparation; 2) object detection; and 3) hyperparameter optimization. Inspired by deep learning and evolutionary computation (EC) techniques, different strategies have been proposed in each step of the process. In addition, we propose a new hyperparameters optimization model based on EC that can be used to tune parameters of our deep learning framework. In the validation of the framework’s usefulness, experimental evaluation is executed using the well known and challenging VOC 2012, the COCO data sets, and the large NESTA 162-bus system. The results show that our proposed approach significantly outperforms most of the existing solutions in terms of runtime and accuracy.

This research presents a new generic deep learning (DL) framework for anomaly detection in the Internet of Everything (IoE). It combines decomposition methods, deep neural networks, and evolutionary computation to better detect outliers in IoE environments. The data set is first decomposed into clusters, while similar observations in the same cluster are grouped. Five clustering algorithms were used for this purpose. The generated clusters are then trained using DL architectures. In this context, we propose a new recurrent neural network for training time-series data. Two evolutionary computational algorithms are also proposed: 1) the genetic and 2) the bee swarm, to fine-tune the training step. These algorithms consider the hyperparameters of the trained models and try to find the optimal values. The proposed solutions have been experimentally evaluated for two use cases: 1) road traffic outlier detection and 2) network intrusion detection. The results show the advantages of the proposed solutions and a clear superiority compared to state-of-the-art approaches.

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.

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.

Decomposition MapReduce mining for fake news analysis (DMRM-FNA), a novel generic parallel pattern-mining framework, is developed in this article to solve difficulties in social network analysis using big data exploration. The first difficulty faced by existing techniques is the inability to retrieve actionable insights into the structure of fake news data. This can be solved by extracting patterns from fake news and matching them with real news data. The second difficulty is the computational time of existing pattern-mining solutions. This might be solved by combining both decomposition and MapReduce mining techniques to extract relevant patterns from fake news data. The multiobjective${k}$-means algorithm is used to first aggregate fake news data. To generate useful patterns, a parallel pattern-mining method based on MapReduce structures is applied. To evaluate the created DMRM-FNA framework (DFAST) and demonstrate the high performance of sequential pattern-mining challenges on massive social network data, several tests were conducted. Our results show that the proposed DMRM-FNA performs well in terms of memory usage and efficiency. Moreover, DMRM-FNA outperforms existing models in terms of accuracy and feasibility.

This paper introduces a novel deep learning architecture for identifying outliers in the context of intelligent transportation systems. The use of a convolutional neural network with decomposition is explored to find abnormal behavior in maritime data. The set of maritime data is first decomposed into similar clusters containing homogeneous data, and then a convolutional neural network is used for each data cluster. Different models are trained (one per cluster), and each model is learned from highly correlated data. Finally, the results of the models are merged using a simple but efficient fusion strategy. To verify the performance of the proposed framework, intensive experiments were conducted on marine data. The results show the superiority of the proposed framework compared to the baseline solutions in terms of several accuracy metrics.

Significant efforts have been made for vehicle-to-vehicle communications that now enable the Internet of Vehicles (IoV). However, current IoV solutions are unable to capture traffic data both accurately and securely. Another drawback of current IoV models that are based on deep learning is that the methods used do not tune hyperparameters efficiently. In this paper, a new system known as Secure and Intelligent System for the Internet of Vehicles (SISIV) is developed. A deep learning architecture based on graph convolutional networks and an attention mechanism are implemented. In addition, blockchain technology is used to protect data transmission between nodes in the IoV system. Moreover, the hyperparameters of the generated deep learning model are intelligently selected using a branch-and-bound technique. To validate SISIV, experiments were conducted on four networked vehicle databases dealing with prediction problems. In terms of forecasting rate ($>$90%), F-measure ($>$80%), and attack detection (< 75%), the results clearly show the superiority of SISIV over baseline systems. Moreover, compared to state-of-the-art solutions based on traffic prediction, SISIV enables efficient and reliable prediction of traffic flow in an IoV context.

This paper presents a novel intelligent system based on graph convolutional neural networks to study road crack detection in intelligent transportation systems. The visual features of the input images are first computed using the well-known Scale-Invariant Feature Transform (SIFT) extraction algorithm. Then, a correlation between SIFT features of similar images is analyzed and a series of graphs are generated. The graphs are trained on a graph convolutional neural network, and a hyper-optimization algorithm is developed to supervise the training process. A case study of road crack detection data is analyzed. The results show a clear superiority of the proposed framework over state-of-the-art solutions. In fact, the precision of the proposed solution exceeds 70%, while the precision of the baseline methods does not exceed 60%.

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.

In recent years, intensive research has been conducted to enable people to live more comfortably. Developments in the Internet of Things (IoT) , big data, and artificial intelligence have taken this type of research to a new level and led to the emergence of the Internet of Behaviors (IoB) , which analyzes behavioral patterns. However, current IoB technologies are not capable of handling heterogeneous data. While it is quite common to have different formats of sensor data for the same behavioral observation, the use of these different data formats can significantly help to obtain a more accurate classification of the observation. Another limitation is that existing IoB deep learning models rely on inefficient hyperparameter tuning strategies. In this paper, we present an Advanced Deep Learning framework for IoB (ADLIoB) applied to connected vehicles. Several deep learning architectures are employed in this framework: CNN, Graph CNN (GCNN), and LSTM are used to train sensor data of different formats. In addition, a branch-and-bound technique is used to intelligently select hyperparameters. To validate ADLIoB, experiments were conducted on four databases for connected vehicles. The results clearly show that ADLIoB is superior to the baseline solutions in terms of both accuracy and runtime.

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 techniques. We provide an automated approach to collect search-based heuristics like the common Branch Distance. 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 APIs. Experiments on 5 NodeJS APIs 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.

This paper presents a novel deep learning architecture for identifying outliers in the context of intelligent transportation systems. The use of a convolutional neural network with an efficient decomposition strategy is explored to find the anomalous behavior of urban traffic flow data. The urban traffic flow data set is decomposed into similar clusters, each containing homogeneous data. The convolutional neural network is used for each data cluster. In this way, different models are trained, each learned from highly correlated data. A merging strategy is finally used to fuse the results of the obtained models. To validate the performance of the proposed framework, intensive experiments were conducted on urban traffic flow data. The results show that our system outperforms the competition on several accuracy criteria.

The integration of 5G and Beyond 5G (B5G)/6G in Machine-to-Machine (M2M) communications, is making Industry 4.0 smarter. However, the goal of having a sustainable self-monitored industry has not been reached yet. State-of-the-art deep learning-based Fault Detection algorithms cannot handle heterogeneous data, meaning that more than one fault detection computational device has to be used for each data format, in addition to the inability to take advantage of the combination of all the information available in different formats to derive more accurate conclusions. Moreover, these algorithms rely on inefficient hyper-parameters tuning strategies. In this paper, we propose an Advanced Deep Learning framework for Fault Diagnosis in Industry 4.0 (ADL-FDI4), which combines Long Short Term Memory (LSTM), Convolutional Neural Networks (CNN) and graph CNN (GNN), to handle heterogeneous data. Furthermore, our novel framework uses a Branch-and-Bound procedure to guide the learning process. Our experimental results show that ADL-FDI4 outperforms the state-of-the-art solutions in terms of detection rate and running time, and for that, it consumes less energy. In addition to handling heterogeneous data, which implies that one computational device is sufficient to handle all data formats.

Abstract This paper investigates the automated medical learning and proposes hybrid intelligent framework, called Hybrid Automated Medical Learning (HAML). The goal is the efficient combination of several intelligent components in order to automatically learn the medical data. Multi agents system is proposed by using distributed deep learning, and knowledge graph for learning medical data. The distributed deep learning is used for efficient learning of the different agents in the system, where the knowledge graph is used for dealing with heterogeneous medical data. To demonstrate the usefulness and accuracy of the HAML framework, intensive simulations on medical data were conducted. A wide range of experiments were conducted to verify the efficiency of the proposed system. Three case studies are discussed in this research, the first case study is related to process mining, and more precisely on the ability of HAML to detect relevant patterns from event medical data. The second case study is related to smart building, and the ability of HAML to recognize the different activities of the patients. The third one is related to medical image retrieval, and the ability of HAML to find the most relevant medical images according to the image query. The results show that the developed HAML achieves good performance compared to the most up‐to‐date medical learning models regarding both the computational and cost the quality of returned solutions.

Abstract The emergence of smart sensors, artificial intelligence, and deep learning technologies yield artificial intelligence of things, also known as the AIoT. Sophisticated cooperation of these technologies is vital for the effective processing of industrial sensor data. This paper introduces a new framework for addressing the different challenges of the AIoT applications. The proposed framework is an intelligent combination of multi‐agent systems, knowledge graphs and deep learning. Deep learning architectures are used to create models from different sensor‐based data. Multi‐agent systems can be used for simulating the collective behaviours of the smart sensors using IoT settings. The communication among different agents is realized by integrating knowledge graphs. Different optimizations based on constraint satisfaction as well as evolutionary computation are also investigated. Experimental analysis is undertaken to compare the methodology presented to state‐of‐the‐art AIoT technologies. We show through experimentation that our designed framework achieves good performance compared to baseline solutions.

This work aims to provide a novel hybrid architecture to suggest appropriate hashtags to a collection of orpheline tweets. The methodology starts with defining the collection of batches used in the convolutional neural network. This methodology is based on frequent pattern extraction methods. The hashtags of the tweets are then learned using the convolution neural network that was applied to the collection of batches of tweets. In addition, a pruning approach should ensure that the learning process proceeds properly by reducing the number of common patterns. Besides, the evolutionary algorithm is involved to extract the optimal parameters of the deep learning model used in the learning process. This is achieved by using a genetic algorithm that learns the hyper-parameters of the deep architecture. The effectiveness of our methodology has been demonstrated in a series of detailed experiments on a set of Twitter archives. From the results of the experiments, it is clear that the proposed method is superior to the baseline methods in terms of efficiency.

This paper explores the vehicle detection problem and introduces an improved regional convolution neural network. The vehicle data (set of images) is first collected, from which the noise (set of outlier images) is removed using the SIFT extractor. The region convolution neural network is then used to detect the vehicles. We propose a new hyper-parameters optimization model based on evolutionary computation that can be used to tune parameters of the deep learning framework. The proposed solution was tested using the well-known boxy vehicle detection data, which contains more than 200,000 vehicle images and 1,990,000 annotated vehicles. The results are very promising and show superiority over many current state-of-the-art solutions in terms of runtime and accuracy performances.

This research investigates hashtag suggestions in a heterogeneous and huge social network, as well as a cognitive-based deep learning solution based on distributed knowledge graphs. Community detection is first performed to find the connected communities in a vast and heterogeneous social network. The knowledge graph is subsequently generated for each discovered community, with an emphasis on expressing the semantic relationships among the Twitter platform’s user communities. Each community is trained with the embedded deep learning model. To recommend hashtags for the new user in the social network, the correlation between the tweets of such user and the knowledge graph of each community is explored to set the relevant communities of such user. The models of the relevant communities are used to infer the hashtags of the tweets of such users. We conducted extensive testing to demonstrate the usefulness of our methods on a variety of tweet collections. Experimental results show that the proposed approach is more efficient than the baseline approaches in terms of both runtime and accuracy.

This article introduces a new model to identify a group of trajectory outliers from a large trajectory database and proposes several algorithms. These can be split into three categories: 1) algorithms based on data mining and knowledge discovery, which study the different correlations among the trajectory data and identify the group of abnormal trajectories from the knowledge extracted; 2) algorithms based on machine learning and computational intelligence methods, which use the ensemble learning and metaheuristics to find the group of trajectory outliers; and 3) an algorithm exploring the convolution deep neural network that learns the different features of historical data to determine the group of trajectory outliers. Experiments on different trajectory databases have been carried out to investigate the proposed algorithms. The results show that the deep learning solution outperforms data mining, machine learning, and computational intelligence solutions, as well as state-of-the-art solutions in terms of runtime and accuracy performance.

Augmented reality is currently of interest in biomedical health informatics. At the same time, several challenges have appeared, in particular with the rapid progress of smart sensor technologies, and medical artificial intelligence. This yields the necessity of new needs in biomedical health informatics. Collaborative learning and privacy are just some of the challenges of augmented reality technology in biomedical health informatics. This paper introduces a novel secure collaborative augmented reality framework for biomedical health informatics-based applications. Distributed deep learning is performed across a multi-agent system platform. The privacy strategy is then developed for ensuring better communications of the different intelligent agents in the system. In this research work, a system of multiple agents is created for the simulation of the collective behaviours of the smart components of biomedical health informatics. Augmented reality is also incorporated for better visualization of medical patterns. A novel privacy strategy based on blockchain is investigated for ensuring the confidentiality of the learning process. Experiments are conducted on real use cases of the biomedical segmentation process. Our strong experimental analysis reveals the strength of the proposed framework when directly compared to state-of-the-art biomedical health informatics solutions.

Many research areas depend on group anomaly detection. The use of group anomaly detection can maintain and provide security and privacy to the data involved. This research attempts to solve the deficiency of the existing literature in outlier detection thus a novel hybrid framework to identify group anomaly detection from sequence data is proposed in this paper. It proposes two approaches for efficiently solving this problem: i)Hybrid Data Mining-based algorithm, consists of three main phases: first, the clustering algorithm is applied to derive the micro-clusters. Second, the$kNN$algorithm is applied to each micro-cluster to calculate the candidates of the group’s outliers. Third, a pattern mining framework gets applied to the candidates of the group’s outliers as a pruning strategy, to generate the groups of outliers, and ii) aGPU-basedapproach is presented, which benefits from the massively GPU computing to boost the runtime of the hybrid data mining-based algorithm. Extensive experiments were conducted to show the advantages of different sequence databases of our proposed model. Results clearly show the efficiency of a GPU direction when directly compared to a sequential approach by reaching a speedup of451. In addition, both approaches outperform the baseline methods for group detection.

Road safety is tackled and an intelligent deep learning framework is proposed in this work, which includes outlier detection, vehicle detection, and accident estimation. The road state is first collected, while an intelligent filter, based on SIFT extractor and a Chinese restaurant process is used to remove noise. The extended region-based convolution neural network is then applied to identify the closest vehicles to the given driver. The residual network will benefit from the vehicle detection process to make a binary classification on whether the current road state might cause an accident or not. Finally, we propose a novel optimization model for optimizing hyper-parameters in deep learning methodologies by using evolutionary computation. The proposed solution has been tested using benchmark vehicle detection and accident estimation datasets. The results are very promising and show superiority over many current state-of-the-art solutions in terms of runtime and accuracy, where the proposed solution has more than 5% of improved accident estimation rate compared to the conventional methods.

Recent anticipated advancements in ad hoc Wireless Mesh Networks (WMN) have made them strong natural candidates for Smart Grid’s Neighborhood Area Network (NAN) and the ongoing work on Advanced Metering Infrastructure (AMI). Fault detection in these types of energy systems has recently shown lots of interest in the data science community, where anomalous behavior from energy platforms is identified. This paper develops a new framework based on privacy reinforcement learning to accurately identify anomalous patterns in a distributed and heterogeneous energy environment. The local outlier factor is first performed to derive the local simple anomalous patterns in each site of the distributed energy platform. A reinforcement privacy learning is then established using blockchain technology to merge the local anomalous patterns into global complex anomalous patterns. Besides, different optimization strategies are suggested to improve the whole outlier detection process. To demonstrate the applicability of the proposed framework, intensive experiments have been carried out on well-known CASAS (Center of Advanced Studies in Adaptive Systems) platform. Our results show that our proposed framework outperforms the baseline fault detection solutions.

Abstract This paper addresses the problem of responding to user queries by fetching the most relevant object from a clustered set of objects. It addresses the common drawbacks of cluster-based approaches and targets fast, high-quality information retrieval. For this purpose, a novel cluster-based information retrieval approach is proposed, named Cluster-based Retrieval using Pattern Mining (CRPM). This approach integrates various clustering and pattern mining algorithms. First, it generates clusters of objects that contain similar objects. Three clustering algorithms based on k-means, DBSCAN (Density-based spatial clustering of applications with noise), and Spectral are suggested to minimize the number of shared terms among the clusters of objects. Second, frequent and high-utility pattern mining algorithms are performed on each cluster to extract the pattern bases. Third, the clusters of objects are ranked for every query. In this context, two ranking strategies are proposed: i) Score Pattern Computing (SPC), which calculates a score representing the similarity between a user query and a cluster; and ii) Weighted Terms in Clusters (WTC), which calculates a weight for every term and uses the relevant terms to compute the score between a user query and each cluster. Irrelevant information derived from the pattern bases is also used to deal with unexpected user queries. To evaluate the proposed approach, extensive experiments were carried out on two use cases: the documents and tweets corpus. The results showed that the designed approach outperformed traditional and cluster-based information retrieval approaches in terms of the quality of the returned objects while being very competitive in terms of runtime.

This paper addresses the taxi fraud problem and introduces a new solution to identify trajectory outliers. The approach as presented allows to identify both individual and group outliers and is based on a two phase-based algorithm. The first phase determines the individual trajectory outliers by computing the distance of each point in each trajectory, whereas the second identifies the group trajectory outliers by exploring the individual trajectory outliers using both feature selection and sliding windows strategies. A parallel version of the algorithm is also proposed using a sliding window-based GPU approach to boost the runtime performance. Extensive experiments have been carried out to thoroughly demonstrate the usefulness of our methodology on both synthetic and real trajectory databases. The results show that the GPU approach enables reaching a speed-up of 341 over the sequential algorithm on large synthetic databases. The efficiency of the proposed method to detect both individual and group trajectory outliers on a real-world taxi trajectory database is also demonstrated in comparison with baseline trajectory outlier and group detection algorithms. The results are very promising and show superiority of the proposed method both in reducing computational time and enhancing the quality of returned outliers. Finally, we prime our methodology and results for future refinement using deep learning methodologies.

Abstract This paper investigates the use of recurrent neural network to predict urban long-term traffic flows. A representation of the long-term flows with related weather and contextual information is first introduced. A recurrent neural network approach, named RNN-LF, is then proposed to predict the long-term of flows from multiple data sources. Moreover, a parallel implementation on GPU of the proposed solution is developed (GRNN-LF), which allows to boost the performance of RNN-LF. Several experiments have been carried out on real traffic flow including a small city (Odense, Denmark) and a very big city (Beijing). The results reveal that the sequential version (RNN-LF) is capable of dealing effectively with traffic of small cities. They also confirm the scalability of GRNN-LF compared to the most competitive GPU-based software tools when dealing with big traffic flow such as Beijing urban data.

Abstract This paper explores five pattern mining problems and proposes a new distributed framework called DT-DPM: Decomposition Transaction for Distributed Pattern Mining. DT-DPM addresses the limitations of the existing pattern mining problems by reducing the enumeration search space. Thus, it derives the relevant patterns by studying the different correlation among the transactions. It first decomposes the set of transactions into several clusters of different sizes, and then explores heterogeneous architectures, including MapReduce, single CPU, and multi CPU, based on the densities of each subset of transactions. To evaluate the DT-DPM framework, extensive experiments were carried out by solving five pattern mining problems (FIM: Frequent Itemset Mining, WIM: Weighted Itemset Mining, UIM: Uncertain Itemset Mining, HUIM: High Utility Itemset Mining, and SPM: Sequential Pattern Mining). Experimental results reveal that by using DT-DPM, the scalability of the pattern mining algorithms was improved on large databases. Results also reveal that DT-DPM outperforms the baseline parallel pattern mining algorithms on big databases.

This paper provides a short overview of space–time series clustering, which can be generally grouped into three main categories such as: hierarchical, partitioning-based, and overlapping clustering. The first hierarchical category is to identify hierarchies in space–time series data. The second partitioning-based category focuses on determining disjoint partitions among the space–time series data, whereas the third overlapping category explores fuzzy logic to determine the different correlations between the space–time series clusters. We also further describe solutions for each category in this paper. Furthermore, we show the applications of these solutions in an urban traffic data captured on two urban smart cities (e.g., Odense in Denmark and Beijing in China). The perspectives on open questions and research challenges are also mentioned and discussed that allow to obtain a better understanding of the intuition, limitations, and benefits for the various space–time series clustering methods. This work can thus provide the guidances to practitioners for selecting the most suitable methods for their used cases, domains, and applications.

Frequent Itemset Mining (FIM) is an important but very time-consuming data mining task. As a result, traditional FIM algorithms are often not scalable to large databases. To address this issue, several metaheuristics have been developed in recent years to find good approximate solutions to the FIM problem. It was shown that such approaches can be much more efficient than exact algorithms. However, metaheuristics often have long runtimes on massive datasets and the quality of their solutions can be improved. To address this issue, this paper proposes a parallel framework called CFIM (Cluster for Frequent Itemset Mining) for metaheuristic-based FIM. It accelerates FIM by using multiple cluster workers. The proposed approach partitions a transactional database and the set of all items at the level of cluster workers. The itemset generation process is performed by each worker, which then send results to a master node. This latter performs a merging step to only keep high quality itemsets by considering their frequency and diversification. Three metaheuristics (GA, PSO and BSO) are integrated in this framework to yield three novel metaheuristics (CGA, CPSO and CBSO). Extensive experiments show that CPSO outperforms CGA, CBSO, and state-of-the-art high performance computing FIM approaches.

This paper considers frequent itemset mining in big transactional databases. It first introduces a novel approach (Bio-SS) that combines the bio-inspired algorithms with the single scan algorithm (SSFIM). The proposed approach addresses the limitations of SSFIM by utilizing the bio-inspired operators in the generation process. This reduces the time complexity of SSFIM from exponential to polynomial, while taking advantage of the capacity to derive the frequent itemsets by performing a single database scan, independently from the minimum support value. This allows to considerably accelerate the scan procedure compared to existing approaches, especially when dealing with large scale databases. The numerical results show that the designed Bio-SS outperforms both accurate and metaheuristics baseline FIM approaches when dealing with big databases.

Association Rule Mining (ARM) is a fundamental data mining task that is time-consuming on big datasets. Thus, developing new scalable algorithms for this problem is desirable. Recently, Bee Swarm Optimization (BSO)-based meta-heuristics were shown effective to reduce the time required for ARM. But these approaches were applied only on small or medium scale databases. To perform ARM on big databases, a promising approach is to design parallel algorithms using the massively parallel threads of a GPU processor. While some GPU-based ARM algorithms have been developed, they only benefit from GPU parallelism during the evaluation step of solutions obtained by the BSO-metaheuristics. This paper improves this approach by parallelizing the other steps of the BSO process (diversification and intensification). Based on these novel ideas, three novel algorithms are presented, i) DRGPU (Determination of Regions on GPU), ii) SAGPU (Search Area on GPU, and, iii) ALLGPU (All steps on GPU). These solutions are analyzed and empirically compared on benchmark datasets. Experimental results show that ALLGPU outperforms the three other approaches in terms of speed up. Moreover, results confirm that ALLGPU outperforms the state-of-the-art GPU-based ARM approaches on big ARM databases such as the Webdocs dataset. Furthermore, ALLGPU is extended to mine big frequent graphs and results demonstrate its superiority over the state-of-the-art D-Mine algorithm for frequent graph mining on the large Pokec social network dataset.