Recent Advances in Artificial Immune Systems: Models and Applications

A Comprehensive Review of Bio-Inspired Optimization Algorithms Including Applications in Microelectronics and Nanophotonics

The application of artificial intelligence in everyday life is becoming all-pervasive and unavoidable. Within that vast field, a special place belongs to biomimetic/bio-inspired algorithms for multiparameter optimization, which find their use in a large number of areas. Novel methods and advances are being published at an accelerated pace. Because of that, in spite of the fact that there are a lot of surveys and reviews in the field, they quickly become dated. Thus, it is of importance to keep pace with the current developments. In this review, we first consider a possible classification of bio-inspired multiparameter optimization methods because papers dedicated to that area are relatively scarce and often contradictory. We proceed by describing in some detail some more prominent approaches, as well as those most recently published. Finally, we consider the use of biomimetic algorithms in two related wide fields, namely microelectronics (including circuit design optimization) and nanophotonics (including inverse design of structures such as photonic crystals, nanoplasmonic configurations and metamaterials). We attempted to keep this broad survey self-contained so it can be of use not only to scholars in the related fields, but also to all those interested in the latest developments in this attractive area.

An improved immune algorithm with parallel mutation and its application

The objective of this paper is to design a fast and efficient immune algorithm for solving various optimization problems. The immune algorithm (IA), which simulates the principle of the biological immune system, is one of the nature-inspired algorithms and its many advantages have been revealed. Although IA has shown its superiority over the traditional algorithms in many fields, it still suffers from the drawbacks of slow convergence and local minima trapping problems due to its inherent stochastic search property. Many efforts have been done to improve the search performance of immune algorithms, such as adaptive parameter setting and population diversity maintenance. In this paper, an improved immune algorithm (IIA) which utilizes a parallel mutation mechanism (PM) is proposed to solve the Lennard-Jones potential problem (LJPP). In IIA, three distinct mutation operators involving cauchy mutation (CM), gaussian mutation (GM) and lateral mutation (LM) are conditionally selected to be implemented. It is expected that IIA can effectively balance the exploration and exploitation of the search and thus speed up the convergence. To illustrate its validity, IIA is tested on a two-dimension function and some benchmark functions. Then IIA is applied to solve the LJPP to exhibit its applicability to the real-world problems. Experimental results demonstrate the effectiveness of IIA in terms of the convergence speed and the solution quality.

A Review on Immune-Inspired Node Fault Detection in Wireless Sensor Networks with a Focus on the Danger Theory

The use of fault detection and tolerance measures in wireless sensor networks is inevitable to ensure the reliability of the data sources. In this context, immune-inspired concepts offer suitable characteristics for developing lightweight fault detection systems, and previous works have shown promising results. In this article, we provide a literature review of immune-inspired fault detection approaches in sensor networks proposed in the last two decades. We discuss the unique properties of the human immune system and how the found approaches exploit them. With the information from the literature review extended with the findings of our previous works, we discuss the limitations of current approaches and consequent future research directions. We have found that immune-inspired techniques are well suited for lightweight fault detection, but there are still open questions concerning the effective and efficient use of those in sensor networks.

Could artificial intelligence revolutionize the development of nanovectors for gene therapy and mRNA vaccines?

Gene therapy enables the introduction of nucleic acids like DNA and RNA into host cells, and is expected to revolutionize the treatment of a wide range of diseases. This growth has been further accelerated by the discovery of CRISPR/Cas technology, which allows accurate genomic editing in a broad range of cells and organisms in vitro and in vivo. Despite many advances in gene delivery and the development of various viral and non-viral gene delivery vectors, the lack of highly efficient non-viral systems with low cellular toxicity remains a challenge. The application of cutting-edge technologies such as artificial intelligence (AI) has great potential to find new paradigms to solve this issue. Herein, we review AI and its major subfields including machine learning (ML), neural networks (NNs), expert systems, deep learning (DL), computer vision and robotics. We discuss the potential of AI-based models and algorithms in the design of targeted gene delivery vehicles capable of crossing extracellular and intracellular barriers by viral mimicry strategies. We finally discuss the role of AI in improving the function of CRISPR/Cas systems, developing novel nanobots, and mRNA vaccine carriers.

