Fuzzy performance evaluation of Evolutionary Algorithms based on extreme learning classifier

Identifying complex interactions among millions of single nucleotide polymorphisms (SNPs) is a key challenge in Genome-Wide Association Studies (GWAS), offering crucial insights into the genetic architecture of complex diseases. Evolutionary algorithm (EA)-based methods have gained significant attention for their global search capabilities, controllable runtime, and multi-objective optimization potential. However, when applied to high-dimensional GWAS datasets, many existing EA-based methods encounter challenges such as getting trapped in local optima and facing high computational demands. To address these issues, the evolutionary multitasking (EMT) paradigm presents a promising solution, enhancing population diversity and convergence speed through collaborative, cross-task knowledge sharing. Furthermore, the multi-tasking framework and EA can be seamlessly deployed across multiple Graphics Processing Units (GPUs), leveraging their high parallelism and aggregated memory bandwidth. Therefore, we introduce a GPU-powered evolutionary auxiliary multitasking algorithm (GEAMT) for fast SNP interaction detection. GEAMT first constructs a main task along with several low-dimensional auxiliary tasks to redefine the original task. The main task explores the entire search space, while the auxiliary tasks search distinct subspaces to enhance local optimization capabilities. In each iteration, the auxiliary tasks transfer high-quality information to the main task via an information transfer mechanism. Subsequently, an auxiliary task update strategy based on feature regrouping is employed to switch the search subspaces of the auxiliary tasks. The final results are derived from the Pareto-optimal solutions of the main task. Implemented across multiple GPUs, GEAMT achieves notable scalability and efficiency. Comprehensive experiments on both synthetic and real-world datasets demonstrate that GEAMT can significantly enhance search accuracy and speed up the search process.

An improved classification approach is proposed to solve the hot research problem of some complex multiclassification samples based on extreme learning machine (ELM). ELM was proposed based on the single‐hidden layer feed‐forward neural network (SLFNN). ELM is characterized by the easier parameter selection rules, the faster converge speed, the less human intervention, and so on. In order to further improve the classification precision of ELM, an improved generation method of the network structure of ELM is developed by dynamically adjusting the number of hidden nodes. The number change of the hidden nodes can serve as the computational updated step length of the ELM algorithm. In this paper, the improved algorithm can be called the variable step incremental extreme learning machine (VSI‐ELM). In order to verify the effect of the hidden layer nodes on the performance of ELM, an open‐source machine learning database (University of California, Irvine (UCI)) is provided by the performance test data sets. The regression and classification experiments are used to study the performance of the VSI‐ELM model, respectively. The experimental results show that the VSI‐ELM algorithm is valid. The classification of different degrees of broken wires is now still a problem in the nondestructive testing of hoisting wire rope. The magnetic flux leakage (MFL) method of wire rope is an efficient nondestructive method which plays an important role in safety evaluation. Identifying the proposed VSI‐ELM model is effective and reliable for actually applying data, and it is used to identify the classification problem of different types of samples from MFL signals. The final experimental results show that the VSI‐ELM algorithm is of faster classification speed and higher classification accuracy of different broken wires.

This paper proposes a bio-inspired evolutionary computational algorithm for structure topology optimization. It integrates the merits of evolutionary structure optimization and level set method for structure topology optimization. Traditional Level Set Method algorithm depends on the initial topology to some extent. New holes cannot be evolved within the updated topology during the optimization iteration. The algorithm proposed in this paper combines the merits of ESO techniques with that of LSM scheme, allowing new holes to be automatically inserted in regions with low deformation energy at prescribed iterations of the optimization. The nodal neighboring region is adopted in the proposed algorithm. Numerical example shows that good result can be gotten through less optimization iteration. The approach can solve complex structures easily, in which holes cannot be properly layed out in advance. The proposed method considerably improves the ability of LSM to find the optimal topology. The validity and efficiency of the proposed algorithm are supported by some benchmark examples in this paper.

