Comparison of debris flow susceptibility assessment methods:support vector machine,particle swarm optimization,and feature selection techniques

The selection of important factors in machine learning-based susceptibility assessments is crucial to obtain reliable susceptibility results.In this study,metaheuristic optimization and feature selection techniques were applied to identify the most important input parameters for mapping debris flow susceptibility in the southern mountain area of Chengde City in Hebei Province,China,by using machine learning algorithms.In total,133 historical debris flow records and 16 related factors were selected.The support vector machine(SVM)was first used as the base classifier,and then a hybrid model was introduced by a two-step process.First,the particle swarm optimization(PSO)algorithm was employed to select the SVM model hyperparameters.Second,two feature selection algorithms,namely principal component analysis(PCA)and PSO,were integrated into the PSO-based SVM model,which generated the PCA-PSO-SVM and FS-PSO-SVM models,respectively.Three statistical metrics(accuracy,recall,and specificity)and the area under the receiver operating characteristic curve(AUC)were employed to evaluate and validate the performance of the models.The results indicated that the feature selection-based models exhibited the best performance,followed by the PSO-based SVM and SVM models.Moreover,the performance of the FS-PSO-SVM model was better than that of the PCA-PSO-SVM model,showing the highest AUC,accuracy,recall,and specificity values in both the training and testing processes.It was found that the selection of optimal features is crucial to improving the reliability of debris flow susceptibility assessment results.Moreover,the PSO algorithm was found to be not only an effective tool for hyperparameter optimization,but also a useful feature selection algorithm to improve prediction accuracies of debris flow susceptibility by using machine learning algorithms.The high and very high debris flow susceptibility zone appropriately covers 38.01%of the study area,where debris flow may occur under intensive human activities and heavy rainfall events.

A Reference Vector-Assisted Many-Objective Optimization Algorithm with Adaptive Niche Dominance Relation

It is still a huge challenge for traditional Pareto-dominatedmany-objective optimization algorithms to solve manyobjective optimization problems because these algorithms hardly maintain the balance between convergence and diversity and can only find a group of solutions focused on a small area on the Pareto front,resulting in poor performance of those algorithms.For this reason,we propose a reference vector-assisted algorithmwith an adaptive niche dominance relation,for short MaOEA-AR.The new dominance relation forms a niche based on the angle between candidate solutions.By comparing these solutions,the solutionwith the best convergence is found to be the non-dominated solution to improve the selection pressure.In reproduction,a mutation strategy of k-bit crossover and hybrid mutation is used to generate high-quality offspring.On 23 test problems with up to 15-objective,we compared the proposed algorithm with five state-of-the-art algorithms.The experimental results verified that the proposed algorithm is competitive.

A HEVC Video Steganalysis Method Using the Optimality of Motion Vector Prediction

Among steganalysis techniques,detection against MV(motion vector)domain-based video steganography in the HEVC(High Efficiency Video Coding)standard remains a challenging issue.For the purpose of improving the detection performance,this paper proposes a steganalysis method that can perfectly detectMV-based steganography in HEVC.Firstly,we define the local optimality of MVP(Motion Vector Prediction)based on the technology of AMVP(Advanced Motion Vector Prediction).Secondly,we analyze that in HEVC video,message embedding either usingMVP index orMVD(Motion Vector Difference)may destroy the above optimality of MVP.And then,we define the optimal rate of MVP as a steganalysis feature.Finally,we conduct steganalysis detection experiments on two general datasets for three popular steganographymethods and compare the performance with four state-ofthe-art steganalysis methods.The experimental results demonstrate the effectiveness of the proposed feature set.Furthermore,our method stands out for its practical applicability,requiring no model training and exhibiting low computational complexity,making it a viable solution for real-world scenarios.

HHO optimized support vector machine classifier for traditional Chinese medicine syndrome differentiation of diabetic retinopathy