On a Novel Hybrid Manta Ray Foraging Optimizer and Its Application on Parameters Estimation of Lithium-Ion Battery

In this paper, we propose a hybrid meta-heuristic algorithm called MRFO-PSO that hybridizes the Manta ray foraging optimization (MRFO) and particle swarm optimization (PSO) with the aim to balance the exploration and exploitation abilities. In the MRFO-PSO, the concept of velocity of the PSO is incorporated to guide the searching process of the MRFO, where the velocity is updated by the first best and the second-best solutions. By this integration, the balancing issue between the exploration phase and exploitation ability has been further improved. To illustrate the robustness and effectiveness of the MRFO-PSO, it is tested on 23 benchmark equations and it is applied to estimate the parameters of Tremblay's model with three different commercial lithium-ion batteries including the Samsung Cylindrical ICR18650-22 lithium-ion rechargeable battery, Tenergy 30209 prismatic cell, Ultralife UBBL03 (type LI-7) rechargeable battery. The study contribution exclusively utilizes hybrid machine learning-based tuning for Tremblay's model parameters to overcome the disadvantages of human-based tuning. In addition, the comparisons of the MRFO-PSO with six recent meta-heuristic methods are performed in terms of some statistical metrics and Wilcoxon’s test-based non-parametric test. As a result, the conducted performance measures have confirmed the competitive results as well as the superiority of the proposed MRFO-PSO.

Improvement of NIR prediction ability by dual model optimization in fusion of NSIA and SA methods

Feature selection and sample partitioning are both important to establish a quantitative analytical model for near-infrared (NIR) spectroscopy. The classical interval partial least squares (iPLS) model for waveband selection can be improved in combination of the simulated annealing (SA) algorithm. The sample set partitioning based on a joint x-y distance (SPXY) method for sample partitioning is based on the distances of both the x- and y- dimensions; it is expected to be optimized using the non-dominant sorting strategies (NS) combined with the immune algorithm (IA). In this study, we investigated the dual model optimization mode for simultaneous selection of feature waveband and sample partitioning, and proposed a novel method defined as SA-iPLS & SPXY-NSIA. The method explores a population evolution process, and takes the candidate individual as the link for the fusion optimization of SA-iPLS and SPXY-NSIA. The method screens feature wavebands and observes a good partition of the modeling samples, to construct a combined optimization strategy for fusion optimization of the target waveband and suitable sets of sample partitioning. The performance of the SA-iPLS & SPXY-NSIA method was tested using a soil sample dataset. To prove model enhancement, the proposed method was compared to the two traditional methods of Kennard-Stone (KS) and SPXY in combination with SA-iPLS. Experimental results show that the fusion model established by SA-iPLS & SPXY-NSIA performed better than the KS-SA-iPLS and SPXY-SA-iPLS models. The best testing results of the fusion model is with RMSET, RPD_T and R_T observed as 0.0107, 1.7233 and 0.9097, respectively. The proposed method is prospectively able to effectively improve the predictive ability of the NIR analytical model.

Continual learning classification method with single-label memory cells based on the intelligent mechanism of the biological immune system

The traditional batch learning classification methods need to obtain all kinds of data once before training. This makes them unable to recognize the data from the unseen types and cannot continuously enhance their classification ability through learning the testing data in the testing process, because they lack continual learning ability. Inspired by the continual learning mechanism of the biological immune system (BIS), this paper proposed a continual learning classification method with single-label memory cells (S-CLCM). The type of testing data is identified by memory cells, and the data type from unseen types is determined by an affinity threshold. New memory cells are cultivated continuously by learning the testing data to enhance the classification ability of S-CLCM gradually. Every memory cell has the same size and a unique type. It becomes a standard batch learning classification method or a standard clustering method under certain conditions. Take the experiments on twenty benchmark datasets to estimate its classification performance and possible superiority. Results show S-CLCM has good performance when it becomes a standard batch learning classification method, and S-CLCM is superior to the other classical classification algorithms when the data from unseen types or new labeled data appear during the testing process. It can improve the classification accuracy by up to 33%, and by at least 14%.

