Simultaneous feature selection and SVM parameter determination in classification of hyperspectral imagery using Ant Colony Optimization

Power transformers are important parts in power supply systems. The stability, safety and reliability of transformers are especially important for electricity systems. This paper uses dissolved gas value as a feature parameter and creates a power transformer fault detection model by support vector machine classifier. In order to address the difficulty of determining the parameters for support vector machine, an optimization algorithm based on chaos particle swarm is proposed. The approach is not easy to be trapped into local optimum and improves population diversity and particle ergodicity. The experiment results prove that the support vector machine using chaos particle swarm optimization can achieve classification with higher precision and faster speed in power transformer fault diagnosis, compared to the support vector machine using traditional optimization algorithm.

Vis-NIR hyperspectral imaging for the classification of bacterial foodborne pathogens based on pixel-wise analysis and a novel CARS-PSO-SVM model

Automatic recognition of skin symptom plays an importance role in the skin diagnosis and treatment. Feature selection is to increase the classification performance of skin symptom. In this paper, the effects of feature selection on the classification of 4-class skin symptoms (chloasma, blackhead, freckled and comedone) are analyzed. Support vector machine (SVM) is employed to construct classifier, the parameters setting is very crucial to the learning results and generalization ability of SVM, and many irrelevant and redundant features degrade the performance of classification, furthermore, the choice of SVM parameters is influenced by the feature subset taken into account and vice versa. So a joint optimization method for selecting features and SVM parameters is proposed. Genetic algorithms, which have a lot of improvements about fitness, crossover and mutation in comparison with simple genetic algorithms, is to achieve a balance between the classification accuracy and the size of the feature subsets selected and have a fast convergence rate. Furthermore, ‘one-against-one’ approach is used to solve multi-class classification problems and a comparison of the model performances is made among the results of the joint optimization and the single optimization of features or SVM parameters in the experiments. The simulation result shows that our approach can find subsets of features for 4-class skin symptoms classification with higher average cross validation accuracy and a higher rate of convergence compared with single optimization of features or SVM parameters.

The success of any Intrusion Detection Systems (IDSs) is a complicated problem due to its nonlinearity and the quantitative or qualitative network traffic data stream with irrelevant and redundant features. How to choose the effective and key features is very important topic for an intrusion detection problem. Support vector machine (SVM) has been employed to provide potential solutions for the IDSs problem. However, the practicability of SVM is affected due to the difficulty of selecting appropriate SVM parameters. Artificial Bee Colony algorithm (ABC) is an optimization method, which is not only has strong global search capability, but also is very easy to implement. Thus, the proposed ABC-SVM model is applied to determine free parameters of SVM and feature selection at building intrusion detection system. The standard ABC is used to determine free parameters of support vector machine and the binary ABC is to obtain the optimum feature selection for IDSs from KDD Cup 99 data set. The experimental results indicate that the ABC-SVM method can achieve higher accuracy rate than Particle swarm optimization (PSO) and GA-SVM algorithms in the same time.

Boosted ANFIS model using augmented marine predator algorithm with mutation operators for wind power forecasting

Several optimization problems from various types of applications have been efficiently resolved using available meta-heuristic algorithms such as Particle Swarm Optimization and Genetic Algorithm. Recently, many meta-heuristic optimization techniques have been extensively reported in the literature. Nevertheless, there is still room for new optimization techniques and strategies since, according to the literature, there is no meta-heuristic optimization algorithm that may be considered as the best choice to cope with all modern optimization problems. This paper introduces a novel meta-heuristic optimization algorithm named Dynamic Group-based Optimization Algorithm (DGCO). The proposed algorithm is inspired by the cooperative behavior adopted by swarm individuals to achieve their global goals. DGCO has been validated and tested against twenty-three mathematical optimization problems, and the results have been verified by a comparative study with respect to state-of-the-art optimization algorithms that are already available. The results have shown the high exploration capabilities of DGCO as well as its ability to avoid local optima. Moreover, the performance of DGCO has also been verified against five constrained engineering design problems. The results demonstrate the competitive performance and capabilities of DGCO with respect to well-known state-of-the-art meta-heuristic optimization algorithms. Finally, a sensitivity analysis is performed to study the effect of different parameters on the performance of the DGCO algorithm.

The coronavirus disease of 2019 (COVID-19), a unique Coronavirus strain, has created a chaotic situation, negatively impacting the number of deaths and people's lives globally. The daily increase in COVID-19 instances is due to a lack of and restricted availability of detection techniques for determining the disease's presence. Therefore, detecting positive results as soon as feasible is important to preventing the spread of this epidemic and treating infected people as soon as possible. As a result of these constraints, the demand for clinical decision-making systems based on predictive algorithms has increased. The article describes a recurrent neural network (RNN) for identifying Coronavirus (COVID-19) and tries to improve the detection method. Different machine learning methodologies, such as Support Vector Machines (SVMs), were used to create a detection system with a deep learning algorithm called Long Short Term Memory (LSTM). The research describes a method for detecting COVID-19 in tagged CT images of patients. Various common picture features, such as central moments, Gabor wavelets, and GLCM-related features, are discussed. Ant colony optimization-ant lion optimization (ACO-ALO) is used to select optimum subsets of SVM parameters. The results show that SVM parameters such as penalty and kernel parameters have a positive effect on SVM model correctness and complexity. Besides, the findings revealed that the proposed method may be employed as a system of aid to diagnose COVID-19 disease. The findings uncover that the suggested strategy has promising behavior in terms of increasing classification accuracies as well as optimal feature selection. Promisingly, the presented strategy can be regarded as a useful clinical decision-making tool for clinicians.

