Hybrid Gene Selection Methods for High-Dimensional Lung Cancer Data Using Improved Arithmetic Optimization Algorithm

Lung cancer is among the most frequent cancers in the world,with over one million deaths per year.Classification is required for lung cancer diagnosis and therapy to be effective,accurate,and reliable.Gene expression microarrays have made it possible to find genetic biomarkers for cancer diagnosis and prediction in a high-throughput manner.Machine Learning(ML)has been widely used to diagnose and classify lung cancer where the performance of ML methods is evaluated to identify the appropriate technique.Identifying and selecting the gene expression patterns can help in lung cancer diagnoses and classification.Normally,microarrays include several genes and may cause confusion or false prediction.Therefore,the Arithmetic Optimization Algorithm(AOA)is used to identify the optimal gene subset to reduce the number of selected genes.Which can allow the classifiers to yield the best performance for lung cancer classification.In addition,we proposed a modified version of AOA which can work effectively on the high dimensional dataset.In the modified AOA,the features are ranked by their weights and are used to initialize the AOA population.The exploitation process of AOA is then enhanced by developing a local search algorithm based on two neighborhood strategies.Finally,the efficiency of the proposed methods was evaluated on gene expression datasets related to Lung cancer using stratified 4-fold cross-validation.The method’s efficacy in selecting the optimal gene subset is underscored by its ability to maintain feature proportions between 10%to 25%.Moreover,the approach significantly enhances lung cancer prediction accuracy.For instance,Lung_Harvard1 achieved an accuracy of 97.5%,Lung_Harvard2 and Lung_Michigan datasets both achieved 100%,Lung_Adenocarcinoma obtained an accuracy of 88.2%,and Lung_Ontario achieved an accuracy of 87.5%.In conclusion,the results indicate the potential promise of the proposed modified AOA approach in classifying microarray cancer data.

Optimization of Line Configuration and Balancing for Flexible Machining Lines

Line configuration and balancing is to select the type of line and allot a given set of operations as well as machines to a sequence of workstations to realize high-efficiency production. Most of the current researches for machining line configuration and balancing problems are related to dedicated transfer lines with dedicated machine workstations. With growing trends towards great product variety and fluctuations in market demand, dedicated transfer lines are being replaced with flexible machining line composed of identical CNC machines. This paper deals with the line configuration and balancing problem for flexible machining lines. The objective is to assign operations to workstations and find the sequence of execution, specify the number of machines in each workstation while minimizing the line cycle time and total number of machines. This problem is subject to precedence, clustering, accessibility and capacity constraints among the features, operations, setups and workstations. The mathematical model and heuristic algorithm based on feature group strategy and polychromatic sets theory are presented to find an optimal solution. The feature group strategy and polychromatic sets theory are used to establish constraint model. A heuristic operations sequencing and assignment algorithm is given. An industrial case study is carried out, and multiple optimal solutions in different line configurations are obtained. The case studying results show that the solutions with shorter cycle time and higher line balancing rate demonstrate the feasibility and effectiveness of the proposed algorithm. This research proposes a heuristic line configuration and balancing algorithm based on feature group strategy and polychromatic sets theory which is able to provide better solutions while achieving an improvement in computing time.

An Efficient Machine Learning Based Precoding Algorithm for Millimeter-Wave Massive MIMO

Millimeter wave communication works in the 30–300 GHz frequency range,and can obtain a very high bandwidth,which greatly improves the transmission rate of the communication system and becomes one of the key technologies of fifth-generation(5G).The smaller wavelength of the millimeter wave makes it possible to assemble a large number of antennas in a small aperture.The resulting array gain can compensate for the path loss of the millimeter wave.Utilizing this feature,the millimeter wave massive multiple-input multiple-output(MIMO)system uses a large antenna array at the base station.It enables the transmission of multiple data streams,making the system have a higher data transmission rate.In the millimeter wave massive MIMO system,the precoding technology uses the state information of the channel to adjust the transmission strategy at the transmitting end,and the receiving end performs equalization,so that users can better obtain the antenna multiplexing gain and improve the system capacity.This paper proposes an efficient algorithm based on machine learning(ML)for effective system performance in mmwave massive MIMO systems.The main idea is to optimize the adaptive connection structure to maximize the received signal power of each user and correlate the RF chain and base station antenna.Simulation results show that,the proposed algorithm effectively improved the system performance in terms of spectral efficiency and complexity as compared with existing algorithms.

Learning to optimize:A tutorial for continuous and mixed-integer optimization

Learning to optimize(L2O)stands at the intersection of traditional optimization and machine learning,utilizing the capabilities of machine learning to enhance conventional optimization techniques.As real-world optimization problems frequently share common structures,L2O provides a tool to exploit these structures for better or faster solutions.This tutorial dives deep into L2O techniques,introducing how to accelerate optimization algorithms,promptly estimate the solutions,or even reshape the optimization problem itself,making it more adaptive to real-world applications.By considering the prerequisites for successful applications of L2O and the structure of the optimization problems at hand,this tutorial provides a comprehensive guide for practitioners and researchers alike.

