Search

Swarm intelligence optimization algorithm has been proved to perform well in the field of parameter optimization. In order to further improve the performance of intelligent optimization algorithm, this paper proposes an improved and adaptive tunicate swarm algorithm (IMATSA) based on tunicate swarm algorithm (TSA). IMATSA improves TSA in the following four aspects: population diversity, local search convergence speed, jumping out of local optimal position, and balancing global and local search. Firstly, IMATSA adopts Tent map and quadratic interpolation to initialize population and enhance the diversity. Secondly, IMATSA uses Golden-Sine algorithm to accelerate the convergence of local search. Thirdly, in the process of global development, IMATSA adopts Levy flight and the improved Gauss disturbance method to adaptively improves and coordinates the ability of global development and local search. Then, this paper verifies the performance of IMATSA based on 14 benchmark functions experiment, ablation experiment, parameter optimization experiments of Support Vector Machine (SVM) and Gradient Boosting Decision Tree (GBDT), Wilcoxon signed rank test and image multi-threshold segmentation experiment with the performance metrics are convergence speed, convergence value, significance level P-value, Peak Signal-to-Noise Ratio (PSNR) and Standard Deviation (STD). Experimental results show that IMATSA performs better in three kinds of benchmark functions; each component of IMATSA has a positive effect on the performance; IMATSA performs better in parameter optimization experiments of SVM experiment and GBDT; there is significant difference between IMATSA and other algorithms by Wilcoxon signed rank test; in image segmentation, the performance is directly proportional to the number of thresholds, and compared with other algorithms, IMATSA has better comprehensive performance. [ABSTRACT FROM AUTHOR]

This paper presents a decision-making approach grounded in rough set theory and evidential reasoning to address the demand for expert decision-making in greenhouse environmental control systems. Furthermore, a decision-making model is developed by integrating the D-S evidence theory with an expert knowledge table for greenhouse environmental control systems. The model's reasoning process encompasses continuous attribute discretization, expert decision table formation, attribute reduction, and evidence combination reasoning. Firstly, the fuzzy C-means clustering algorithm is employed to discretize the original environmental data and cluster it. Subsequently, an attribute reduction algorithm based on information entropy is utilized to optimize the decision table by eliminating unnecessary conditional attributes in expert knowledge. The reduced indicators are then combined using evidential theory. Finally, suitable greenhouse control methods are determined by the confidence decision proposed by the D-S evidence theory. To assess the efficacy of this intelligent decision-making algorithm based on rough set and D-S evidence theory, its performance is compared with traditional SVM algorithms and small-shot learning algorithms. The results indicate that this proposed method significantly enhances the credibility of control decision-making processes, with an average running time of 0.002378s for the fusion decision algorithm and 0.017939s for the support vector machine (SVM) algorithm, respectively. The SVM accuracy rate after testing and training stands at 90.34%. Moreover, retraining based on information entropy attribute reduction leads to a correct decision rate increase of up to 100%. This method notably improves confidence levels in decision-making processes while reducing uncertainty and demonstrates reliability when applied in making decisions regarding greenhouse environments. [ABSTRACT FROM AUTHOR]

Internet of Things (IoT) as an emerging technology is widely used in various applications such as remote healthcare, smart environment, and intelligent transportation systems. It is necessary to address users' concerns about cost, ease of use, privacy, and comprehensive security to grow the popularity of this technology. Intrusion Detection System (IDS) plays an indispensable role in security and preventing unauthorized users to access authorized network resources through analyzing network patterns. Several techniques such as metaheuristic algorithms, machine learning, fuzzy logic, and artificial intelligence algorithms can be applied to increase the accuracy of IDS, feature selection, and network patterns classification. In this paper, a hybrid intrusion detection system based on Support Vector Machine (SVM) and Grey Wolf Optimization (GWO) is presented that utilizes the advantages of these algorithms. In the proposed approach, the support vector machine has been used to train and differentiate anomaly records from normal records and grey wolf optimization has been used to find the kernel function, feature selection, and adjust optimal parameters for the SVM in order to improve the classification. The conducted simulations prove that the proposed approach outperforms in terms of detection accuracy, precision, recall, and F-score on both NSL-KDD and TON_IoT datasets. [ABSTRACT FROM AUTHOR]

Background: Cancer diagnosis based on machine learning has become a popular application direction. Support vector machine (SVM), as a classical machine learning algorithm, has been widely used in cancer diagnosis because of its advantages in high-dimensional and small sample data. However, due to the high-dimensional feature space and high feature redundancy of gene expression data, SVM faces the problem of poor classification effect when dealing with such data. Methods: Based on this, this paper proposes a hybrid feature selection algorithm combining information gain and grouping particle swarm optimization (IG-GPSO). The algorithm firstly calculates the information gain values of the features and ranks them in descending order according to the value. Then, ranked features are grouped according to the information index, so that the features in the group are close, and the features outside the group are sparse. Finally, grouped features are searched using grouping PSO and evaluated according to in-group and out-group. Results: Experimental results show that the average accuracy (ACC) of the SVM on the feature subset selected by the IG-GPSO is 98.50%, which is significantly better than the traditional feature selection algorithm. Compared with KNN, the classification effect of the feature subset selected by the IG-GPSO is still optimal. In addition, the results of multiple comparison tests show that the feature selection effect of the IG-GPSO is significantly better than that of traditional feature selection algorithms. Conclusion: The feature subset selected by IG-GPSO not only has the best classification effect, but also has the least feature scale (FS). More importantly, the IG-GPSO significantly improves the ACC of SVM in cancer diagnostic. [ABSTRACT FROM AUTHOR]

The No Free Lunch Theorem tells us that no algorithm can beat other algorithms on all types of problems. The algorithm selection structure is proposed to select the most suitable algorithm from a set of algorithms for an unknown optimization problem. This paper introduces an innovative algorithm selection approach called the CNN-HT, which is a two-stage algorithm selection framework. In the first stage, a Convolutional Neural Network (CNN) is employed to classify problems. In the second stage, the Hypothesis Testing (HT) technique is used to suggest the best-performing algorithm based on the statistical analysis of the performance metric of algorithms that address various problem categories. The two-stage approach can adapt to different algorithm combinations without the need to retrain the entire model, and modifications can be made in the second stage only, which is an improvement of one-stage approaches. To provide a more general structure for the classification model, we adopt Exploratory Landscape Analysis (ELA) features of the problem as input and utilize feature selection techniques to reduce the redundant ones. In problem classification, the average accuracy of classifying problems using CNN is 96%, which demonstrates the advantages of CNN compared to Random Forest and Support Vector Machines. After feature selection, the accuracy increases to 98.8%, further improving the classification performance while reducing the computational cost. This demonstrates the effectiveness of the first stage of the CNN-HT method, which provides a basis for algorithm selection. In the experiments, CNN-HT shows the advantages of the second stage algorithm as well as good performance with better average rankings in different algorithm combinations compared to the individual algorithms and another algorithm combination approach. [ABSTRACT FROM AUTHOR]