Support Vector Machine (SVM) is a relatively novel classification technology, which has shown higher performance than traditional learning methods in many applications. Therefore, some security researchers have proposed an intrusion detection method based on SVM. However, the SVM algorithm is very sensitive to the choice of kernel function and parameter adjustment. Once the parameter selection is unscientific, it will lead to poor classification accuracy. To solve this problem, this paper presents a Grey Wolf Optimizer Algorithm based on Particle Swarm Optimization (PSOGWO) algorithm to improve the Intrusion Detection System (IDS) based on SVM. This method uses PSOGWO algorithm to optimize the parameters of SVM to improve the overall performance of intrusion detection based on SVM. The "optimal detection model" of SVM classifier is determined by the fusion of PSOGWO algorithm and SVM. The comparison experiments based on NSL-KDD dataset show that the intrusion detection method based on PSOGWO-SVM achieves the optimization of the parameters of SVM, and has improved significantly in terms of detection rate, convergence speed and model balance. This shows that the method has better performance for network intrusion detection.

These days, the classification between normal and cancerous tissues and between different types of cancers represents a very important issue. Selecting the little informative number of genes is considered the main challenge in the cancer diagnosis issue. Therefore, Gene selection is usually the preliminary step for solving the cancer classification problems. Bio-inspired metaheuristic optimization algorithms, when used to solve gene selection and classification problems, they demonstrate their effectiveness. Barnacles Mating Optimizer (BMO) algorithm, which imitates the behavior of mating barnacles in nature for solving optimization problems, is considered one of these algorithms. In this paper, Barnacles Mating Optimizer (BMO) algorithm augmented with Support Vector Machines (SVM) called BMO-SVM is proposed for a microarray gene expression profiling in order to select the most predictive and informative genes for cancer classification. Conducting a comparative experimental study among a set of the most common bio-inspired optimization techniques to specify the most effective. A binary microarray dataset (i.e., leukemia1) and a multi-class microarray dataset (i.e., SRBCT, lymphoma, and leukemia2) are used for testing the performance of the proposed model. The experimental results revealed the superiority of the proposed BMO-SVM approach against several well-known meta-heuristic optimization algorithms, such as the Tunicate Swarm Algorithm (TSA), Genetic Algorithm (GA), Particle Swarm Optimization (PSO), and Artificial Bee Colony (ABC). It is worth mentioning that our proposed algorithm achieves a high informational superiority percentage compared to other algorithms.

In order to improve the search result and low evolution speed, and avoid the tendency towards stagnation and falling into the local optimum of ant colony optimization(ACO) in solving the complex function, the traditional ant colony optimization algorithm is analyzed in detail, an improved ant colony optimization(IWSMACO) algorithm based on information weight factor and supervisory mechanism is proposed in this paper. In the proposed IWSMACO algorithm, the information weight factor is added to the path selection and pheromone adjustment mechanisms in order to dynamically adjust path selection probability and randomly select the behavior rules for further intelligentializing the ant colony. The supervisory mechanism added the dynamic convergence criterion of supervisory distance and used the optimal pheromone update strategy to self-adaptively select the excellent ants for updating the pheromone trails, and improve the solution qualities of each iteration, better guide the later ants for learning. Finally, the proposed IWSMACO algorithm is carried out by 12 TSP instances. The simulation experiment results show that the proposed IWSMACO algorithm can not only avoid falling into the local optimum, but also enhance the convergence speed. And it takes on remarkable optimized ability and higher search accuracy.

With the rapid development of Internet and information technology, detecting network intrusion behaviors have been attracted more and more attentions. In this paper, we proposed a novel network intrusion detection algorithm using a hybrid ant colony and support vector machine model. Main ideas of SVM are that it denotes a representation of the examples as points in space, and examples of the separate categories are separated by a gap. Afterwards, framework of the detecting network intrusion system is given, which is designed to promote the accuracy of detecting network intrusion by optimizing parameters of support vector machine with ant colony algorithm. Finally, four types of network attack behaviors are utilized in this experiment, that is, a) DOS, b) R2L, c) U2R, and d) Probe. Experimental results demonstrate that the proposed method is able to detect network intrusion with high accuracy.

