Estimation of Crop Biomass Using GF-3 Polarization SAR Data Based on Genetic Algorithm Feature Selection

In recent years,Polarization SAR(PolSAR)has been widely used in the filed of crop biomass estimation.However,high dimensional features extracted from PolSAR data will lead to information redundancy which will result in low accuracy and poor transfer ability of the estimation model.Aiming at this problem,we proposed a estimation method of crop biomass based on automatic feature selection method using genetic algorithm(GA).Firstly,the backscattering coefficient,the polarization parameters and texture features were extracted from PolSAR data.Then,these features were automatically pre-selected by GA to obtain the optimal feature subset.Finally,based on this subset,a support vector regression machine(SVR)model was applied to estimate crop biomass.The proposed method was validated using the GaoFen-3(GF-3)QPSΙ(C-band,quad-polarization)SAR data.Based on wheat and rape biomass samples acquired from a synchronous field measurement campaign,the proposed method achieve relative high validation accuracy(over 80%)in both crop types.For further analyzing the improvement of proposed method,validation accuracies of biomass estimation models based on several different feature selection methods were compared.Compared with feature selection based on linear correlation,GA method has increased by 5.77%in wheat biomass estimation and 11.84%in rape biomass estimation.Compared with the method of recursive feature elimination(RFE)selection,the proposed method has improved crops biomass estimation accuracy by 3.90%and 5.21%,respectively.

Feature Selection Method by Applying Parallel Collaborative Evolutionary Genetic Algorithm

Feature selection is one of the important topics in text classification. However, most of existing feature selection methods are serial and inefficient to be applied to massive text data sets. In this case, a feature selection method based on parallel collaborative evolutionary genetic algorithm is presented. The presented method uses genetic algorithm to select feature subsets and takes advantage of parallel collaborative evolution to enhance time efficiency, so it can quickly acquire the feature subsets which are more representative. The experimental results show that, for accuracy ratio and recall ratio, the presented method is better than information gain, x2 statistics, and mutual information methods; the consumed time of the presented method with only one CPU is inferior to that of these three methods, but the presented method is supe rior after using the parallel strategy.

A Length-Adaptive Non-Dominated Sorting Genetic Algorithm for Bi-Objective High-Dimensional Feature Selection

As a crucial data preprocessing method in data mining,feature selection(FS)can be regarded as a bi-objective optimization problem that aims to maximize classification accuracy and minimize the number of selected features.Evolutionary computing(EC)is promising for FS owing to its powerful search capability.However,in traditional EC-based methods,feature subsets are represented via a length-fixed individual encoding.It is ineffective for high-dimensional data,because it results in a huge search space and prohibitive training time.This work proposes a length-adaptive non-dominated sorting genetic algorithm(LA-NSGA)with a length-variable individual encoding and a length-adaptive evolution mechanism for bi-objective highdimensional FS.In LA-NSGA,an initialization method based on correlation and redundancy is devised to initialize individuals of diverse lengths,and a Pareto dominance-based length change operator is introduced to guide individuals to explore in promising search space adaptively.Moreover,a dominance-based local search method is employed for further improvement.The experimental results based on 12 high-dimensional gene datasets show that the Pareto front of feature subsets produced by LA-NSGA is superior to those of existing algorithms.

Method for Fault Feature Selection for a Baler Gearbox Based on an Improved Adaptive Genetic Algorithm

The performance and efficiency of a baler deteriorate as a result of gearbox failure.One way to overcome this challenge is to select appropriate fault feature parameters for fault diagnosis and monitoring gearboxes.This paper proposes a fault feature selection method using an improved adaptive genetic algorithm for a baler gearbox.This method directly obtains the minimum fault feature parameter set that is most sensitive to fault features through attribute reduction.The main benefit of the improved adaptive genetic algorithm is its excellent performance in terms of the efficiency of attribute reduction without requiring prior information.Therefore,this method should be capable of timely diagnosis and monitoring.Experimental validation was performed and promising findings highlighting the relationship between diagnosis results and faults were obtained.The results indicate that when using the improved genetic algorithm to reduce 12 fault characteristic parameters to three without a priori information,100%fault diagnosis accuracy can be achieved based on these fault characteristics and the time required for fault feature parameter selection using the improved genetic algorithm is reduced by half compared to traditional methods.The proposed method provides important insights into the instant fault diagnosis and fault monitoring of mechanical devices.

Energy Theft Detection in Smart Grids with Genetic Algorithm-Based Feature Selection