Towards Bio-Inspired Anomaly Detection Using the Cursory Dendritic Cell Algorithm

The autonomous and adaptable identification of anomalies in industrial contexts, particularly in the physical processes of Cyber-Physical Production Systems (CPPS), requires using critical technologies to identify failures correctly. Most of the existing solutions in the anomaly detection research area do not consider such systems’ dynamics. Due to the complexity and multidimensionality of CPPS, a scalable, adaptable, and rapid anomaly detection system is needed, considering the new design specifications of Industry 4.0 solutions. Immune-based models, such as the Dendritic Cell Algorithm (DCA), may provide a rich source of inspiration for detecting anomalies, since the anomaly detection problem in CPPS greatly resembles the functionality of the biological dendritic cells in defending the human body from hazardous pathogens. This paper tackles DCA limitations that may compromise its usage in anomaly detection applications, such as the manual characterization of safe and danger signals, data analysis not suitable for online classification, and the lack of an object-oriented implementation of the algorithm. The proposed approach, the Cursory Dendritic Cell Algorithm (CDCA), is a novel variation of the DCA, developed to be flexible and monitor physical industrial processes continually while detecting anomalies in an online fashion. This work’s contribution is threefold. First, it provides a comprehensive review of Artificial Immune Systems (AIS), focusing on AIS applied to the anomaly detection problem. Then, a new object-oriented architecture for the DCA implementation is described, enabling the modularity and abstraction of the algorithm stages into different classes (modules). Finally, the CDCA for the anomaly detection problem is proposed. The CDCA was successfully validated in two industrial-oriented dataset benchmarks for physical anomaly and network intrusion detection, the Skoltech Anomaly Benchmark (SKAB) and M2M using OPC UA. When compared to other algorithms, the proposed approach exhibits promising classification results. It was placed fourth on the SKAB scoreboard and presented a competitive performance with the incremental Dendritic Cell Algorithm (iDCA).

A Comparative Study of Common Nature-Inspired Algorithms for Continuous Function Optimization

Over previous decades, many nature-inspired optimization algorithms (NIOAs) have been proposed and applied due to their importance and significance. Some survey studies have also been made to investigate NIOAs and their variants and applications. However, these comparative studies mainly focus on one single NIOA, and there lacks a comprehensive comparative and contrastive study of the existing NIOAs. To fill this gap, we spent a great effort to conduct this comprehensive survey. In this survey, more than 120 meta-heuristic algorithms have been collected and, among them, the most popular and common 11 NIOAs are selected. Their accuracy, stability, efficiency and parameter sensitivity are evaluated based on the 30 black-box optimization benchmarking (BBOB) functions. Furthermore, we apply the Friedman test and Nemenyi test to analyze the performance of the compared NIOAs. In this survey, we provide a unified formal description of the 11 NIOAs in order to compare their similarities and differences in depth and a systematic summarization of the challenging problems and research directions for the whole NIOAs field. This comparative study attempts to provide a broader perspective and meaningful enlightenment to understand NIOAs.

An improved real-valued negative selection algorithm based on the constant detector for anomaly detection

Compared with the traditional negative selection algorithms produce detectors randomly in whole state space, the boundary-fixed negative selection algorithm (FB-NSA) non-randomly produces a layer of detectors closely surrounding the self space. However, the false alarm rate of FB-NSA is higher than many anomaly detection methods. Its detection rate is very low when normal data close to the boundary of state space. This paper proposed an improved FB-NSA (IFB-NSA) to solve these problems. IFB-NSA enlarges the state space and adds auxiliary detectors in appropriate places to improve the detection rate, and uses variable-sized training samples to reduce the false alarm rate. We present experiments on synthetic datasets and the UCI Iris dataset to demonstrate the effectiveness of this approach. The results show that IFB-NSA outperforms FB-NSA and the other anomaly detection methods in most of the cases.

Continual learning classification method for time-varying data space based on artificial immune system