Spatiotemporally mapping winter wheat is imperative for informing and shaping global food security policies. Traditional mapping methods heavily rely on sufficient and reliable samples obtained through labor-intensive fieldwork and manual sample collection. However, these methods are time-consuming, costly, and lack timely and continuous data collection. To address these challenges and fully leverage remote sensing big data and cloud computing platforms like Google Earth Engine (GEE), this paper developed an algorithm for Auto-Generating Winter Wheat Samples for mapping (AGWWS). The AGWWS utilizes historical samples to determine the optimal migration threshold by measuring Spectral Angle Distance (SAD), Euclidean Distance (ED), and Near-Infrared band Difference Index (NIRDI). This facilitates the auto-generation of winter wheat sample sets for the years 2000, 2005, 2010, 2015, and 2021. Approximately two-thirds of the samples were allocated for training, with the remaining one-third used for validating the mapping method, employing the One-Class Support Vector Machine (OCSVM). The Huang–Huai–Hai (HHH) Plain, a major winter wheat production region, was selected to perform the algorithm and subsequent analysis on. Different combinations of the hyper-parameters, gamma and nu, of the OCSVM based on the Gaussian Radial Basis Function Kernel were tested for each year. Following correlation analysis between the winter wheat area derived from the generated maps and the national statistical dataset at the city level, the map with the highest corresponding R2 was chosen as the AGWWS map for each year (0.77, 0.77, 0.80, 0.86, and 0.87 for 2000, 2005, 2010, 2015, and 2021, respectively). The AGWWS maps ultimately achieved an average Overall Accuracy of 81.65%. The study then explores the Non-Grain Production of Winter Wheat (NGPOWW) by analyzing winter wheat change maps from 2000–2005, 2005–2010, 2005–2010, and 2015–2021 in the HHH Plain. Despite an overall increase in the total planted area of winter wheat, the NGPOWW phenomena has led to concerning winter wheat planting marginalization. Compensatory winter wheat areas are notably situated in mountainous and suburban cultivated lands with low qualities. Consequently, despite the apparent expansion in planted areas, winter wheat production is anticipated to be adversely affected. The findings highlight the necessity for improved cultivated land protection policies monitoring the land quality of the compensation and setting strict quota limits on occupations. [ABSTRACT FROM AUTHOR]

In this paper, we present an innovative inertial navigation system (INS)/celestial navigation system (CNS)/scene-matching navigation (SMN) adaptive integrated navigation algorithm designed to achieve prolonged and highly precise navigation in sea areas. The algorithm establishes the structure of the INS/CNS/SMN integrated navigation system. To ensure the availability of CNS in the Nanhai Sea (South China Sea) area, a cloud and fog model is meticulously constructed. Three distinct types of sea area landmarks are defined, and an automated classification model for sea area landmarks, employing support vector machines (SVM), is developed. Corresponding matching methods and strategies for these landmarks are also delineated. Concurrently, the observable probability of each landmark is computed to generate a probability cloud, representing the usability of sea area landmarks. The proposed INS/CNS/SMN adaptive integrated navigation algorithm is simulated and validated across varied altitudes and trajectories in the sea area. The results show that CNS and SMN can dynamically assist INS in achieving prolonged and highly precise navigation. [ABSTRACT FROM AUTHOR]

Twin support vector regression (TSVR) has been widely applied in regression problems. TSVR seeks a pair of ε -insensitive proximal planes by solving two support vector machine type problems. TSVR assumes that the matrices appearing in the dual formulation are positive definite. However, in real-world scenarios, such an assumption may not be fulfilled and, hence, leads to suboptimal performance. ε -Twin support vector regression (ε -TSVR) improved the TSVR by introducing the regularisation term to avoid the singularity issues. Most of the twin support vector machine models involve the computation of matrix inverses. Also, TSVR implements the empirical risk minimization principle. In this paper, we propose an improved twin support vector regression (ITSVR) for brain age estimation by introducing different Lagrangian functions for the primal problems of the TSVR. The proposed ITSVR implements the structural risk minimization principle and avoids the computation of the matrix inverses. To solve the optimization problem more efficiently, we used successive overrelaxation (SOR) technique. We evaluated the proposed ITSVR on cognitively healthy subjects, mild cognitive impairment subjects and Alzheimer's disease subjects. The experimental results demonstrate that the proposed ITSVR has superior performance compared to the baseline models for brain age estimation. [ABSTRACT FROM AUTHOR]

With the widespread use of unmanned aerial vehicles (UAVs), spectrum resources are becoming less and less available. Better utilization of the spectrum can be achieved by spectrum prediction. In this paper, four algorithms, hidden Markov model (HMM), support vector machine (SVM), multi-layer perceptron (MLP), and long short-term memory neural network (LSTM-NN) algorithms, were introduced for the prediction of channel states in the radio-frequency spectrum. Experiments are conducted on a dataset. It was found from results that when the number of output sequence was fixed as 1 and the number of input channel state information (CSI) sequence was 1-20, the more input sequences were, the lower the error rate of the algorithm was; when the number of input CSI sequences was 20, the error rate of the LSTM algorithm was the lowest among several algorithms, which was 4.82%; when the number of input CSI sequenced was fixed as 1 and the future 1-15 CSI sequences were predicted, the more sequences need to be predicted was, the higher the error rate of the algorithm was; when 15 CSI sequences were predicted, the error rate of the LSTM algorithm was the lowest, 42.33%. The experimental results demonstrate that the LSTM algorithm is reliable in radiofrequency spectrum prediction and can be applied in practical UAV communication. [ABSTRACT FROM AUTHOR]

The existing one-class support vector machine algorithms are based on the idea of "minimum margin". They consider only the noise close to the space origin and are sensitive to noise. The purpose of this paper is to improve the anti-noise ability of the one-class support vector machine through the idea of "optimal margin distribution", which considers both of the noise close to the space origin and that far from the space origin. This paper proposes a novel One-Class Optimal Margin Distribution Machine (OCODM) method. This method maximizes the margin and minimizes the margin variance to optimize the margin distribution. The experimental results have shown that compared to the existing one-class support vector machine algorithms, this method has better robustness. The conclusion is that this method is a supplement of the existing one-class support vector machine algorithms and can enhance the anti-noise ability of existing methods. [ABSTRACT FROM AUTHOR]