As big data,its technologies,and application continue to advance,the Smart Grid(SG)has become one of the most successful pervasive and fixed computing platforms that efficiently uses a data-driven approach and employs efficient information and communication technology(ICT)and cloud computing.As a result of the complicated architecture of cloud computing,the distinctive working of advanced metering infrastructures(AMI),and the use of sensitive data,it has become challenging tomake the SG secure.Faults of the SG are categorized into two main categories,Technical Losses(TLs)and Non-Technical Losses(NTLs).Hardware failure,communication issues,ohmic losses,and energy burnout during transmission and propagation of energy are TLs.NTL’s are human-induced errors for malicious purposes such as attacking sensitive data and electricity theft,along with tampering with AMI for bill reduction by fraudulent customers.This research proposes a data-driven methodology based on principles of computational intelligence as well as big data analysis to identify fraudulent customers based on their load profile.In our proposed methodology,a hybrid Genetic Algorithm and Support Vector Machine(GA-SVM)model has been used to extract the relevant subset of feature data from a large and unsupervised public smart grid project dataset in London,UK,for theft detection.A subset of 26 out of 71 features is obtained with a classification accuracy of 96.6%,compared to studies conducted on small and limited datasets.

Genetic Algorithm Combined with the K-Means Algorithm:A Hybrid Technique for Unsupervised Feature Selection

The dimensionality of data is increasing very rapidly,which creates challenges for most of the current mining and learning algorithms,such as large memory requirements and high computational costs.The literature includes much research on feature selection for supervised learning.However,feature selection for unsupervised learning has only recently been studied.Finding the subset of features in unsupervised learning that enhances the performance is challenging since the clusters are indeterminate.This work proposes a hybrid technique for unsupervised feature selection called GAk-MEANS,which combines the genetic algorithm(GA)approach with the classical k-Means algorithm.In the proposed algorithm,a new fitness func-tion is designed in addition to new smart crossover and mutation operators.The effectiveness of this algorithm is demonstrated on various datasets.Fur-thermore,the performance of GAk-MEANS has been compared with other genetic algorithms,such as the genetic algorithm using the Sammon Error Function and the genetic algorithm using the Sum of Squared Error Function.Additionally,the performance of GAk-MEANS is compared with the state-of-the-art statistical unsupervised feature selection techniques.Experimental results show that GAk-MEANS consistently selects subsets of features that result in better classification accuracy compared to others.In particular,GAk-MEANS is able to significantly reduce the size of the subset of selected features by an average of 86.35%(72%–96.14%),which leads to an increase of the accuracy by an average of 3.78%(1.05%–6.32%)compared to using all features.When compared with the genetic algorithm using the Sammon Error Function,GAk-MEANS is able to reduce the size of the subset of selected features by 41.29%on average,improve the accuracy by 5.37%,and reduce the time by 70.71%.When compared with the genetic algorithm using the Sum of Squared Error Function,GAk-MEANS on average is able to reduce the size of the subset of selected features by 15.91%,and improve the accuracy by 9.81%,but the time is increased by a factor of 3.When compared with the machine-learning based methods,we observed that GAk-MEANS is able to increase the accuracy by 13.67%on average with an 88.76%average increase in time.

Application of a neural network system combined with genetic algorithm to rank coalbed methane reservoirs in the order of exploitation priority

A new method based on the combination of a neural network and a genetic algorithm was proposed to rank the order of exploitation priority of coalbed methane reservoirs. The neural network was used to acquire the weights of reservoir parameters through sample training and genetic algorithm was used to optimize the initial connection weights of nerve cells in case the neural network fell into a local minimum. Additionally, subordinate functions of each parameter were established to normalize the actual values of parameters of coalbed methane reservoirs in the range between zero and unity. Eventually, evaluation values of all coalbed methane reservoirs could be obtained by using the comprehensive evaluation method, which is the basis to rank the coalbed methane reservoirs in the order of exploitation priority. The greater the evaluation value, the higher the exploitation priority. The ranking method was verified in this paper by ten exploited coalbed methane reservoirs in China. The evaluation results are in agreement with the actual exploitation cases. The method can ensure the truthfulness and credibility of the weights of parameters and avoid the subjectivity caused by experts. Furthermore, the probability of falling into local minima is reduced, because genetic the algorithm is used to optimize the neural network system.

GA-iForest: An Efficient Isolated Forest Framework Based on Genetic Algorithm for Numerical Data Outlier Detection

With the development of data age,data quality has become one of the problems that people pay much attention to.As a field of data mining,outlier detection is related to the quality of data.The isolated forest algorithm is one of the more prominent numerical data outlier detection algorithms in recent years.In the process of constructing the isolation tree by the isolated forest algorithm,as the isolation tree is continuously generated,the difference of isolation trees will gradually decrease or even no difference,which will result in the waste of memory and reduced efficiency of outlier detection.And in the constructed isolation trees,some isolation trees cannot detect outlier.In this paper,an improved iForest-based method GA-iForest is proposed.This method optimizes the isolated forest by selecting some better isolation trees according to the detection accuracy and the difference of isolation trees,thereby reducing some duplicate,similar and poor detection isolation trees and improving the accuracy and stability of outlier detection.In the experiment,Ubuntu system and Spark platform are used to build the experiment environment.The outlier datasets provided by ODDS are used as test.According to indicators such as the accuracy,recall rate,ROC curves,AUC and execution time,the performance of the proposed method is evaluated.Experimental results show that the proposed method can not only improve the accuracy and stability of outlier detection,but also reduce the number of isolation trees by 20%-40%compared with the original iForest method.

