RESUMO
Internet of Health Things (IoHT) is a promising e-Health paradigm that involves offloading numerous computational-intensive and delay-sensitive tasks from locally limited IoHT points to edge servers (ESs) with abundant computational resources in close proximity. However, existing computation offloading techniques struggle to meet the burgeoning health demands in ultra-reliable and low-latency communication (URLLC), one of the 5G application scenarios. This paper proposes a Multi-Agent Soft-Actor-Critic-discrete based URLLC-constrained task offloading and resource allocation (MASACDUA) scheme to maximize throughput while minimizing power consumption on the remote side, considering the long-term URLLC constraints. The URLLC constraint conditions are formulated using extreme value theory, and Lyapunov optimization is employed to divide the problem into task offloading and computation resource allocation. MASAC-discrete and a queue backlog-aware algorithm are utilized to approach task offloading and computation resource allocation, respectively. Extensive simulation results demonstrate that MASACDUA outperforms traditional DRL algorithms under different IoHT points and data arrival rate intervals and achieves superior performance in delay, bound violation probability, and other characteristics related to URLLC.
RESUMO
In this paper, a new generic parallel pattern mining framework called multi-objective Decomposition for Parallel Pattern-Mining (MD-PPM) is developed to solve the challenges of the Internet of Medical Things through big data exploration. MD-PPM discovers important patterns by using decomposition and parallel mining methods to explore the 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 good 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.
RESUMO
This research work introduces a new intelligent framework for infectious disease detection by exploring various emerging and intelligent paradigms. We propose new deep learning architectures such as entity embedding networks, long-short term memory, and convolution neural networks, for accurately learning heterogeneous medical data in identifying disease infection. The multi-agent system is also consolidated for increasing the autonomy behaviours of the proposed framework, where each agent can easily share the derived learning outputs with the other agents in the system. Furthermore, evolutionary computation algorithms, such as memetic algorithms, and bee swarm optimization controlled the exploration of the hyper-optimization parameter space of the proposed framework. Intensive experimentation has been established on medical data. Strong results obtained confirm the superiority of our framework against the solutions that are state of the art, in both detection rate, and runtime performance, where the detection rate reaches 98% for handling real use cases.
RESUMO
In the quest of training complicated medical data for Internet of Medical Things (IoMT) scenarios, this study develops an end-to-end intelligent framework that incorporates ensemble learning, genetic algorithms, blockchain technology, and various U-Net based architectures. Genetic algorithms are used to optimize the hyper-parameters of the used architectures. The training process was also protected with the help of blockchain technology. Finally, an ensemble learning system based on voting mechanism was developed to combine local outputs of various segmentation models into a global output. Our method shows that strong performance in a condensed number of epochs may be achieved with a high learning rate and a small batch size. As a result, we are able to perform better than standard solutions for well-known medical databases. In fact, the proposed solution reaches 95% of intersection over the union, compared to the baseline solutions where they are below 80%. Moreover, with the proposed blockchain strategy, the detected attacks reached 76%.
RESUMO
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.
Assuntos
Realidade Aumentada , Blockchain , Informática Médica , Inteligência Artificial , Confidencialidade , HumanosRESUMO
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.
Assuntos
Aprendizado Profundo , Algoritmos , Mineração de Dados , Aprendizado de Máquina , Redes Neurais de ComputaçãoRESUMO
Privacy-preserving data mining has become an interesting and emerging issue in recent years since it can, not only hide the sensitive information but still mine the meaningful knowledge at the same time. Since privacy-preserving data mining is a non-trivial task, which is also concerned as a NP-hard problem, several evolutionary algorithms were presented to find the optimized solutions but most of them focus on considering a single-objective function with the pre-defined weight values of three side effects (hiding failure, missing cost, and artificial cost). In this paper, we aim at designing a multiple objective particle swarm optimization method for hiding the sensitive information based on the density clustering approach (named CMPSO). The presented CMPSO is more flexible to select the most appropriate solutions for hiding the sensitive information based on user's preference. Extensive experiments are carried on two datasets to show that the designed CMPSO algorithm has good performance than the traditional single-objective evolutionary approaches in terms of three side effects.