Online payment fraud:from anomaly detection to risk management

Online banking fraud occurs whenever a criminal can seize accounts and transfer funds from an individual’s online bank account.Successfully preventing this requires the detection of as many fraudsters as possible,without producing too many false alarms.This is a challenge for machine learning owing to the extremely imbalanced data and complexity of fraud.In addition,classical machine learning methods must be extended,minimizing expected financial losses.Finally,fraud can only be combated systematically and economically if the risks and costs in payment channels are known.We define three models that overcome these challenges:machine learning-based fraud detection,economic optimization of machine learning results,and a risk model to predict the risk of fraud while considering countermeasures.The models were tested utilizing real data.Our machine learning model alone reduces the expected and unexpected losses in the three aggregated payment channels by 15%compared to a benchmark consisting of static if-then rules.Optimizing the machine-learning model further reduces the expected losses by 52%.These results hold with a low false positive rate of 0.4%.Thus,the risk framework of the three models is viable from a business and risk perspective.

Inflatable Wing Design Parameter Optimization Using Orthogonal Testing and Support Vector Machines

The robust parameter design method is a traditional approach to robust experimental design that seeks to obtain the optimal combination of factors/levels. To overcome some of the defects of the inflatable wing parameter design method, this paper proposes an optimization design scheme based on orthogonal testing and support vector machines （SVMs）. Orthogonal testing design is used to estimate the appropriate initial value and variation domain of each variable to decrease the number of iterations and improve the identification accuracy and efficiency. Orthogonal tests consisting of three factors and three levels are designed to analyze the parameters of pressure, uniform applied load and the number of chambers that affect the bending response of inflatable wings. An SVM intelligent model is established and limited orthogonal test swatches are studied. Thus, the precise relationships between each parameter and product quality features, as well the signal-to-noise ratio （SNR）, can be obtained. This can guide general technological design optimization.

OPTIMAL ALGORITHM FOR NO TOOl-RETRACTIONS CONTOUR-PARALLEL OFFSET TOOL-PATH LINKING

A contour-parallel offset （CPO） tool-path linking algorithm is derived without toolretractions and with the largest practicability. The concept of ＂tool-path loop tree＂ （TPL-tree） providing the information on the parent/child relationships among the tool-path loops （TPLs） is presented. The direction, tool-path loop, leaf/branch, layer number, and the corresponding points of the TPL-tree are introduced. By defining TPL as a vector, and by traveling throughout the tree, a CPO tool-path without tool-retractions can be derived.

Intelligent Forecasting of Sintered Ore’s Chemical Components Based on SVM

Using object mathematical model of traditional control theory can not solve the forecasting problem of the chemical components of sintered ore.In order to control complicated chemical components in the manufacturing process of sintered ore,some key techniques for intelligent forecasting of the chemical components of sintered ore are studied in this paper.A new intelligent forecasting system based on SVM is proposed and realized.The results show that the accuracy of predictive value of every component is more than 90%.The application of our system in related companies is for more than one year and has shown satisfactory results.

Synchronous self-learning Pareto strategy An ensemble framework for vector and multi-criterion optimization

Purpose–In recent decades,development of effective methods for optimizing a set of conflicted objective functions has been absorbing an increasing interest from researchers.This refers to the essence of real-life engineering systems and complex natural mechanisms which are generally multi-modal,non-convex and multi-criterion.Until now,several deterministic and stochastic methods have been proposed to cope with such complex systems.Advanced soft computational methods such as evolutionary games(cooperative and non-cooperative),Pareto-based techniques,fuzzy evolutionary methods,cooperative bio-inspired algorithms and neuro-evolutionary systems have effectively come to the aid of researchers to build up efficient paradigms with application to vector optimization.The paper aims to discuss this issue.Design/methodology/approach–A novel hybrid algorithm called synchronous self-learning Pareto strategy(SSLPS)is presented for the sake of vector optimization.The method is the ensemble of evolutionary algorithms(EA),swarm intelligence(SI),adaptive version of self-organizing map(CSOM)and a data shuffling mechanism.EA are powerful numerical optimization algorithms capable of finding a global extreme point over a wide exploration domain.SI techniques(the swarm of bees in our case)can improve both intensification and robustness of exploration.CSOM network is an unsupervised learning methodology which learns the characteristics of non-dominated solutions and,thus,enhances the quality of the Pareto front.Findings–To prove the effectiveness of the proposed method,the authors engage a set of well-known benchmark functions and some well-known rival optimization methods.Additionally,SSLPS is employed for optimal design of shape memory alloy actuator as a nonlinear multi-modal real-world engineering problem.The experiments show the acceptable potential of SSLPS for handling both numerical and engineering multi-objective problems.Originality/value–To the author’s best knowledge,the proposed algorithm is among the rare multiobjective methods which fosters the use of automated unsupervised learning for increasing the intensity of Pareto front(while preserving the diversity).Also,the research evaluates the power of hybridization of SI and EA for efficient search.