AIM:To develop a classifier for traditional Chinese medicine(TCM)syndrome differentiation of diabetic retinopathy(DR),using optimized machine learning algorithms,which can provide the basis for TCM objective and intelligent syndrome differentiation.METHODS:Collated data on real-world DR cases were collected.A variety of machine learning methods were used to construct TCM syndrome classification model,and the best performance was selected as the basic model.Genetic Algorithm(GA)was used for feature selection to obtain the optimal feature combination.Harris Hawk Optimization(HHO)was used for parameter optimization,and a classification model based on feature selection and parameter optimization was constructed.The performance of the model was compared with other optimization algorithms.The models were evaluated with accuracy,precision,recall,and F1 score as indicators.RESULTS:Data on 970 cases that met screening requirements were collected.Support Vector Machine(SVM)was the best basic classification model.The accuracy rate of the model was 82.05%,the precision rate was 82.34%,the recall rate was 81.81%,and the F1 value was 81.76%.After GA screening,the optimal feature combination contained 37 feature values,which was consistent with TCM clinical practice.The model based on optimal combination and SVM(GA_SVM)had an accuracy improvement of 1.92%compared to the basic classifier.SVM model based on HHO and GA optimization(HHO_GA_SVM)had the best performance and convergence speed compared with other optimization algorithms.Compared with the basic classification model,the accuracy was improved by 3.51%.CONCLUSION:HHO and GA optimization can improve the model performance of SVM in TCM syndrome differentiation of DR.It provides a new method and research idea for TCM intelligent assisted syndrome differentiation.

Chaotic Elephant Herd Optimization with Machine Learning for Arabic Hate Speech Detection

In recent years,the usage of social networking sites has considerably increased in the Arab world.It has empowered individuals to express their opinions,especially in politics.Furthermore,various organizations that operate in the Arab countries have embraced social media in their day-to-day business activities at different scales.This is attributed to business owners’understanding of social media’s importance for business development.However,the Arabic morphology is too complicated to understand due to the availability of nearly 10,000 roots and more than 900 patterns that act as the basis for verbs and nouns.Hate speech over online social networking sites turns out to be a worldwide issue that reduces the cohesion of civil societies.In this background,the current study develops a Chaotic Elephant Herd Optimization with Machine Learning for Hate Speech Detection(CEHOML-HSD)model in the context of the Arabic language.The presented CEHOML-HSD model majorly concentrates on identifying and categorising the Arabic text into hate speech and normal.To attain this,the CEHOML-HSD model follows different sub-processes as discussed herewith.At the initial stage,the CEHOML-HSD model undergoes data pre-processing with the help of the TF-IDF vectorizer.Secondly,the Support Vector Machine(SVM)model is utilized to detect and classify the hate speech texts made in the Arabic language.Lastly,the CEHO approach is employed for fine-tuning the parameters involved in SVM.This CEHO approach is developed by combining the chaotic functions with the classical EHO algorithm.The design of the CEHO algorithm for parameter tuning shows the novelty of the work.A widespread experimental analysis was executed to validate the enhanced performance of the proposed CEHOML-HSD approach.The comparative study outcomes established the supremacy of the proposed CEHOML-HSD model over other approaches.

Recognition model and algorithm of projectiles by combining particle swarm optimization support vector and spatial-temporal constrain

In order to improve the recognition rate and accuracy rate of projectiles in six sky-screens intersection test system,this work proposes a new recognition method of projectiles by combining particle swarm optimization support vector and spatial-temporal constrain of six sky-screens detection sensor.Based on the measurement principle of the six sky-screens intersection test system and the characteristics of the output signal of the sky-screen,we analyze the existing problems regarding the recognition of projectiles.In order to optimize the projectile recognition effect,we use the support vector machine and basic particle swarm algorithm to form a new recognition algorithm.We set up the particle swarm algorithm optimization support vector projectile information recognition model that conforms to the six sky-screens intersection test system.We also construct a spatial-temporal constrain matching model based on the spatial geometric relationship of six sky-screen intersection,and form a new projectile signal recognition algorithm with six sky-screens spatial-temporal information constraints under the signal classification mechanism of particle swarm optimization algorithm support vector machine.Based on experiments,we obtain the optimal penalty and kernel function radius parameters in the PSO-SVM algorithm;we adjust the parameters of the support vector machine model,train the test signal data of every sky-screen,and gain the projectile signal classification results.Afterwards,according to the signal classification results,we calculate the coordinate parameters of the real projectile by using the spatial-temporal constrain of six sky-screens detection sensor,which verifies the feasibility of the proposed algorithm.

Precise Multi-Class Classification of Brain Tumor via Optimization Based Relevance Vector Machine