Over the years, Metaheuristic algorithms have proven significant efficacy in handling None- Deterministic polynomial hard (NP-hard) combinatorial optimization problems, mainly the Traveling Salesman Problem (TSP) which has been used to evaluate and test many metaheuristics algorithms such as Ant Colony optimizations. This paper contributes a new optimization algorithm to the famous-family of swarm and evolutionary techniques named Scuba Diver Optimization Algorithm (SDOA) which is a novel population-based metaheuristic optimization algorithm inspired by the behavioural and physiological dynamics of scuba divers in the open water environments. SDOA simulates main diving factors including (depth, tank pressure/oxygen, bottom time, and ascent strategies) for keeping a balance between explorations and exploitations during the search process. SDOA novelty appears in its adaptive control of solution diversity using pressure and oxygen level thresholds, enabling robust avoidance of local optima and faster convergence. The SDOA algorithm was evaluated on a range of TSP instances from the TSPLIB library, which were categorized into three groups: Group 1, comprising instances with 1–99 cities; Group 2, including instances with 100–999 cities; and Group 3, consisting of large-scale instances with 1000 or more cities. And the results of SDOA is compared with established metaheuristics algorithms such as Ant Colony Optimization, Artificial Bee Colony, and Genetic Algorithm. The study results showing that SDOA consistently produces shorter (near optimal) tour lengths with significantly minimum computational time in larger problem sizes (Group 3). The proposed algorithm also demonstrates better scalability and stability in different initialization and population sizes. Future directions include adapting SDOA for solving other optimization problems including multi-objective or dynamic optimization contexts.

Optimizing resource allocation and routing to satisfy service needs is paramount in large-scale networks. Software-defined networking (SDN) is a new network paradigm that decouples forwarding and control, enabling dynamic management and configuration through programming, which provides the possibility for deploying intelligent control algorithms (such as deep reinforcement learning algorithms) to solve network routing optimization problems in the network. Although these intelligent-based network routing optimization schemes can capture network state characteristics, they are prone to falling into local optima, resulting in poor convergence performance. In order to address this issue, this paper proposes an African Vulture Routing Optimization (AVRO) algorithm for achieving SDN routing optimization. AVRO is based on the African Vulture Optimization Algorithm (AVOA), a population-based metaheuristic intelligent optimization algorithm with global optimization ability and fast convergence speed advantages. First, we improve the population initialization method of the AVOA algorithm according to the characteristics of the network routing problem to enhance the algorithm’s perception capability towards network topology. Subsequently, we add an optimization phase to strengthen the development of the AVOA algorithm and achieve stable convergence effects. Finally, we model the network environment, define the network optimization objective, and perform comparative experiments with the baseline algorithms. The experimental results demonstrate that the routing algorithm has better network awareness, with a performance improvement of 16.9% compared to deep reinforcement learning algorithms and 71.8% compared to traditional routing schemes.

Ant colony optimization (ACO) algorithm is a metaheuristic inspired by the behavior of real ants in their search for the shortest path to food sources. The ACO algorithm takes on these characteristics of robust, positive feedback distributed computing, easy fusing with other algorithms. But the basic ACO algorithm has some deficiencies of premature and stagnation phenomenon in the evolution process, and is easily trapped into local optimal solution. And it is difficult to explore other solutions in the neighbor space. So a improved ACO(DPSEMACO) algorithm based on dual population strategy, bi-directional dynamic adjust evaporation factor strategy of the pheromone and parallel strategy is proposed to solve the traveling salesman problem(TSP). In the DPSEMACO algorithm, the ants are divided into the two subpopulations by borrowing the mutual cooperation mechanism of biological community, which evolve separately and exchange information timely. The bi-directional dynamic adjusting evaporation factor strategy of the pheromone is used to change the corresponding path pheromone of different subpopulations in order to avoid to trap into a local optimum. The parallel strategy can avoid falling into a local optimum. And the DPSEMACO algorithm can expand the search space and improve the overall searching performance by repeated changing the pheromone of the each subpopulation and adaptive adjusting evaporation factor. Finally, in order to prove the optimization performance of the proposed DPSEMACO algorithm, some classic TSP instances are selected from the TSPLIB in this paper. And some existing methods are selected to compare the optimization performance with the proposed DPSEMACO algorithm. The experimental results demonstrate that the proposed DPSEMACO algorithm is feasible and effective in solving TSP, and takes on a good global searching ability and high convergence speed.

In this chapter, one gives an introduction to different kinds of particle swarm optimization (PSO) algorithms. One also introduces artificial neural networks (ANNs), support vector machines (SVMs) and evolutionary computing to show how PSO may be used to determine optimal parameters using an ANN or SVM regime, for classification of DNA strings. In addition, PSO is used in the design of an SVM-based clustering algorithm. Ant colony optimization (ACO) algorithms are also introduced in the chapter. Using ACO algorithms has been of great success to solve many discrete optimization and non-deterministic polynomial (NP)-hard problems, for instance the travelling salesman problem. The behaviour of ants is also used, for instance, to design an algorithm for data clustering. We want to develop later a similar application based on this clustering algorithm and compare it with the SVM one using PSO.