Cobalt crust recognition based on kernel Fisher discriminant analysis and genetic algorithm in reverberation environment

Recognition of substrates in cobalt crust mining areas can improve mining efficiency.Aiming at the problem of unsatisfactory performance of using single feature to recognize the seabed material of the cobalt crust mining area,a method based on multiple-feature sets is proposed.Features of the target echoes are extracted by linear prediction method and wavelet analysis methods,and the linear prediction coefficient and linear prediction cepstrum coefficient are also extracted.Meanwhile,the characteristic matrices of modulus maxima,sub-band energy and multi-resolution singular spectrum entropy are obtained,respectively.The resulting features are subsequently compressed by kernel Fisher discriminant analysis(KFDA),the output features are selected using genetic algorithm(GA)to obtain optimal feature subsets,and recognition results of classifier are chosen as genetic fitness function.The advantages of this method are that it can describe the signal features more comprehensively and select the favorable features and remove the redundant features to the greatest extent.The experimental results show the better performance of the proposed method in comparison with only using KFDA or GA.

Grid-Based Pseudo-Parallel Genetic Algorithm and Its Application

Aimed at the problems of premature and lower convergence of simple genetic algorithms （SGA）, three ideas --partition the whole search uniformly, multi-genetic operators and multi-populations evolving independently are introduced, and a grid-based pseudo-parallel genetic algorithms （GPPGA） is put forward. Thereafter, the analysis of premature and convergence of GPPGA is made. In the end, GPPGA is tested by both six-peak camel back function, Rosenbrock function and BP network. The result shows the feasibility and effectiveness of GPPGA in overcoming premature and improving convergence speed and accuracy.

Optimization of Submarine Hydrodynamic Coefficients Based on Immune Genetic Algorithm

Aiming at the demand for optimization of hydrodynamic coefficients in submarine's motion equations,an adaptive weight immune genetic algorithm was proposed to optimize hydrodynamic coefficients in motion equations.Some hydrodynamic coefficients of high sensitivity to control and maneuver were chosen as the optimization objects in the algorithm.By using adaptive weight method to determine the weight and target function,the multi-objective optimization could be translated into single-objective optimization.For a certain kind of submarine,three typical maneuvers were chosen to be the objects of study:overshoot maneuver in horizontal plane,overshoot maneuver in vertical plane and turning circle maneuver in horizontal plane.From the results of computer simulations using primal hydrodynamic coefficient and optimized hydrodynamic coefficient,the efficiency of proposed method is proved.

Automatic Text Summarization Using Genetic Algorithm and Repetitive Patterns

Taking into account the increasing volume of text documents,automatic summarization is one of the important tools for quick and optimal utilization of such sources.Automatic summarization is a text compression process for producing a shorter document in order to quickly access the important goals and main features of the input document.In this study,a novel method is introduced for selective text summarization using the genetic algorithm and generation of repetitive patterns.One of the important features of the proposed summarization is to identify and extract the relationship between the main features of the input text and the creation of repetitive patterns in order to produce and optimize the vector of the main document features in the production of the summary document compared to other previous methods.In this study,attempts were made to encompass all the main parameters of the summary text including unambiguous summary with the highest precision,continuity and consistency.To investigate the efficiency of the proposed algorithm,the results of the study were evaluated with respect to the precision and recall criteria.The results of the study evaluation showed the optimization the dimensions of the features and generation of a sequence of summary document sentences having the most consistency with the main goals and features of the input document.

Impact of Genetic Algorithm for the Diagnosis of Breast Cancer: Literature Review

In recent research from the total number of new cancer cases in Africa about 29.46% and in Ethiopia 31.85% are breast cancer cases. 25.84% of all cancer related death is from breast cancer. One of the challenges in the treatment of breast cancer is early detection. Researchers agreed that, improving the preventive mechanism of breast cancer is an early predicting and detecting model. Research efforts are continuing to present different solution approaches using advanced techniques of Artificial intelligence (AI), Machine learning (ML), Deep Learning (DL), and Computational Intelligence as well. A genetic algorithm is a hyper-parameter optimization algorithm that belongs to the class of evolutionary algorithms. Genetic Algorithm (GA) is used for complex search spaces for search and optimization. This reviewed literature paper shows the positive effect of GA in the diagnosis of breast cancer on AI algorithms.

Research on Optimizing Computer Network Structure based on Genetic Algorithm and Modified Convex Optimization Theory