The objective of this research is to examine the use of feature selection and classification methods for distinguishing different types of brain tumors.The brain tumor is characterized by an anomalous proliferation of brain cells that can either be benign or malignant.Most tumors are misdiagnosed due to the variabil-ity and complexity of lesions,which reduces the survival rate in patients.Diagno-sis of brain tumors via computer vision algorithms is a challenging task.Segmentation and classification of brain tumors are currently one of the most essential surgical and pharmaceutical procedures.Traditional brain tumor identi-fication techniques require manual segmentation or handcrafted feature extraction that is error-prone and time-consuming.Hence the proposed research work is mainly focused on medical image processing,which takes Magnetic Resonance Imaging(MRI)images as input and performs preprocessing,segmentation,fea-ture extraction,feature selection,similarity measurement,and classification steps for identifying brain tumors.Initially,the medianfilter is practically applied to the input image to reduce the noise.The graph-cut segmentation technique is used to segment the tumor region.The texture feature is extracted from the output of the segmented image.The extracted feature is selected by using the Ant Colony Opti-mization(ACO)algorithm to improve the performance of the classifier.This prob-abilistic approach is used to solve computing issues.The Euclidean distance is used to calculate the degree of similarity for each extracted feature.The selected feature value is given to the Relevance Vector Machine(RVM)which is a multi-class classification technique.Finally,the tumor is classified as abnormal or nor-mal.The experimental result reveals that the proposed RVM technique gives a better accuracy range of 98.87%when compared to the traditional Support Vector Machine(SVM)technique.

Feature Extraction of Stored-grain Insects Based on Ant Colony Optimization and Support Vector Machine Algorithm

[Objective] The aim was to study the feature extraction of stored-grain insects based on ant colony optimization and support vector machine algorithm, and to explore the feasibility of the feature extraction of stored-grain insects. [Method] Through the analysis of feature extraction in the image recognition of the stored-grain insects, the recognition accuracy of the cross-validation training model in support vector machine （SVM） algorithm was taken as an important factor of the evaluation principle of feature extraction of stored-grain insects. The ant colony optimization （ACO） algorithm was applied to the automatic feature extraction of stored-grain insects. [Result] The algorithm extracted the optimal feature subspace of seven features from the 17 morphological features, including area and perimeter. The ninety image samples of the stored-grain insects were automatically recognized by the optimized SVM classifier, and the recognition accuracy was over 95%. [Conclusion] The experiment shows that the application of ant colony optimization to the feature extraction of grain insects is practical and feasible.

Mango Pest Detection Using Entropy-ELM with Whale Optimization Algorithm

Image processing,agricultural production,andfield monitoring are essential studies in the researchfield.Plant diseases have an impact on agricultural production and quality.Agricultural disease detection at a preliminary phase reduces economic losses and improves the quality of crops.Manually identifying the agricultural pests is usually evident in plants;also,it takes more time and is an expensive technique.A drone system has been developed to gather photographs over enormous regions such as farm areas and plantations.An atmosphere generates vast amounts of data as it is monitored closely;the evaluation of this big data would increase the production of agricultural production.This paper aims to identify pests in mango trees such as hoppers,mealybugs,inflorescence midges,fruitflies,and stem borers.Because of the massive volumes of large-scale high-dimensional big data collected,it is necessary to reduce the dimensionality of the input for classify-ing images.The community-based cumulative algorithm was used to classify the pests in the existing system.The proposed method uses the Entropy-ELM method with Whale Optimization to improve the classification in detecting pests in agricul-ture.The Entropy-ELM method with the Whale Optimization Algorithm(WOA)is used for feature selection,enhancing mango pests’classification accuracy.Support Vector Machines(SVMs)are especially effective for classifying while users get var-ious classes in which they are interested.They are created as suitable classifiers to categorize any dataset in Big Data effectively.The proposed Entropy-ELM-WOA is more capable compared to the existing systems.

Parameter selection of support vector machine for function approximation based on chaos optimization

The support vector machine （SVM） is a novel machine learning method, which has the ability to approximate nonlinear functions with arbitrary accuracy. Setting parameters well is very crucial for SVM learning results and generalization ability, and now there is no systematic, general method for parameter selection. In this article, the SVM parameter selection for function approximation is regarded as a compound optimization problem and a mutative scale chaos optimization algorithm is employed to search for optimal paraxneter values. The chaos optimization algorithm is an effective way for global optimal and the mutative scale chaos algorithm could improve the search efficiency and accuracy. Several simulation examples show the sensitivity of the SVM parameters and demonstrate the superiority of this proposed method for nonlinear function approximation.

Identifcation of large-scale goaf instability in underground mine using particle swarm optimization and support vector machine