Collecting and analyzing data from all devices to improve the efficiency of business processes is an important task of Industrial Internet of Things (IIoT). In the age of data explosion, extensive text data generated by the IIoT have given birth to a variety of text representation methods. The task of text representation is to convert the natural language to a form that computer can understand with retaining the original semantics. However, these methods are difficult to effectively extract the semantic features among words and distinguish polysemy in natural language. Combining the advantages of convolutional neural network (CNN) and variational autoencoder (VAE), this paper proposes an intelligent CNN-VAE text representation algorithm as an advanced learning method for social big data within next-generation IIoT, which help users identify the information collected by sensors and perform further processing. This method employs the convolution layer to capture the local features of the context and uses the variational technique to reconstruct feature space to make it conform to the normal distribution. In addition, the improved word2vec model based on topical word embedding (TWE) is utilized to add topical information to word vectors to distinguish polysemy. This paper takes the social big data as an example to illustrate the way of the proposed algorithm applied in the next-generation IIoT and utilizes Cnews dataset to verify the performance of proposed method with four evaluating metrics (i.e., recall, accuracy, precision, and F1-score). Experimental results indicate that the proposed method outperforms word2vec-avg and CNN-AE in K-nearest neighbor (KNN), random forest (RF), and support vector machine (SVM) classifiers and distinguishes polysemy effectively. [ABSTRACT FROM AUTHOR]

This paper presents the performance analysis of object detection algorithms using phase and statistical texture features. Robust metrics like accuracy and precision are used to perform the evaluation. Feature extraction is one of the prime requirements to represent an object. This paper provides a comprehensive and broad framework to phase feature and statistical feature extraction techniques and compares their performance in terms of accuracy and precision. In phase-based approach of object detection group of phase features are used to model the background. Whereas we represented the statistics of object by calculating GLCM features of the block images in statistical feature extraction methods. Support Vector machine algorithm is used to classify object. This method is developed to achieve higher accuracy and speed. Performance analysis of these two methods shows that phase feature is robust to illumination variations. Also, the obtained accuracy is good, but the computational complexity is high. Whereas co-occurrence matrix based statistical approach of object detection a good tradeoff between speed and accuracy. [ABSTRACT FROM AUTHOR]

This paper aims to provide results of empirical experiments on the accuracy of different machine learning algorithms for detecting spam messages, using a public dataset of spam messages. The originality of our study lies in the integration of topic modeling, specifically employing Latent Dirichlet Allocation (LDA) alongside machine learning algorithms for spam detection. By extracting hidden topics and uncovering patterns in spam and non-spam messages, we provide unique insights into the distinguishing characteristics of spam messages. Moreover, the integration of machine learning is a powerful tool in bolstering risk control measures ensuring the sustainability of digital platforms and communication channels. The research tests the accuracy of spam detection classifiers on an open-source dataset of spam messages. The key findings of this study reveal that the Logistic Regression classifier achieved the highest F score of 0.986, followed by the Support Vector Machine classifier with a score of 0.98 and the Naive Bayes classifier with a score of 0.955. The study concludes that Logistic Regression outperforms Naive Bayes and Support Vector Machine in text classification, particularly in spam detection, emphasizing the role of machine learning techniques in optimizing risk management strategies for sustained digital ecosystems. This capability stems from Logistic Regression's adeptness in modeling complex relationships, enabling it to achieve high accuracy on training and test datasets. [ABSTRACT FROM AUTHOR]

In the magnetic-suspension bearing-rotor system, the shape features of the rotor axis trajectory can directly reflect the system operation status and fault information. Accurately classifying the bearing faults can promptly find the cause of the fault and respond quickly and protect it. In this paper, in order to achieve fault identification by identifying and classifying the rotor axis trajectory, we use Hu moment invariants to extract feature vectors from the rotor axis trajectory to identify faults. We use imperial competitive algorithm to reduce redundant data and establish a directed acyclic graph support vector machine to classify and identify feature data. Compared with traditional classification models such as C4.5 and BP neural networks, the experimental results show that the support vector machine model based on Hu moment invariants and simulated annealing has a higher accuracy and robustness in small sample classification. It is suitable for intelligent identification and classification for bearing faults. [ABSTRACT FROM AUTHOR]

Twin support vector machine (TSVM) is a practical machine learning algorithm, whereas traditional TSVM can be limited for data with outliers or noises. To address this problem, we propose a novel TSVM with the symmetric LINEX loss function (SLTSVM) for robust classification. There are several advantages of our method: (1) The performance of the proposed SLTSVM for data with outliers or noise can be improved by using the symmetric LINEX loss function. (2) The introduction of regularization term can effectively improve the generalization ability of our model. (3) An efficient iterative algorithm is developed to solve the optimization problems of our SLTSVM. (4) The convergence and time complexity of the iterative algorithm are analyzed in detail. Furthermore, our model does not involve loss function parameter, which makes our method more competitive. Experimental results on synthetic, benchmark and image datasets with label noises and feature noises demonstrate that our proposed method slightly outperforms other state-of-the-art methods on most datasets. • This paper proposes SLTSVM by introducing symmetric LIENX loss function. • An interpretable method is proposed for selecting the loss parameter. • The convergence of the designed solution algorithm are further analyzed. • Experiments show that our method is efficient for data with outliers or noises. [ABSTRACT FROM AUTHOR]

The quality of sleep plays a crucial role in physical well-being, and individuals are becoming increasingly concerned about sleep quality and its associated health issues. Although various sleep monitoring devices exist, there remains a need for a highly accurate sleep state identification algorithm. To address this, we present a paper that utilizes machine learning techniques to identify human sleep states based on electroencephalogram (EEG) signals collected by an EEG instrument. We propose a model that incorporates two nonlinear characteristic parameters, MSE and PSE, extracted from artificially designed EEG signals as input. Additionally, we employ a Support Vector Machine (SVM) classifier algorithm to accurately identify sleep states, eliminating uncertainties associated with manually designed feature parameters. Experimental results demonstrate the superior accuracy of our proposed model for sleep state analysis, offering valuable insights for improving sleep quality and addressing related health concerns. [ABSTRACT FROM AUTHOR]

There is a widespread use of cluster-based routing in wireless sensor networks since it is the most energy-efficient. Idealizing cluster heads, on the other hand, is NP-hard and hence requires heuristic or metaheuristic approaches. However, while outperforming algorithms, metaheuristics computation time restricts its ability to respond to routing requests as rapidly as algorithms can today. A network's or an application's parameters can't be easily accommodated by routing methods. This paper offers the HMML, a combination model combining hybrid metaheuristics and machine-learning. Our HMML model makes use of an automated tuning metaheuristic (e.g. evolutionary algorithm) to fine-tune the heuristic technique for each specific configuration. For a variety of combinations, this is done. A network simulation is run using the modified heuristic algorithm in each configuration to arrive at a solution. As a result, a comprehensive dataset for a variety of conditions is produced (e.g., support vector machine). These characteristics include local (round-state), global (network-state), and application-specific aspects of the input feature vector. After training, the HMML model may be used to quickly cluster data. Machine learning's capacity to generalize helps us comprehend the metaheuristic algorithm's behavior in identifying optimal paths for previous configurations. Simulation studies show that HMML can adapt to varied applications while extending network life which increases upto 5% for total energy consumption. [ABSTRACT FROM AUTHOR]