Photonic neural networks offer a promising alternative to traditional electronic systems for machine learning accelerators due to their low latency and energy efficiency. However, the challenge of implementing the backpropagation algorithm during training has limited their development. To address this, alternative machine learning schemes, such as extreme learning machines (ELMs), are proposed. ELMs use a random hidden layer to increase the feature space dimensionality, requiring only the output layer to be trained through linear regression, thus reducing training complexity. Here, a programmable photonic extreme learning machine (PPELM) is experimentally demonstrated using a hexagonal waveguide mesh, and which enables to program directly on chip the input feature vector and the random hidden layer. This system also permits to apply the nonlinearity directly on‐chip by using the system's integrated photodetecting elements. Using the PPELM, three different complex classification tasks are solved successfully. Additionally, two techniques are also proposed and demonstrated to increase the accuracy of the models and reduce their variability using an evolutionary algorithm and a wavelength division multiplexing approach, obtaining excellent performance. These results show that programmable photonic processors may become a feasible way to train competitive machine learning models on a versatile and compact platform.

Financial time series forecasting has been a challenge for time series analysts and researchers because it is noisy, nonstationary and chaotic. To overcome this limitation, this study uses empirical mode decomposition (EMD) and phase space reconstruction (PSR) to assist in the task of financial time series forecasting. In addition, we propose an approach that combines these two data preprocessing methods with extreme learning machine (ELM). The approach contains four steps as follows. (1) EMD is used to decompose the dynamics of the exchange rate time series into several components of intrinsic mode function (IMF) and one residual component. (2) The IMF and residual time series phase space is reconstructed to reveal its unseen dynamics according to the optimum time delay $$\tau $$ź and embedding dimension m. (3) The reconstructed time series datasets are divided into two datasets: training and testing, in which the training datasets are used to build ELM models. (4) A regression forecast model is set up for each IMF as well as the residual component by using ELM. The final prediction results are obtained by compositing the prediction values. To verify the effectiveness of the proposed approach, four exchange rates are chosen as the forecasting targets. Compared with some existing state-of-the-art models, the proposed approach yields superior results. Academically, we demonstrated the validity and superiority of the proposed approach that integrates EMD, PSR, and ELM. Corporations or individuals can apply the results of this study to acquire accurate exchange rate information and reduce exchange rate expenses.

Welding parameters play a significant role in determining the bead geometry and hence the quality of the weld joint. To further improve prediction accuracy and optimization quality of laser brazing, the published experiment results are utilized to build a prediction model of top and bottom width of weld bead and further establish an optimization model by a novel hybrid extreme learning machine and genetic algorithm method. Firstly, about two-third experiment results are used to train the extreme learning machine network for suitable weights, and then the rest one-third experiments are selected as a test set to illustrate the validity and reliability of the prediction network. Then, by regarding the prediction values from the extreme learning machine as the fitness values of genetic algorithm, optimal results of the inputs and outputs are obtained through the procedure of selection, crossover, and mutation. Eventually, the final optimization results are confirmed by verification experiments. Meanwhile, the hybrid model is more accurate and stable than that using back propagation neural network and genetic algorithm. In the whole, the proposed method in this paper is an effective and accurate way for optimizing laser brazing welding parameters and guiding the actual welding process.

Performing a local search around solutions found by an evolutionary algorithm is a common practice. Local search is well known to significantly improve the solutions, in particular in the case of combinatorial problems. In this paper a new local search procedure is proposed that uses a locally established utopia point. In the tests in which several instances of the Travelling Salesman Problem (TSP) were solved using an evolutionary algorithm the proposed local search procedure outperformed a local search procedure based on Pareto dominance. Because the local search is focused on improving individual solutions and the multiobjective evolutionary algorithm can improve diversity, various strategies of sharing computational resources between the evolutionary algorithm and the local search are used in this paper. The results attained by the tested methods are compared with respect to computation time, which allows a fair comparison between strategies that distribute computational resources between the evolutionary optimization and the local search in various proportions.