Classification methods play an important role in many fields. However, they cannot effectively classify the samples from sample spaces that are varying with time, for they lack continual learning ability. A continual learning classification method for time-varying data space based on artificial immune system, CLCMTVD, is proposed. It is inspired by the intelligent mechanism that memory cells of the biological immune system can recognize and eliminate previous invaders when they attack again very fast and more efficiently, and these memory cells can evolve with the evolution of previous invaders. Memory cells were continuously updated by learning testing data during the testing stage, thus realize the self-improvement of classification performance. CLCMTVD changes a linearly inseparable spatial problem into many classification problems of several different times, and it degenerates into a common supervised learning classification method when all data independent of time. To assess the performance and possible advantages of CLCMTVD, the experiments on well-known datasets from UCI repository, synthetic data and XJTU-SY rolling element bearing accelerated life test datasets were performed. Results show that CLCMTVD has better classification performance for time-invariant data, and outperforms the other methods for time-varying data space.

Numerical function optimization by conditionalized PSO algorithm

A lot of research has been directed to the new optimizers that can find a suboptimal solution for any optimization problem named as heuristic black-box optimizers. They can find the suboptimal solutions of an optimization problem much faster than the mathematical programming methods (if they find them at all). Particle swarm optimization (PSO) is an example of this type. In this paper, a new modified PSO has been proposed. The proposed PSO incorporates conditional learning behavior among birds into the PSO algorithm. Indeed, the particles, little by little, learn how they should behave in some similar conditions. The proposed method is named Conditionalized Particle Swarm Optimization (CoPSO). The problem space is first divided into a set of subspaces in CoPSO. In CoPSO, any particle inside a subspace will be inclined towards its best experienced location if the particles in its subspace have low diversity; otherwise, it will be inclined towards the global best location. The particles also learn to speed-up in the non-valuable subspaces and to speed-down in the valuable subspaces. The performance of CoPSO has been compared with the state-of-the-art methods on a set of standard benchmark functions.

AISAC: An Artificial Immune System for Associative Classification Applied to Breast Cancer Detection

Early breast cancer diagnosis is crucial, as it can prevent further complications and save the life of the patient by treating the disease at its most curable stage. In this paper, we propose a new artificial immune system model for associative classification with competitive performance for breast cancer detection. The proposed model has its foundations in the biological immune system; it mimics the detection skills of the immune system to provide correct identification of antigens. The Wilcoxon test was used to identify the statistically significant differences between our proposal and other classification algorithms based on the same bio-inspired model. These statistical tests evidenced the enhanced performance shown by the proposed model by outperforming other immune-based algorithms. The proposed model proved to be competitive with respect to other well-known classification models. In addition, the model benefits from a low computational cost. The success of this model for classification tasks shows that swarm intelligence is useful for this kind of problem, and that it is not limited to optimization tasks.

Predicting Crude Oil Price Using Fuzzy Rough Set and Bio-Inspired Negative Selection Algorithm

The need to accurately predict and make right decisions regarding crude oil price motivates the proposition of an alternative algorithmic method based on real-valued negative selection with variable-sized detectors (V-Detectors), by incorporating with fuzzy-rough set feature selection (FRFS) for predicting the most appropriate choices. The objective of this study is enhancing the performance of V-Detectors using FRFS for prices of crude oil. Applying FRFS serves to prune the number of features by retaining the most informative and critical features. The V-Detectors then trains and tests the features. Different radius values are applied for V-Detectors. Experimental outcome in comparison with established algorithms such as support vector machine, naïve bayes, multi-layer perceptron, J48, non-nested generalized exemplars, IBk, fuzzy-roughNN, and vaguely quantified nearest neighbor demonstrates that FRFS-V-Detectors is proficient and valuable for insightful knowledge on crude oil price. Thus, it can assist in establishing oil price market policies on the international scale.

Artificial Immune Systems: An Overview for Faulting Actuators

This paper reviews Artificial Immune Systems (AIS) that can be implemented to compensate for actuators that are in a faulted state or operating abnormally. Eventually, all actuators will fail or wear out, and these actuator faults must be managed if a system is to operate safely. The AIS are adaptive algorithms which are inherently well-suited to these situations by treating these faults as infections that must be combated. However, the computational intensity of these algorithms has caused them to have limited success in real-time situations. With the advent of distributed and cloud-based computing these algorithms have begun to be feasible for diagnosing faulted actuators and then generating compensating controllers in near-real-time. To encourage the application of AIS to these situations, this work presents research for the fundamental operating principles of AIS, their applications, and a brief case-study on their applicability to fault compensation by considering an overactuated rover with four independent drive wheels and independent front and rear steering.