This study utilizes classification models to provide a robust algorithm for imbalanced data where the minority class is of the interest, that is, in the context of default payments. In developing an integrated predictive accuracy algorithm, this study proposes machine learning classifiers and applies DNN, SVM, KNN, and ANN. The proposed algorithm utilizes a 30,000 imbalanced dataset to improve the accuracy of the prediction of default payments by implementing oversampling and undersampling strategies, such as synthetic minority oversampling technique (SMOTE), SVM SMOTE, random undersampling, and ALL-KNN. The results indicate that the SVM under the ALL-KNN sampling technique is able to achieve an accuracy of 98.6%, with the lowest cross entropy loss measurement of 0.028. Through the accurate implementation of the neural networks and neurons used in the proposed algorithm, this paper presents better insights into the functioning of the neural networks when used in conjunction with the resampling techniques. Using the methodology and algorithm presented in this study, credit risk assessments can be more accurately predicted in practical applications where most of the clients are categorized as non-default payments. [ABSTRACT FROM AUTHOR]

Identifying and assessing Parkinson's disease in its early stages is critical to effectively monitoring the disease's progression. Methodologies based on machine learning enhanced speech analysis are gaining popularity as the potential of this field is revealed. Acoustic features, in particular, are used in a variety of algorithms for machine learning and could serve as indicators of the general health of subjects' voices. In this research paper, a novel method is introduced for the automated detection of Parkinson's disease through speech signal analysis, a support vector machines classifier (SVM) and an Artificial Neural Network (ANN) are used to evaluate and classify the data based on two acoustic features: Bark Frequency Cepstral Coefficients (BFCC) and Mel Frequency Cepstral Coefficients (MFCC). These features are extracted from the denoised signals using Empirical Mode Decomposition (EMD). The most relevant results obtained for a dataset of 38 participants are by the BFCC coefficients with an accuracy up to 92.10%. These results confirm that EMD-BFCC-SVM method can contribute to the detection of Parkinson's disease. [ABSTRACT FROM AUTHOR]

With the deepening application of wearable devices in the field of indoor positioning, the mining and application of human behavior patterns based on new technologies such as mobile terminals, channel technologies and intelligent algorithms have gradually become a research hotspot in the field of intelligent positioning. At this stage, outdoor positioning satellite technology has been gradually improved, but it cannot work effectively in indoor environment, and indoor positioning technology has not formed a set of standard and effective scheme at this stage, which leads to a scene of a hundred contentions for indoor positioning technology. This paper proposes an indoor intelligent localization algorithm based on channel state information, which first forms the measurements of antenna subarrays by the fixed antenna subset arrays located in different paths to achieve the phase estimation based on channel state; then determines the AoA of the direct path from the target to the AP using ToF information and eliminates the STO noise of channel state information by unfolding the best linear fit of CSI phase; again the AoA and ToF estimates from multiple measurements are plotted in two-dimensional space, and the direct path possibility estimation is achieved by identifying the estimates through five clusters of Gaussian-averaged clustering algorithm; finally the coordinates of the target to be located are obtained by coupling direct propagation path, estimation clustering and least-squares estimation using three APs as the receiver and the target to be located as the transmitter. The simulation results show that the intelligent localization algorithm proposed in this paper is able to lack the localization accuracy at the decimeter level in the indoor localization environment with three fixed APs, and the average error is better than the localization algorithms of support vector machine, deep learning and limit learning. [ABSTRACT FROM AUTHOR]

In the field of gas turbine (GT) monitoring and diagnostics, GT trip is of great concern for manufactures and users. In fact, due to the number of issues that may cause a trip, its occurrence is not infrequent, and its prediction is a quite unexplored field of research. This is demonstrated by the fact that, despite its relevance, a comprehensive study on the reliability of predicting GT trip has not been proposed yet. To fill this gap, this paper investigates the fusion of five data-driven base models by means of voting and stacking, in order to improve prediction accuracy and robustness. The five benchmark supervised machine learning and deep learning classifiers are k-nearest neighbors, support vector machine (SVM), Naïve Bayes (NB), decision trees (DTs), and long short-term memory (LSTM) neural networks. While voting just averages the predictions of base models, without providing additional pieces of information, stacking is a technique used to aggregate heterogeneous models by training an additional machine learning model (namely, stacked ensemble model) on the predictions of the base models. The analyses carried out in this paper employ filed observations of both safe operation and trip events, derived from a large fleet of industrial Siemens GTs in operation. The results demonstrate that the stacked model provides higher accuracy than base models and also outperforms voting by proving more effective, especially when the reliability of the prediction of base models is poor. [ABSTRACT FROM AUTHOR]

The automatic calculation of sediment maps from hydroacoustic data is of great importance for habitat and sediment mapping as well as monitoring tasks. For this reason, numerous papers have been published that are based on a variety of algorithms and different kinds of input data. However, the current literature lacks comparative studies that investigate the performance of different approaches in depth. Therefore, this study aims to provide recommendations for suitable approaches for the automatic classification of side-scan sonar data that can be applied by agencies and researchers. With random forests, support vector machines, and convolutional neural networks, both traditional machine-learning methods and novel deep learning techniques have been implemented to evaluate their performance regarding the classification of backscatter data from two study sites located in the Sylt Outer Reef in the German Bight. Simple statistical values, textural features, and Weyl coefficients were calculated for different patch sizes as well as levels of quantization and then utilized in the machine-learning algorithms. It is found that large image patches of 32 px size and the combined use of different feature groups lead to the best classification performances. Further, the neural network and support vector machines generated visually more appealing sediment maps than random forests, despite scoring lower overall accuracy. Based on these findings, we recommend classifying side-scan sonar data with image patches of 32 px size and 6-bit quantization either directly in neural networks or with the combined use of multiple feature groups in support vector machines. [ABSTRACT FROM AUTHOR]