An approach which combines particle swarm optimization and support vector machine(PSO–SVM)is proposed to forecast large-scale goaf instability(LSGI).Firstly,influencing factors of goaf safety are analyzed,and following parameters were selected as evaluation indexes in the LSGI:uniaxial compressive strength(UCS)of rock,elastic modulus(E)of rock,rock quality designation(RQD),area ration of pillar(Sp),the ratio of width to height of the pillar(w/h),depth of ore body(H),volume of goaf(V),dip of ore body(a)and area of goaf(Sg).Then LSGI forecasting model by PSO-SVM was established according to the influencing factors.The performance of hybrid model(PSO+SVM=PSO–SVM)has been compared with the grid search method of support vector machine(GSM–SVM)model.The actual data of 40 goafs are applied to research the forecasting ability of the proposed method,and two cases of underground mine are also validated by the proposed model.The results indicated that the heuristic algorithm of PSO can speed up the SVM parameter optimization search,and the predictive ability of the PSO–SVM model with the RBF kernel function is acceptable and robust,which might hold a high potential to become a useful tool in goaf risky prediction research.

Reliability-based multidisciplinary design optimization using incremental shifting vector strategy and its application in electronic product design

Use of multidisciplinary analysis in reliabilitybased design optimization(RBDO) results in the emergence of the important method of reliability-based multidisciplinary design optimization(RBMDO). To enhance the efficiency and convergence of the overall solution process,a decoupling algorithm for RBMDO is proposed herein.Firstly, to decouple the multidisciplinary analysis using the individual disciplinary feasible(IDF) approach, the RBMDO is converted into a conventional form of RBDO. Secondly,the incremental shifting vector(ISV) strategy is adopted to decouple the nested optimization of RBDO into a sequential iteration process composed of design optimization and reliability analysis, thereby improving the efficiency significantly. Finally, the proposed RBMDO method is applied to the design of two actual electronic products: an aerial camera and a car pad. For these two applications, two RBMDO models are created, each containing several finite element models(FEMs) and relatively strong coupling between the involved disciplines. The computational results demonstrate the effectiveness of the proposed method.

Parameter selection of support vector regression based on hybrid optimization algorithm and its application

Choosing optimal parameters for support vector regression （SVR） is an important step in SVR. design, which strongly affects the pefformance of SVR. In this paper, based on the analysis of influence of SVR parameters on generalization error, a new approach with two steps is proposed for selecting SVR parameters, First the kernel function and SVM parameters are optimized roughly through genetic algorithm, then the kernel parameter is finely adjusted by local linear search, This approach has been successfully applied to the prediction model of the sulfur content in hot metal. The experiment results show that the proposed approach can yield better generalization performance of SVR than other methods,

A Metamodeling Method Based on Support Vector Regression for Robust Optimization

Metamodeling techniques have been used in robust optimization to reduce the high computational cost of the uncertainty analysis and improve the performance of robust optimization problems with computationally expensive simulation models. Existing metamodels main focus on polynomial regression（PR）, neural networks（NN） and Kriging models, these metamodels are not well suited for large-scale robust optimization problems with small size training sets and high nonlinearity. To address the problem, a reduced approximation model technique based on support vector regression（SVR） is introduced in order to improve the accuracy of metamodels. A robust optimization method based on SVR is presented for problems that involve high dimension and nonlinear. First appropriate design parameter samples are selected by experimental design theories, then the response samples are obtained from the simulations such as finite element analysis, the SVR metamodel is constructed and treated as the mean and the variance of the objective performance functions. Combining other constraints, the robust optimization model is formed which can be solved by genetic algorithm （GA）. The applicability of the method developed is demonstrated using a case of two-bar structure system study. The performances of SVR were compared with those of PR, Kriging and back-propagation neural networks（BPNN）, the comparison results show that the prediction accuracy of the SVR metamodel was higher than those of other metamodels under uncertainty. The robust optimization solutions are near to the real result, and the proposed method is found to be accurate and efficient for robust optimization. This reaserch provides an efficient method for robust optimization problems with complex structure.

Nonlinear Optimization Method of Ship Floating Condition Calculation in Wave Based on Vector