Immune Evolution Particle Filter for Soil Moisture Data Assimilation

Data assimilation (DA) has been widely used in land surface models (LSM) to improve model state estimates. Among various DA methods, the particle filter (PF) with Markov chain Monte Carlo (MCMC) has become increasingly popular for estimating the states of the nonlinear and non-Gaussian LSMs. However, the standard PF always suffers from the particle impoverishment problem, characterized by loss of particle diversity. To solve this problem, an immune evolution particle filter with MCMC simulation inspired by the biological immune system, entitled IEPFM, is proposed for DA in this paper. The merit of this approach is in imitating the antibody diversity preservation mechanism to further improve particle diversity, thus increasing the accuracy of estimates. Furthermore, the immune memory function refers to promise particle evolution process towards optimal estimates. Effectiveness of the proposed approach is demonstrated by the numerical simulation experiment using a highly nonlinear atmospheric model. Finally, IEPFM is applied to a soil moisture (SM) assimilation experiment, which assimilates in situ observations into the Variable Infiltration Capacity (VIC) model to estimate SM in the MaQu network region of the Tibetan Plateau. Both synthetic and real case experiments demonstrate that IEPFM mitigates particle impoverishment and provides more accurate assimilation results compared with other popular DA algorithms.

An Extreme Learning Machine Based on Artificial Immune System

Extreme learning machine algorithm proposed in recent years has been widely used in many fields due to its fast training speed and good generalization performance. Unlike the traditional neural network, the ELM algorithm greatly improves the training speed by randomly generating the relevant parameters of the input layer and the hidden layer. However, due to the randomly generated parameters, some generated “bad” parameters may be introduced to bring negative effect on the final generalization ability. To overcome such drawback, this paper combines the artificial immune system (AIS) with ELM, namely, AIS-ELM. With the help of AIS's global search and good convergence, the randomly generated parameters of ELM are optimized effectively and efficiently to achieve a better generalization performance. To evaluate the performance of AIS-ELM, this paper compares it with relevant algorithms on several benchmark datasets. The experimental results reveal that our proposed algorithm can always achieve superior performance.

An improved optimization algorithm of the three-compartment model with spillover and partial volume corrections for dynamic FDG PET images of small animal hearts in vivo

The three-compartment model with spillover (SP) and partial volume (PV) corrections has been widely used for noninvasive kinetic parameter studies of dynamic 2-[18F] fluoro-2deoxy-D-glucose (FDG) positron emission tomography images of small animal hearts in vivo. However, the approach still suffers from estimation uncertainty or slow convergence caused by the commonly used optimization algorithms. The aim of this study was to develop an improved optimization algorithm with better estimation performance. Femoral artery blood samples, image-derived input functions from heart ventricles and myocardial time-activity curves (TACs) were derived from data on 16 C57BL/6 mice obtained from the UCLA Mouse Quantitation Program. Parametric equations of the average myocardium and the blood pool TACs with SP and PV corrections in a three-compartment tracer kinetic model were formulated. A hybrid method integrating artificial immune-system and interior-reflective Newton methods were developed to solve the equations. Two penalty functions and one late time-point tail vein blood sample were used to constrain the objective function. The estimation accuracy of the method was validated by comparing results with experimental values using the errors in the areas under curves (AUCs) of the model corrected input function (MCIF) and the 18F-FDG influx constant K _i . Moreover, the elapsed time was used to measure the convergence speed. The overall AUC error of MCIF for the 16 mice averaged  -1.4  ±  8.2%, with correlation coefficients of 0.9706. Similar results can be seen in the overall K _i error percentage, which was 0.4  ±  5.8% with a correlation coefficient of 0.9912. The t-test P value for both showed no significant difference. The mean and standard deviation of the MCIF AUC and K _i percentage errors have lower values compared to the previously published methods. The computation time of the hybrid method is also several times lower than using just a stochastic algorithm. The proposed method significantly improved the model estimation performance in terms of the accuracy of the MCIF and K _i , as well as the convergence speed.