This paper employs two data-driven methods, Random Forest (RF) and Support Vector Machines (SVM), to develop mineral prospectivity models for an epithermal Au deposit. Four distinct models are presented for comparison: one employing RF and three using SVM with different kernel functions—namely linear, Radial Basis Function (RBF), and polynomial. The analysis leverages a compact training dataset, encompassing just 20 deposits, with deposit and non-deposit locations chosen from known mineral occurrences. Fourteen predictor maps are constructed based on the available data and the exploration model. The findings indicate that RF is more stable and robust than SVM, regardless of the kernel function implemented. While all SVM models outperformed the RF model in terms of classification capability on the training dataset achieving an accuracy exceeding 89% versus 78% for the RF model, the success rate curves suggest superior predictive abilities of RF over SVM models. This implies that the SVM models may be overfitting the training data due to the limited quantity of training deposits. [ABSTRACT FROM AUTHOR]

The non-axisymmetric exciting guided wave can detect the thinning section of the elbow, and the time domain energy value of the signal collected at the outer arch position of the receiving end displays a downward trend as the remaining thickness of the erosion area decreases. To address the difficulty in detecting the erosion degree of the elbow with high accuracy, this paper uses the linear frequency modulation (LFM) signal to excite a non-axisymmetric guided wave that propagates in the 90° elbow and collects signals through four PZT receivers. To predict the erosion degree, the corresponding relationship between the energy value of the four signals after fractional Fourier filtering and the degree of elbow erosion is established through the particle swarm optimization (PSO)–least squares support vector machine (LSSVM) algorithm. The results show that the method proposed has an average accuracy rate of 98.1864%, 94.7167%, 99.119%, and 99.9593% for predicting the erosion degree of four elbow samples, and 94.0039%. and 81.2976% for two new erosion degrees, which are higher than the nonlinear regression model, LSSVM algorithm, and BP neural network algorithm. This study has guiding significance for real-time monitoring of elbow erosion. [ABSTRACT FROM AUTHOR]

In the face of the batch, dynamic access data, or the flow of data that continuous changes over time, the traditional support vector machine algorithm cannot dynamically adjust the previous classification model. To overcome this shortcoming, the incremental support vector machine (ISVM) algorithm is proposed. However, many incremental support vector algorithms still have shortcomings such as low efficiency, memory limitation, and poor generalization. This paper puts forward the new ISVM algorithm, HDFC-ISVM ∗ algorithm, based on the high-dimensional distance and forgetting characteristics. This paper firstly proposes the original HDFC-ISVM algorithm that first learns the distribution characteristics of the samples according to the distance between the samples and the normative hyperplane. Then, it introduces the forgetting factor. In the incremental learning process, the classifier gradually accumulates the spatial distribution knowledge of samples, eliminates the samples that have no contributions to the classifier, and selectively forgets some useless samples according to the forgetting factor, which overcomes the shortcomings such as low efficiency and poor accuracy of some algorithms. But, the original HDFC-ISVM algorithm is sensitive to parameters, and different settings of the parameters have a great impact on the final classification accuracy of the algorithm. Therefore, on the basis of the original algorithm, an improved algorithm HDFC-ISVM ∗ based on the adjustments to the initialization strategy and updating rules of the forgetting factor is proposed. The initialization strategy and updating rules of the forgetting factor are adjusted to adapt datasets with different distributions in this improved algorithm. The rationality of the improved strategy about the forgetting factor is discussed theoretically. At the same time, the proposed algorithm has better classification accuracy, classification efficiency, and better generalization ability than other algorithms, which is verified by experiments. [ABSTRACT FROM AUTHOR]

This paper designs a maritime anomaly detection algorithm based on a support vector machine (SVM) that considers the spatiotemporal and motion features of trajectories. Since trajectories are two-dimensional, it is difficult to present their motion features. To accurately describe trajectory features, a novel trajectory feature extraction method based on statistical theory is proposed in this paper. This method maps trajectories onto a high-dimensional space, which can account for both the spatiotemporal features and motion features of the trajectories. With the proposed feature extraction method, the density-based spatial clustering of applications with noise algorithm is employed to recognize vessel traffic patterns by simultaneously considering the spatiotemporal and motion features. Then, an improved SVM is designed by employing a weighted hybrid kernel function and differential operator to detect anomalous behaviours from recognized vessel traffic patterns that include the spatiotemporal and motion characteristics. Compared with standard SVM, it can adaptively determine the optimal kernel function according to sample set. Finally, a numerical example based on automatic identification system data from the waters off Chengshan Jiao is fulfilled to verify the proposed algorithm effectiveness and accuracy. [ABSTRACT FROM AUTHOR]

Traditional Chinese medicine (TCM) is a summary of the diagnosis and treatment experience formed by the working people in the long-term struggle against diseases, so it is very important to protect the intangible cultural heritage of TCM. How to extract valuable knowledge accurately and conveniently from the massive medical records of TCM is one of the important issues in the current research on the development of TCM. Due to the large amount of data of TCM medical records, many feature attributes, and diverse patterns, the existing classification technology has high computational complexity, low mining efficiency, and poor universality. Therefore, this paper proposed to quantify the medical records of TCM and obtained the main symptoms according to the improved hierarchical clustering feature selection algorithm. This paper also proposed a support vector machine (SVM) classification method using improved particle swarm algorithm to classify TCM information, which not only improves the efficiency and accuracy of TCM information classification but also discovers the potential dialectical and symptom patterns in diagnosis and treatment, so that the intangible cultural heritage protection of TCM can be developed sustainably. This paper showed that the information acquisition accuracy of the improved algorithm was very high. Before the improved algorithm was used, the accuracy of information mining for TCM was 67.90% at the highest and 65.53% at the lowest, but after using the improved algorithm, the accuracy rate of information mining for TCM was 88.02% at the highest and 82.45% at the lowest. It can be seen that using the improved algorithm to mine TCM information can quickly process effective information. [ABSTRACT FROM AUTHOR]

An improved version of the mayfly algorithm called the golden annealing crossover-mutation mayfly algorithm (GSASMA) is proposed to address the low convergence efficiency and insufficient search capability of existing mayfly algorithms. First, the speed of individual mayflies is optimized using a simulated annealing algorithm to improve the update rate. The position of individuals is improved using the golden sine algorithm. Second, the impact of using different crossover and mutation methods in the algorithm is compared, and the optimal strategy is selected from the algorithm. To evaluate the performance of the algorithm, simulation experiments were carried out for 10 different test functions, and the results were compared with those of existing algorithms. The simulation results show that the algorithm developed in this paper converges faster and the solutions obtained are closer to the global optimum. Finally, GSASMA was used to optimize a support vector machine (SVM) that was used to identify the P300 signal for five subjects. The experimental results show that the SVM optimized by the algorithm proposed in this paper has higher recognition accuracy than an extreme learning machine. [ABSTRACT FROM AUTHOR]