In this paper, we report in-depth analysis and research on the optimizing computer network structure based on genetic algorithm and modified convex optimization theory. Machine learning method has been widely used in the background and one of its core problems is to solve the optimization problem. Unlike traditional batch algorithm, stochastic gradient descent algorithm in each iteration calculation, the optimization of a single sample point only losses could greatly reduce the memory overhead. The experiment illustrates the feasibility of our proposed approach.

Distributed Generators Location and Capacity Effect on Voltage Profile Improvement and Power Losses Reduction Using Genetic Algorithm

This paper presents a powerful approach to find the optimal size and location of distributed generation units in a distribution system using GA （Genetic Optimization algorithm）. It is proved that GA method is fast and easy tool to enable the planners to select accurate and the optimum size of generators to improve the system voltage profile in addition to reduce the active and reactive power loss. GA fitness function is introduced including the active power losses, reactive power losses and the cumulative voltage deviation variables with selecting weight of each variable. GA fitness function is subjected to voltage constraints, active and reactive power losses constraints and DG size constraint.

Parameters selection in gene selection using Gaussian kernel support vector machines by genetic algorithm

In microarray-based cancer classification, gene selection is an important issue owing to the large number of variables and small number of samples as well as its non-linearity. It is difficult to get satisfying results by using conventional linear sta- tistical methods. Recursive feature elimination based on support vector machine (SVM RFE) is an effective algorithm for gene selection and cancer classification, which are integrated into a consistent framework. In this paper, we propose a new method to select parameters of the aforementioned algorithm implemented with Gaussian kernel SVMs as better alternatives to the common practice of selecting the apparently best parameters by using a genetic algorithm to search for a couple of optimal parameter. Fast implementation issues for this method are also discussed for pragmatic reasons. The proposed method was tested on two repre- sentative hereditary breast cancer and acute leukaemia datasets. The experimental results indicate that the proposed method per- forms well in selecting genes and achieves high classification accuracies with these genes.

Optimization of QoS Parameters in Cognitive Radio Using Combination of Two Crossover Methods in Genetic Algorithm

Radio Cognitive (RC) is the new concept introduced to improve spectrum utilization in wireless communication and present important research field to resolve the spectrum scarcity problem. The powerful ability of CR to change and adapt its transmit parameters according to environmental sensed parameters, makes CR as the leading technology to manage spectrum allocation and respond to QoS provisioning. In this paper, we assume that the radio environment has been sensed and that the SU specifies QoS requirements of the wireless application. We use genetic algorithm (GA) and propose crossover method called Combined Single-Heuristic Crossover. The weighted sum multi-objective approach is used to combine performance objectives functions discussed in this paper and BER approximate formula is considered.

Apple leaf disease identification using genetic algorithm and correlation based feature selection method

Apple leaf disease is one of the main factors to constrain the apple production and quality.It takes a long time to detect the diseases by using the traditional diagnostic approach,thus farmers often miss the best time to prevent and treat the diseases.Apple leaf disease recognition based on leaf image is an essential research topic in the field of computer vision,where the key task is to find an effective way to represent the diseased leaf images.In this research,based on image processing techniques and pattern recognition methods,an apple leaf disease recognition method was proposed.A color transformation structure for the input RGB(Red,Green and Blue)image was designed firstly and then RGB model was converted to HSI(Hue,Saturation and Intensity),YUV and gray models.The background was removed based on a specific threshold value,and then the disease spot image was segmented with region growing algorithm(RGA).Thirty-eight classifying features of color,texture and shape were extracted from each spot image.To reduce the dimensionality of the feature space and improve the accuracy of the apple leaf disease identification,the most valuable features were selected by combining genetic algorithm(GA)and correlation based feature selection(CFS).Finally,the diseases were recognized by SVM classifier.In the proposed method,the selected feature subset was globally optimum.The experimental results of more than 90%correct identification rate on the apple diseased leaf image database which contains 90 disease images for there kinds of apple leaf diseases,powdery mildew,mosaic and rust,demonstrate that the proposed method is feasible and effective.

Using Genetic Algorithms to Improve the Search of the Weight Space in Cascade－Correlation Neural Network

In this paper, we use the global search characteristics of genetic algorithms to help search the weight space of the neurons in the cascade-correlation architecture. The cascade-correlation learning architecture is a technique of training and building neural networks that starts with a simple network of neurons and adds additional neurons as they are needed to suit a particular problem. In our approach, instead ofmodifying the genetic algorithm to account for convergence problems, we search the weight-space using the genetic algorithm and then apply the gradient technique of Quickprop to optimize the weights. This hybrid algorithm which is a combination of genetic algorithms and cascade-correlation is applied to the two spirals problem. We also use our algorithm in the prediction of the cyclic oxidation resistance of Ni- and Co-base superalloys.