Ship floating condition in regular waves is calculated. New equations controlling any ship＇s floating condition are proposed by use of the vector operation. This form is a nonlinear optimization problem which can be solved using the penalty function method with constant coefficients. And the solving process is accelerated by dichotomy. During the solving process, the ship＇s displacement and buoyant centre have been calculated by the integration of the ship surface according to the waterline. The ship surface is described using an accumulative chord length theory in order to determine the displacement, the buoyancy center and the waterline. The draught forming the waterline at each station can be found out by calculating the intersection of the ship surface and the wave surface. The results of an example indicate that this method is exact and efficient. It can calculate the ship floating condition in regular waves as well as simplify the calculation and improve the computational efficiency and the precision of results.

ε-strongly Efficient Solutions for Vector Optimization with Set-valued Maps

In locally convex Hausdorff topological vector spaces,ε-strongly efficient solutions for vector optimization with set-valued maps are discussed.Firstly,ε-strongly efficient point of set is introduced.Secondly,under the nearly cone-subconvexlike set-valued maps,the theorem of scalarization for vector optimization is obtained.Finally,optimality conditions of ε-strongly efficient solutions for vector optimization with generalized inequality constraints and equality constraints are obtained.

Support vector machine forecasting method improved by chaotic particle swarm optimization and its application

By adopting the chaotic searching to improve the global searching performance of the particle swarm optimization (PSO), and using the improved PSO to optimize the key parameters of the support vector machine (SVM) forecasting model, an improved SVM model named CPSO-SVM model was proposed. The new model was applied to predicting the short term load, and the improved effect of the new model was proved. The simulation results of the South China Power Market’s actual data show that the new method can effectively improve the forecast accuracy by 2.23% and 3.87%, respectively, compared with the PSO-SVM and SVM methods. Compared with that of the PSO-SVM and SVM methods, the time cost of the new model is only increased by 3.15 and 4.61 s, respectively, which indicates that the CPSO-SVM model gains significant improved effects.

Smart Fraud Detection in E-Transactions Using Synthetic Minority Oversampling and Binary Harris Hawks Optimization

Fraud Transactions are haunting the economy of many individuals with several factors across the globe.This research focuses on developing a mechanism by integrating various optimized machine-learning algorithms to ensure the security and integrity of digital transactions.This research proposes a novel methodology through three stages.Firstly,Synthetic Minority Oversampling Technique(SMOTE)is applied to get balanced data.Secondly,SMOTE is fed to the nature-inspired Meta Heuristic(MH)algorithm,namely Binary Harris Hawks Optimization(BinHHO),Binary Aquila Optimization(BAO),and Binary Grey Wolf Optimization(BGWO),for feature selection.BinHHO has performed well when compared with the other two.Thirdly,features from BinHHO are fed to the supervised learning algorithms to classify the transactions such as fraud and non-fraud.The efficiency of BinHHO is analyzed with other popular MH algorithms.The BinHHO has achieved the highest accuracy of 99.95%and demonstrates amore significant positive effect on the performance of the proposed model.

On vector variational-like inequalities and vector optimization problems with (G, α)-invexity

The aim of this paper is to study the relationship among Minty vector variational-like inequality problem, Stampacchia vector variational-like inequality problem and vector optimization problem involving (G, α)-invex functions. Furthermore, we establish equivalence among the solutions of weak formulations of Minty vector variational-like inequality problem, Stampacchia vector variational-like inequality problem and weak efficient solution of vector optimization problem under the assumption of (G, α)-invex functions. Examples are provided to elucidate our results.

Intelligent Optimization Methods for High-Dimensional Data Classification for Support Vector Machines

Support vector machine (SVM) is a popular pattern classification method with many application areas. SVM shows its outstanding performance in high-dimensional data classification. In the process of classification, SVM kernel parameter setting during the SVM training procedure, along with the feature selection significantly influences the classification accuracy. This paper proposes two novel intelligent optimization methods, which simultaneously determines the parameter values while discovering a subset of features to increase SVM classification accuracy. The study focuses on two evolutionary computing approaches to optimize the parameters of SVM: particle swarm optimization (PSO) and genetic algorithm (GA). And we combine above the two intelligent optimization methods with SVM to choose appropriate subset features and SVM parameters, which are termed GA-FSSVM (Genetic Algorithm-Feature Selection Support Vector Machines) and PSO-FSSVM(Particle Swarm Optimization-Feature Selection Support Vector Machines) models. Experimental results demonstrate that the classification accuracy by our proposed methods outperforms traditional grid search approach and many other approaches. Moreover, the result indicates that PSO-FSSVM can obtain higher classification accuracy than GA-FSSVM classification for hyperspectral data.