With the development of teaching evaluation program, colleges and universities have reformed according to the actual situation of the school. With the development of evaluation activities, many universities are eager to establish their own teaching quality evaluation system, so as to pre-evaluate the teaching quality of schools. SVM is one of the most widely used machine learning algorithms that enables efficient statistical learning with a very limited number of samples. Considering the excellent learning performance of SVM, it is very suitable for the teaching quality evaluation system. In this paper, we optimize the existing multiple classification algorithm for binary trees and propose a new method. Learning the popular teaching quality evaluation system in colleges and universities, the binary tree support vector machine classification algorithm, and design comparison experiment, the experimental results show that the evaluation model proposed in this paper has strong generalization ability and higher classification accuracy and better classification efficiency. [ABSTRACT FROM AUTHOR]

Nowadays it is important to store sensitive data and restrict its usage only to authorized people or institutions. In general, solutions for Data Leakage Prevention (DLP) ignores malicious attacks on documents and algorithms using fingerprinting and regular expressions are used. However, content-based attacks are successful evading those algorithms. In this paper an algorithm robust against malicious content-based attacks is proposed, which is independent of the attack executed. Transposition, sentence structure alteration, modification, obfuscation attacks are taken into consideration within the scope of paper. N-gram, charactergram, k-skip-n-gram and LSA methods are used in the feature extraction step, for having better classification results under attacks. The extracted features are passed to a Vote Classifier consisting of Support Vector Machine, Random Forest and Multi-Layer Perceptron classifiers. Additionally, the effects of instrumenting Spell-Correction in different steps of the algorithm is evaluated, which is effective against modification attacks. [ABSTRACT FROM AUTHOR]

Robust classification algorithms for high-dimensional, small-sample datasets are valuable in practical applications. Faced with the infrared spectroscopic dataset with 568 samples and 3448 wavelengths (features) to identify the origins of Chinese medicinal materials, this paper proposed a novel embedded multiclassification algorithm, ITabNet, derived from the framework of TabNet. Firstly, a refined data pre-processing (DP) mechanism was designed to efficiently find the best adaptive one among 50 DP methods with the help of Support Vector Machine (SVM). Following this, an innovative focal loss function was designed and joined with a cross-validation experiment strategy to mitigate the impact of sample imbalance on algorithm. Detailed investigations on ITabNet were conducted, including comparisons of ITabNet with SVM for the conditions of DP and Non-DP, GPU and CPU computer settings, as well as ITabNet against XGBT (Extreme Gradient Boosting). The numerical results demonstrate that ITabNet can significantly improve the effectiveness of prediction. The best accuracy score is 1.0000, and the best Area Under the Curve (AUC) score is 1.0000. Suggestions on how to use models effectively were given. Furthermore, ITabNet shows the potential to apply the analysis of medicinal efficacy and chemical composition of medicinal materials. The paper also provides ideas for multi-classification modeling data with small sample size and high-dimensional feature. • A TabNet-based deep learning method for high-dimensional small-sample datasets. • A rapid data preprocessing search strategy using Support Vector Machine is established. • An adaptive Focal loss function with adjusting parameters counters sample imbalance. • Chinese herb origin identification via infrared spectroscopy shows impressive results. • Suggestions for Chinese herb further research and method generalization are offered. [ABSTRACT FROM AUTHOR]

Due to subjectivity in refereeing, the results of race walking are often questioned. To overcome this limitation, artificial-intelligence-based technologies have demonstrated their potential. The paper aims at presenting WARNING, an inertial-based wearable sensor integrated with a support vector machine algorithm to automatically identify race-walking faults. Two WARNING sensors were used to gather the 3D linear acceleration related to the shanks of ten expert race-walkers. Participants were asked to perform a race circuit following three race-walking conditions: legal, illegal with loss-of-contact and illegal with knee-bent. Thirteen machine learning algorithms, belonging to the decision tree, support vector machine and k-nearest neighbor categories, were evaluated. An inter-athlete training procedure was applied. Algorithm performance was evaluated in terms of overall accuracy, F1 score and G-index, as well as by computing the prediction speed. The quadratic support vector was confirmed to be the best-performing classifier, achieving an accuracy above 90% with a prediction speed of 29,000 observations/s when considering data from both shanks. A significant reduction of the performance was assessed when considering only one lower limb side. The outcomes allow us to affirm the potential of WARNING to be used as a referee assistant in race-walking competitions and during training sessions. [ABSTRACT FROM AUTHOR]

Discovering a hearing disorder at an earlier intervention is critical for reducing the effects of hearing loss and the approaches to increase the remaining hearing ability can be implemented to achieve the successful development of human communication. Recently, the explosive dataset features have increased the complexity for audiologists to decide the proper treatment for the patient. In most cases, data with irrelevant features and improper classifier parameters causes a crucial influence on the audiometry system in terms of accuracy. This is due to the dependent processes of these two, where the classification accuracy performance could be worsened if both processes are conducted independently. Although the filter algorithm is capable of eliminating irrelevant features, it still lacks the ability to consider feature reliance and results in a poor selection of significant features. Improper kernel parameter settings may also contribute to poor accuracy performance. In this paper, an ensemble filters feature selection based on Information Gain (IG), Gain Ratio (GR), Chi-squared (CS), and Relief-F (RF) with harmonize optimization of Particle Swarm Optimization (PSO) and Support Vector Machine (SVM) is presented to mitigate these problems. Ensemble filters are utilized so that the initial top dominant features relevant for classification can be considered. Then, PSO and SVM are optimized simultaneously to achieve the optimal solution. The results on a standard Audiology dataset show that the proposed method produces 96.50% accuracy with optimal solution compared to classical SVM, which signifies the proposed method is effective in handling high dimensional data for hearing disorder prediction. [ABSTRACT FROM AUTHOR]

As a classical machine learning model, support vector machine (SVM) has attracted much attention due to its rigorous theoretical foundation and powerful discriminative performance. The doubly regularized SVM (DRSVM) is an important variant of SVM based on elastic-net regularization, which considers both the sparsity and stability of the model. To tackle the problems of explosive increases in data dimensions and data volume, the alternating direction method of multipliers (ADMM) algorithm can be used to train the DRSVM model. ADMM is an effective iterative algorithm for solving convex optimization problems by decomposing a large issue into a series of solvable subproblems, which is also well suited for distributed computing. However, lack of guaranteed convergence and slow convergence rate are two critical limitations of ADMM. In this paper, a 3-block ADMM algorithm based on the over-relaxation technique is proposed to accelerate DRSVM training, namely, the over-relaxed DRSVM (O-RDRSVM). The main strategy of the over-relaxation technique is to further append the information from the previous iteration to the next iteration to improve the convergence of ADMM. We also propose a distributed version of O-RDRSVM to handle parallel and distributed computing faster, termed DO-RDRSVM. Moreover, we develop a fast O-RDRSVM algorithm (FO-RDRSVM) and a fast DO-RDRSVM algorithm (FDO-RDRSVM), which further reduce the computational cost of O-RDRSVM and DO-RDRSVM by employing the matrix inversion lemma. The convergence analyses ensure the effectiveness of our algorithms for DRSVM training. Finally, extensive experiments on public datasets demonstrate the advantages of our algorithms in terms of convergence rate and training time while maintaining accuracy and sparsity comparable to those of previous works. [ABSTRACT FROM AUTHOR]