In previous work, we proposed a neural network approach to estimate the blocking probability of optical networks with fixed routing. The neural network was implemented by the extreme learning machine (ELM) framework, in which the training inputs were the optical network parameters, and the output was the overall blocking probability. The numerical results showed that the neural-network-based estimation was accurate and thousands of times faster than a computer simulation. In this paper, we apply the neural network approach to optical circuit switching (OCS) networks with fixed-alternate routing and improve the training method by using an enhancement of ELM framework. Unlike the previous ELM framework, the enhancement of ELM framework provides a random-search-based selection phase for the hidden nodes during the training step. As a result, similar performance can be achieved using fewer hidden nodes than the previous ELM framework. The numerical results show that the new enhancement of ELM training algorithm provides more accurate blocking probability estimates while reducing the required number of hidden nodes by a third compared with the previous ELM training algorithm. Furthermore, for some light traffic loading situations, our new training algorithm is hundreds of times more accurate than the existing well-known analytical approximation method.

Evolutionary algorithms (EAs) for solving constraint satisfaction problems (CSPs) can be roughly divided into two classes: EAs with adaptive fitness functions and heuristic-based EAs. A.E. Eiben et al. (1998) compared effective EAs of the first class experimentally using a large set of benchmark instances consisting of randomly-generated binary CSPs. In this paper, we complete this comparison by performing the same experiments using three of the most effective heuristic-based EAs. The results of our experiments indicate that the three heuristic-based EAs have similar performances on random binary CSPs. Comparing these results with those of A.E. Eiben et al., we are able to identify the best EA for binary CSPs as the algorithm introduced by G. Dozier et al. (1994), which uses a heuristic as well as an adaptive fitness function.

TU34. ASSOCIATION BETWEEN DEPRESSION DIAGNOSIS, POLYGENIC RISK FOR DEPRESSION AND ANTIHYPERTENSIVE MEDICATION NON-PERSISTENCE

A method using rough set feature selection and extreme learning machine (ELM) whose learning strategy and hidden node parameters are optimized by self-adaptive differential evolution (SaDE) algorithm for classification of breast masses is investigated. A pathologically proven database of 140 breast ultrasound images, including 80 benign and 60 malignant, is used for this study. A fast nonlocal means algorithm is applied for speckle noise removal, and multiresolution analysis of undecimated discrete wavelet transform is used for accurate segmentation of breast lesions. A total of 34 features, including 29 textural and five morphological, are applied to a [Formula: see text]-fold cross-validation scheme, in which more relevant features are selected by quick-reduct algorithm, and the breast masses are discriminated into benign or malignant using SaDE-ELM classifier. The diagnosis accuracy of the system is assessed using parameters, such as accuracy (Ac), sensitivity (Se), specificity (Sp), positive predictive value (PPV), negative predictive value (NPV), Matthew's correlation coefficient (MCC), and area ([Formula: see text]) under receiver operating characteristics curve. The performance of the proposed system is also compared with other classifiers, such as support vector machine and ELM. The results indicated that the proposed SaDE algorithm has superior performance with [Formula: see text], [Formula: see text], [Formula: see text], [Formula: see text], [Formula: see text], [Formula: see text], and [Formula: see text] compared to other classifiers.

Quantum neural computing has nowadays attracted much attention, and tends to be a candidate to improve the computational efficiency of neural networks. In this paper, a new quantum neural network (QNN) is proposed based on quantum mechanics of superposition and collapse, etc. Instead of gradient descent methods and evolutionary algorithms, extreme learning machine (ELM) is introduced to analytically identify the parameters of the QNN. The ELM-QNN model is applied to the online and real-time assessment of the syngas components in a Texaco gasification process. The application would effectively avoid the problems of time delay and low accuracy which result from the manual analysis. In order to eliminate the redundant information stored in variables, principal component analysis (PCA) is adopted to reduce the number of input variables of ELM-QNN. The results indicate that ELM-QNN combined with PCA method has satisfied computational accuracy and efficiency. The PCA-ELM-QNN is very capable of being used for the real-time measurement of Texaco syngas components.KeywordsExtreme learning machineQuantum neural networkTexaco gasificationSyngas componentPrincipal component analysis