Generator fault diagnosis has a great impact on power networks. With the coupling effects, some uncertain factors, and all the complexities of generator design, fault diagnosis is difficult using any theoretical analysis or mathematical model. This paper proposes a bit-coding support vector regression (BSVR) algorithm for turbine generator fault diagnosis (GFD) based on a support vector machine (SVM) capable of processing multiple classification problems of fault diagnosis. The BSVR can simplify the design architecture and reduce the processing time for detection, where m classifier is needed for m class problems compared to the [m(m − 1)]/2 size of the original multi-class SVM. Compared with conventional methods, numerical test results showed a high accuracy, good robustness, and a faster processing performance. [ABSTRACT FROM AUTHOR]

Stock market prediction is the process of determining the value of a company's shares and other financial assets in the future. This paper proposes a new model where Altruistic Dragonfly Algorithm (ADA) is combined with Least Squares Support Vector Machine (LS-SVM) for stock market prediction. ADA is a meta-heuristic algorithm which optimizes the parameters of LS-SVM to avoid local minima and overfitting, resulting in better prediction performance. Experiments have been performed on 12 datasets and the obtained results are compared with other popular meta-heuristic algorithms. The results show that the proposed model provides a better predictive ability and demonstrate the effectiveness of ADA in optimizing the parameters of LS-SVM. [ABSTRACT FROM AUTHOR]

In this paper, we present difference of convex algorithms for solving bilevel programs in which the upper level objective functions are difference of convex functions, and the lower level programs are fully convex. This nontrivial class of bilevel programs provides a powerful modelling framework for dealing with applications arising from hyperparameter selection in machine learning. Thanks to the full convexity of the lower level program, the value function of the lower level program turns out to be convex and hence the bilevel program can be reformulated as a difference of convex bilevel program. We propose two algorithms for solving the reformulated difference of convex program and show their convergence to stationary points under very mild assumptions. Finally we conduct numerical experiments to a bilevel model of support vector machine classification. [ABSTRACT FROM AUTHOR]

State of charge (SOC) is a crucial index for a battery's energy assessment. Its estimation is becoming an increasing challenge in order to assure the battery's safety and efficiency. To this end, many methods can be found in the scientific literature with various accuracy and complexity. However, accurate SOC is highly dependent on the adopted methodology. This paper investigates five methods for estimating battery SOC for lithium-ion (Li-ion) manufacturers. For this purpose, five methods were selected and then used in practice, including the modified Coulomb counting method, the extended Kalman filter, the neural network (NN), and two other techniques based on machine learning known as the support vector machines and the K-nearest neighbor algorithm (KNN), respectively. A detailed analysis based on statistical assessment is performed on an experimental test that covers multiple cycles of charge and discharge modes. The KNN method proved to be more accurate than the EKF approach, which is extensively used for estimating the SOC of Li-ion batteries. The algorithm demonstrated great predictive accuracy, with most predictions having a relative error near zero and a maximum error value of roughly 0.26%. All of the findings validate the methodology's reliability and efficiency. [ABSTRACT FROM AUTHOR]

Activity recognition methods often include some hyper-parameters based on experience, which greatly affects their effectiveness in activity recognition. However, the existing hyper-parameter optimization algorithms are mostly for continuous hyper-parameters, and rarely for the optimization of integer hyper-parameters and mixed hyper-parameters. To solve the problem, this paper improved the traditional cuckoo algorithm. The improved algorithm can optimize not only continuous hyper-parameters, but also integer hyper-parameters and mixed hyper-parameters. This paper validated the proposed method with the hyper-parameters in Least Squares Support Vector Machine (LS-SVM) and Long-Short-Term Memory (LSTM), and compared the activity recognition effects before and after optimization on the smart home activity recognition data set. The results show that the improved cuckoo algorithm can effectively improve the performance of the model in activity recognition. [ABSTRACT FROM AUTHOR]

Computer vision-based motion target detection and tracking, which is widely used in video surveillance, human-computer interaction, range interpretation, and other fields, is one of the current research hotspots in the field of computer vision. In engineering scenarios, the two are inseparable and need to work together to accomplish specific tasks. The related research is progressing rapidly, but there is still room for improving its timeliness, accuracy, and automation. In this paper, we summarize and classify some classical target detection methods, analyze the basic principles of convolutional neural networks, and analyze the classical detection algorithms based on region suggestion and deep regression networks. After that, we improve the SSD algorithm for the shortage of low-level feature convolution layers, which has insufficient feature extraction and leads to poor detection of small targets. For the motion target tracking problem, this paper studies the motion target tracking method based on support vector machine and proposes the tracking method of support vector regression and the corresponding online support vector regression solution method based on the analysis of support vector tracking method and structural support vector tracking method. In this paper, we propose a tracking method that fuses structural support vector machines and correlation filtering. The structure is based on the idea of Inception, which adds and replaces some feature convolution layers of the original network while maintaining the original lightweight backbone. The final experiments on the VOC data set demonstrate that the improved algorithm improves the average detection accuracy by 2.6% compared to the original algorithm and basically maintains the real-time speed as well. Experimental simulations on a subset of VOC data (human set) show a significant improvement in AP values and more effective and reliable detection tracking of moving targets. The stability and accuracy of motion target detection and tracking are improved by setting parameters, such as confidence level; the effectiveness and continuity of detection and tracking are judged by setting the interframe centroid distance. [ABSTRACT FROM AUTHOR]

Based on the principle of particle swarm algorithm and support vector machine, this article aims to improve the classification performance of college English teaching effect and explores the best support vector machine parameter optimization algorithm to promote college English teaching for the theory and application research of data analysis. First, the advantages and disadvantages of common support vector machine parameter selection methods such as grid search algorithm, gradient descent method, and swarm intelligence algorithm are studied. Secondly, this article has a detailed analysis and comparison of various other algorithms. Finally, the study analyzed the advantages and disadvantages of the quantum particle swarm algorithm, introduced the dual-center idea into the quantum particle swarm algorithm, and proposed an improved quantum particle swarm algorithm. Through simulation experiments, it is proved that the improved quantum particle swarm algorithm is more superior in optimizing the parameters of support vector machine. In general, this paper uses the PSO algorithm to simultaneously solve the SVM feature selection and parameter optimization problems and has achieved good results. Within the scope of the literature that the author has, there is still a lack of work in this area. Compared with the existing algorithms, the algorithm proposed in this paper has stronger feature selection ability and higher efficiency. [ABSTRACT FROM AUTHOR]