Aim) Pathological brain detection (PBD) systems aim to assist and even replace neuroradiologists to make decisions for patients. This review offers a comprehensive and quantitative comparison for PBD systems by artificial intelligence in magnetic resonance imaging (MRI) scanning. (Method) We first investigated four categories of brain diseases, including neoplastic disease, neurodegenerative disease, cerebrovascular disease, and inflammation. Next, we introduced important MRI techniques, such as the shimming, water and fat suppression, and three advanced imaging modalities (functional MRI, diffusion tensor imaging, and magnetic resonance spectroscopic imaging). Then, we discussed four image preprocessing techniques (image denoising, slice selection, brain extraction, spatial normalization, and intensity normalization), seven feature representation techniques (shape, moment, wavelet, statistics, entropy, gray level co-occurrence matrix, and Fourier transform), and two dimension reduction techniques (feature selection and feature extraction). Afterwards, we studied classification related methods: six learning models (decision tree, extreme learning machine, k-nearest neighbors, naive Bayes classifier, support vector machine, feed-forward neural network), five kernel functions (linear, homogeneous and inhomogeneous polynomial, radial basis function, and sigmoid), and three types of optimization methods (evolutionary algorithm, stochastic optimization, and swarm intelligence). (Results) We introduced three benchmark datasets and used K-fold stratified cross validation to avoid overfitting. We presented a detailed quantitative comparison among 44 state-of-theart PBD algorithms and discussed their advantages and limitations. (Discussions) Artificial intelligence is now making stride in the PBD field and enjoys a fair amount of success. In the future, semi-supervised learning and transfer learning techniques may be potential breakthroughs to develop PBD systems.

Modeling the rate of penetration (ROP) plays a fundamental role in drilling optimization since the achievement of an optimum ROP can drastically reduce the overall cost of drilling activities. Evolved Extreme learning machine (ELM) with the evolutionary algorithms and multi-layer perceptron with Levenberg-Marquardt training algorithm (MLP-LMA) were proposed in this study to predict ROP. This paper focused mainly on two aspects. The first one was the investigation of the whale optimization algorithm (WOA) to optimize the weights and biases between input and hidden layers of ELM to enhance its prediction accuracy. The other was to adopt a prediction methodology that seeks to update the predictive model at each formation in order to reduce the dimension of input data and mitigate the effect of non real-time data such as the formation properties on the bit speed prediction. The prediction models were trained and tested using 3561 data points gathered from an Algerian field. The statistical and graphical evaluation criteria show that the ELM-WOA exhibited higher accuracy and generalization performance compared with the ELM-PSO and MLP-LMA. Furthermore, ELM-WOA was compared with two well-known ROP correlations in the literature, and the comparison results reveal that the proposed ELM-WOA model is superior to the pre-existing correlations. The findings of this study can help for the achievement of an optimum ROP and the reduction of the non-productive time. In addition, the outputs of this study can be used as an objective function during the real-time optimization of the drilling operation.

Despite the success of Evolutionary Algorithms in solving complex problems, they may require many function evaluations. This becomes an issue when dealing with costly problems. Surrogate models may overcome this difficulty, though their use in problems with medium to large dimensionality is underexplored in the literature. Problems with multiple conflicting objectives can be formulated as Multi-objective Optimization Problems (MOPs). MOPs have received a great attention lately, mainly with Multi-objective Evolutionary Algorithms (MOEAs). This paper proposes ELMOEA/D-DE, a surrogate-assisted MOEA, for solving expensive MOPs in small evaluation budgets. ELMOEA/D-DE encompasses a state-of-the-art MOEA based on decomposition, Differential Evolution (DE) operators and Extreme Learning Machines. This paper tests three variants of ELMOEA/D-DE, using different DE operators, for solving five known benchmark MOPs with 10 to 60 decision variables. All variants achieve good results in terms of hyper volume metric and the best variant with operator DE/rand/1/bin is compared with two state-of-the-art approaches (MOEA/D-RBF and a non-surrogate-based MOEA), achieving the best results in all but one problems instances.