In the lung computer-aided detection (Lung CAD) system, the region of interest (ROI) of lung nodules has more false positives, making the imbalance between positive and negative (true positive and false positive) samples more likely to lead to misclassification of true positive nodules, a cost-sensitive multikernel learning support vector machine (CS-MKL-SVM) algorithm is proposed. Different penalty coefficients are assigned to positive and negative samples, so that the model can better learn the features of true positive nodules and improve the classification effect. To further improve the detection rate of pulmonary nodules and overall recognition accuracy, a score function named F-new based on the harmonic mean of accuracy (ACC) and sensitivity (SEN) is proposed as a fitness function for subsequent particle swarm optimization (PSO) parameter optimization, and a feasibility analysis of this function is performed. Compared with the fitness function that considers only accuracy or sensitivity, both the detection rate and the recognition accuracy of pulmonary nodules can be improved by this new algorithm. Compared with the grid search algorithm, using PSO for parameter search can reduce the model training time by nearly 20 times and achieve rapid parameter optimization. The maximum F-new obtained on the test set is 0.9357 for the proposed algorithm. When the maximum value of F-new is achieved, the corresponding recognition ACC is 91%, and SEN is 96.3%. Compared with the radial basis function in the single kernel, the F-new of the algorithm in this paper is 2.16% higher, ACC is 1.00% higher and SEN is equal. Compared with the polynomial kernel function in the single kernel, the F-new of the algorithm is 3.64% higher, ACC is 1.00% higher and SEN is 7.41% higher. The experimental results show that the F-new, ACC and SEN of the proposed algorithm is the best among them, and the results obtained by using multikernel function combined with F-new index are better than the single kernel function. Compared with the MKL-SVM algorithm of grid search, the ACC of the algorithm in this paper is reduced by 1%, and the results are equal to those of the MKL-SVM algorithm based on PSO only. Compared with the above two algorithms, SEN is increased by 3.71% and 7.41%, respectively. Therefore, it can be seen that the cost sensitive method can effectively reduce the missed detection of nodules, and the availability of the new algorithm can be further verified. [ABSTRACT FROM AUTHOR]

Aiming at the problems of parallel support vector machine (SVM) algorithm in big data environment such as redundant data sensitivity, difficulty in parameter selection, and low parallelization efficiency, this paper proposed a parallel SVM algorithm using Relief and bacterial foraging optimization (BFO) algorithm based on MapReduce (RBFO-PSVM). Firstly, the algorithm designed a feature weight calculation strategy (MI-Relief), which used mutual information to improve the weight calculation function of Relief algorithm to eliminate redundant features in the data set and effectively reduce redundant data to support parallelism. Secondly, this paper proposed a hybrid BFO algorithm based on MapReduce (MR-HBFO), which selected the optimal parameters of SVM in parallel, and solved the problem of difficult selection of SVM parameters. Finally, it proposed the kernel clustering strategy (KCS) to reduce the size of the data set involved in parallel training, and proposed a cross-fusion cascaded parallel SVM (CFCPSVM) to improve the cascade SVM (CSVM) feedback mechanism. It trained SVM by combining with the Map Reduce programming framework, and this improved the parallelization efficiency of parallel SVM. Experiments show that the RBFO-PSVM algorithm has a better classification effect on large data sets and is more suitable for large data environments. [ABSTRACT FROM AUTHOR]

Improved SVM algorithm improves the efficiency of College English teaching effect evaluation and meets the requirements of College English teaching evaluation. Based on the relevant theories, this paper constructs the evaluation index system with teachers and students as the main body and takes the questionnaire survey results as the input samples of the LSSVM algorithm. Compared with the evaluation accuracy of an optimized BP neural network and the category weighted gray target decision-making method, the results show that the evaluation accuracy of optimized LSSVM algorithm is 96.26%. Taking SIT as an example, this paper uses the optimized LSSVM algorithm to evaluate its teaching effect and obtains that teachers' literature and teaching contents are important factors to improve the effect of English teaching. Therefore, this paper introduces the intelligent voice system to optimize the English teaching design of SIT. The teaching design is optimized from the dimensions of teaching objectives, learning situation, teaching content, teaching media and curriculum materials, and teaching procedures. [ABSTRACT FROM AUTHOR]

[Objectives] In view of the limitations of support vector machine (SVM) in the application of tractor diesel engine fault diagnosis, a hybrid population optimization-support vector machine (HPO-SVM) tractor diesel engine fault diagnosis model was proposed in this paper. [Methods]SVM was used as the base of fault diagnosis model and population algorithm was used to optimize c and g of SVM parameters. Based on particle swarm optimization (PSO)and grey wolf optimization (GWO)algorithm, hybrid population optimization (HPO) algorithm was put forward to optimize c and g of SVM parameters. The fault mechanism of diesel engine was analyzed, and four common faults of diesel engine and eight sensor data signals reflecting the faults were determined. Sensor signal data of Weichai WP6 tractor diesel engine were collected by the CAN (controller area network) bus and the Arduino UNO-MCP 2551 combined module to test the performance of HPO-SVM. The test results of SVM, PSO-SVM, GWO-SVM, GWOPSO-SVM, and LWD-QPSO-SOMBP (linear weight decrease-quantum particle swarm optimization-self organizing maps back propagation) neural network were compared. [Results] Compared with the other four SVM models, HPO-SVM took full advantage of the advantages of GWO algorithm and PSO algorithm in SVM parameter optimization, and the fault diagnosis accuracy was greatly improved. Compared with SVM, the diagnostic accuracy increases from 80% to 100%, up by 20%, which proved that HPO-SVM model had good diagnostic performance. HPO algorithm improved the optimization performance of single-population optimization algorithm. Compared with the other four models, the average fitness level of HPO algorithm was the highest. Compared with PSO algorithm, the optimum fitness of HPO algorithm was improved from 70 to 90, which increased by 22.22%. When the optimum fitness was reached, the number of iterations decreased from 105 to 27, which decreased by 74.29%. This showed that HPO algorithm had a good optimization efficiency. In order to avoid accidental six repeated tests on five SVM models, the test results showed that the performance of HPO-SVM models was more stable than that of the other four models, and the total accuracy of six diagnoses of HPO-SVM was 100%. Compared with LWD-QPSO-SOMBP neural network, the running time of HPO-SVM model decreased from 45 s to 15 s, which decreased by 66.67%, indicating that the diagnosis efficiency of optimized SVM model was due to the optimization of BP neural network model. [Conclusions]This study results can provide reference for fault diagnosis of high-efficiency tractor diesel engine. [ABSTRACT FROM AUTHOR]