Search

Demodulation and decoding are pivotal for the eLoran system's timing and information transmission capabilities. This paper proposes a novel demodulation algorithm leveraging a multiclass support vector machine (MSVM) for pulse position modulation (PPM) of eLoran signals. Firstly, the existing demodulation method based on envelope phase detection (EPD) technology is reviewed, highlighting its limitations. Secondly, a detailed exposition of the MSVM algorithm is presented, demonstrating its theoretical foundations and comparative advantages over the traditional method and several other methods proposed in this study. Subsequently, through comprehensive experiments, the algorithm parameters are optimized, and the parallel comparison of different demodulation methods is carried out in various complex environments. The test results show that the MSVM algorithm is significantly superior to traditional methods and other kinds of machine learning algorithms in demodulation accuracy and stability, particularly in high-noise and -interference scenarios. This innovative algorithm not only broadens the design approach for eLoran receivers but also fully meets the high-precision timing service requirements of the eLoran system. [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]

Stroke is a high morbidity and mortality disease that poses a serious threat to people's health. Early recognition of the various warning signs of stroke is necessary so that timely clinical intervention can help reduce the severity of stroke. Deep neural networks have powerful feature representation capabilities and can automatically learn discriminant features from large amounts of data. This paper uses a range of physiological characteristic parameters and collaborates with deep neural networks, such as the Wasserstein generative adversarial networks with gradient penalty and regression network, to construct a stroke prediction model. Firstly, to address the problem of imbalance between positive and negative samples in the stroke public data set, we performed positive sample data augmentation and utilized WGAN‐GP to generate stroke data with high fidelity and used it for the training of the prediction network model. Then, the relationship between observable physiological characteristic parameters and the predicted risk of suffering a stroke was modeled as a nonlinear mapping transformation, and a stroke prediction model based on a deep regression network was designed. Finally, the proposed method is compared with commonly used machine learning‐based classification algorithms such as decision tree, random forest, support vector machine, and artificial neural networks. The prediction results of the proposed method are optimal in the comprehensive measurement index F. Further ablation experiments also show that the designed prediction model has certain robustness and can effectively predict stroke diseases. [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]

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]

In this work we propose new proofs of some classical results of nonlinear programming milestones, in particular for the Kuhn-Tucker conditions and Lagrangian methods and functions. This study is concerned with some interesting features found in the well-known tools and methods, connecting them with a technical analysis of the "Maximal Margin Classifier" designed specifically for linearly separable data, while referring to the condition in which data can be separated linearly by using a hyperplane. In this context of analysis, we technically point out the centrality played by these mathematical tools when obtaining robustness in Machine Learning procedures analyzing some support vector machine (SVM) models, as they are used in various contexts and applications (e.g., Soft Margin SVM and Maximum Margin SVM). This paper represents the first study reinforcing the ongoing Machine Learning Modeling and the research project we will launch in the near future on this fascinating frame of analysis. In this work we examine the problem of estimating the bias into a decision-making process. A new decision function algorithm is introduced as well. [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]

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]

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]

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]

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]

The failure of insulators may seriously threaten the safe operation of the power system, where the state detection of high-voltage insulators is a must for the normal and safe operation of the power system. Based on the data of insulators in aerial images, this work explored an enhanced particle swarm algorithm to optimize the parameters of the support vector machine. A support vector machine model was therefore established for the identification of the normal and defective states of the insulators. This methodology works with the structure minimization principle of SVM and the characteristics of particle swarm fast optimization. First, the aerial insulator image was segmented as a target by way of the seed region growth based on double-layer cascade morphological improvements, and then, HOG features plus GLCM features were extracted as sample data. Finally, an ameliorated PSO-SVM classifier was designed to realize insulator state identification. Comparisons were made between PSO-SVM and conventional machine learning algorithms, SVM and Random Forest, and an optimization algorithm, Gray Wolf Optimization Support Vector Machine (GWO-SVM), and advanced neural network CNN. The experimental results showed that the performance of the algorithm proposed in this paper touched the top level, where the recognition accuracy rate was 92.11%, the precision rate 90%, the recall rate 94.74%, and the F1-score 92.31%. [ABSTRACT FROM AUTHOR]

In this paper three prime numbers are presented as high potentials to be Mersenne numbers and their application in computational primality testing is suggested. These numbers are constructed from a regression algorithm based on Support vector machines (SVM) and using a Gaussian Kernel. Data training is carried out using the Phyton programming language, In the study we address the current data of Mersenne primes and work with the Ova-angular classification group for Mersenne primes 31. [ABSTRACT FROM AUTHOR]

Conventional methodology in the field for the sampling of coffee leaf rust, caused by Hemileia vastatrix, has proven to be impractical. This paper proposes a method for the early detection of this disease, which is the most significant pathogen of coffee plants worldwide, using multispectral images acquired using a Mapir Survey3W camera and an unmanned aerial vehicle (UAV). For this purpose, 160 coffee seedlings of the coffee cultivar 'Mundo Novo' were inoculated with urediniospores of H. vastatrix and compared with 160 control (non-inoculated) seedlings to determine the most favorable interval for distinguishing healthy and infected plants. The 320 seedlings were placed on a dark surface to perform the imaging flights. In vitro analyses of the physiological parameters of 20 specimens were then performed for each condition (inoculated/non-inoculated) to obtain the hyperspectral curves, and this process was repeated three times at 15, 30, and 45 days after inoculation (DAI). Based on the simulated hyperspectral curves, a discrepancy between the red and near-infrared (NIR) bands was identified at 15 DAI, with the inoculated plants showing greater absorption in the red band and a greater spectral response in the NIR band. Thus, multispectral images were able to distinguish H. vastatrix infection in coffee seedlings at an asymptomatic stage (15 DAI) using a support vector machines (SVM) algorithm. Detection accuracy was 80% and the Kappa index of agreement was moderate (0.6). The early detection of this pathogen in the field using low-cost technology can be an important tool for the monitoring of coffee leaf rust and, consequently, a more sustainable management of the pathogen, causing farmers to make applications of chemical fungicides only when necessary. [ABSTRACT FROM AUTHOR]

Accurate identification of lithology is the basis and key process of fine logging interpretation and evaluation. However, reservoirs formed by different sedimentary environments and tectonic movements generally have the characteristics of complex and diverse lithology and strong heterogeneity, which brings great difficulty to the identification of reservoir lithology. This paper proposes an automatic identification technology for lithology logging based on the GWO-SVM algorithm model. The technology is actually applied, and the results are compared with the results of the support vector machine cross-validation optimization model, PNN (probabilistic neural network) model, and ELM (extreme learning machine) model. The results show that the GWO-SVM lithology logging recognition model can efficiently solve the lithology recognition and classification problems in complex reservoir analysis and has strong adaptability and higher recognition accuracy. [ABSTRACT FROM AUTHOR]

There has been a rapid increase in the number of artificial intelligence (AI)/machine learning (ML)-based biomarker diagnostic classifiers in recent years. However, relatively little work has focused on assessing the robustness of these biomarkers, i.e., investigating the uncertainty of the AI/ML models that these biomarkers are based upon. This paper addresses this issue by proposing a framework to evaluate the already-developed classifiers with regard to their robustness by focusing on the variability of the classifiers' performance and changes in the classifiers' parameter values using factor analysis and Monte Carlo simulations. Specifically, this work evaluates (1) the importance of a classifier's input features and (2) the variability of a classifier's output and model parameter values in response to data perturbations. Additionally, it was found that one can estimate a priori how much replacement noise a classifier can tolerate while still meeting accuracy goals. To illustrate the evaluation framework, six different AI/ML-based biomarkers are developed using commonly used techniques (linear discriminant analysis, support vector machines, random forest, partial-least squares discriminant analysis, logistic regression, and multilayer perceptron) for a metabolomics dataset involving 24 measured metabolites taken from 159 study participants. The framework was able to correctly predict which of the classifiers should be less robust than others without recomputing the classifiers itself, and this prediction was then validated in a detailed analysis. [ABSTRACT FROM AUTHOR]

Background: Osteoarthritis, a common degenerative disease of articular cartilage, is characterized by degeneration of articular cartilage, changes in subchondral bone structure, and formation of osteophytes, with main clinical manifestations including increasingly serious swelling, pain, stiffness, deformity, and mobility deficits of the knee joints. With the advent of the big data era, the processing of mass data has evolved into a hot topic and gained a solid foundation from the steadily developed and improved machine learning algorithms. Aiming to provide a reference for the diagnosis and treatment of osteoarthritis, this paper using machine learning identifies the key feature genes of osteoarthritis and explores its relationship with immune infiltration, thereby revealing its pathogenesis at the molecular level. Methods: From the GEO database, GSE55235 and GSE55457 data were derived as training sets and GSE98918 data as a validation set. Differential gene expressions of the training sets were analyzed, and the LASSO regression model and support vector machine model were established by applying machine learning algorithms. Moreover, their intersection genes were regarded as feature genes, the receiver operator characteristic (ROC) curve was drawn, and the results were verified using the validation set. In addition, the expression spectrum of osteoarthritis was analyzed by immunocyte infiltration and the co-expression correlation between feature genes and immunocytes was construed. Conclusion: EPYC and KLF9 can be viewed as feature genes for osteoarthritis. The silencing of EPYC and the overexpression of KLF9 are associated with the occurrence of osteoarthritis and immunocyte infiltration. [ABSTRACT FROM AUTHOR]

Objective. Internet of Things (IoT) integrates several technologies where devices learn from the experience of each other thereby reducing human-intervened likely errors. Modern technologies like IoT and machine learning enable the conventional to patient-specific approach transition in healthcare. In conventional approach, the biggest challenge faced by healthcare professionals is to predict a disease by observing the symptoms, monitoring the remote area patient, and also attending to the patient all the time after being hospitalised. IoT provides real-time data, makes decision-making smarter, and provides far superior analytics, and all these to help improve the quality of healthcare. The main objective of the work was to create an IoT-based automated system using machine learning models for symptom-based COVID-19 prognosis. Methods. Comparative analysis of predictive microbiology of COVID-19 from case symptoms using various machine learning classifiers like logistics regression, k-nearest neighbor, support vector machine, random forest, decision trees, Naïve Bayes, and gradient booster is reported here. For the sake of the validation and verification of the models, performance of each model based on the retrieved cloud-stored data was measured for accuracy. Results. From the accuracy plot, it was concluded that k-NN was more accurate (97.97%) followed by decision tree (97.79), support vector machine (97.42), logistics regression (96.50), random forest (90.66), gradient boosting classifier (87.77), and Naïve Bayes (73.50) in COVID-19 prognosis. Conclusion. The paper presents a health monitoring IoT framework having high clinical significance in real-time and remote healthcare monitoring. The findings reported here and the lessons learnt shall enable the healthcare system worldwide to counter not only this ongoing COVID but many other such global pandemics the humanity may suffer from time to come. [ABSTRACT FROM AUTHOR]

This paper utilizes the cognitive radio (CR) spectrum to the fullest extent for extended applications requiring discretion. The CR technology provides various supports for cognitive radio networks (CRNs). The latter has CR nodes that sense free channels. Then, the CRN allocates the unused channels to secondary users (SUs) or unlicensed users. This allocation is termed the spectrum handoff. In this paper, by considering the identical channels in CR networks, a novel machine learning algorithm (the support vector machine—SVM) is employed. In addition, the queuing model of the preemptive resume priority M/M/1 is used. The proposed spectrum handoff algorithm selects the best possible CR network channel. The spectrum handoff algorithm uses the stated SVM algorithm scheme, which covers the transmitted and received power, the minimum service time, the data rate and the maximum vacancy time for the SU, to attain the maximum throughput. However, in multi-user greedy channel selection (GCS), only two parameters are considered. The proposed spectrum handoff algorithm based on the SVM scheme enhances the performance, and the SU throughput is improved to 68.7%. This approach is better than the GCS channel selection scheme. Additionally, this approach decreases the number of spectrum handoffs. As a result, the training accuracy of the SVM method is 97.6%, and it outperforms conventional methods. [ABSTRACT FROM AUTHOR]

In this paper, we present a framework for performing automatic analysis of Land Use Zones based on Location-Based Social Networks (LBSNs). We model city areas using a hierarchical structure of POIs extracted from foursquare. We encode such structures in kernel machines, e.g., Support Vector Machines, using a new Tree Kernel, i.e., the Hierarchical POI Kernel (HPK), which can take the importance of the individual POIs into account during the substructure matching. This way, HPK projects structures in the space of all their possible substructures such that each dimension corresponds to a semantic structural feature, weighted according to the discriminative power of POIs. We generated four different datasets for the following cities: Barcelona, Lisbon, Amsterdam and Milan, where we trained and tested our models. The results show that our approach largely outperforms previous work and standard baseline built on simple features, such as counts of different POIs. Finally, we apply a mining algorithm to extract the most relevant features (tree fragments) from the implicit TK space according to the weights the kernel machine assigned to them. Our approach can produce an explicit set of representative features that can be used to classify and characterize urban areas. [ABSTRACT FROM AUTHOR]

Multi-label classification is an important research topic in machine learning, for which exploiting label dependencies is an effective modeling principle. Recently, probabilistic models have shown great potential in discovering dependencies among labels. In this paper, motivated by the recent success of multi-view learning to improve the generalization performance, we propose a novel multi-view probabilistic model named latent conditional Bernoulli mixture (LCBM) for multi-label classification. LCBM is a generative model taking features from different views as inputs, and conditional on the latent subspace shared by the views a Bernoulli mixture model is adopted to build label dependencies. Inside each component of the mixture, the labels have a weak correlation which facilitates computational convenience. The mean field variational inference framework is used to carry out approximate posterior inference in the probabilistic model, where we propose a Gaussian mixture variational autoencoder (GMVAE) for effective posterior approximation. We further develop a scalable stochastic training algorithm for efficiently optimizing the model parameters and variational parameters, and derive an efficient prediction procedure based on greedy search. Experimental results on multiple benchmark datasets show that our approach outperforms other state-of-the-art methods under various metrics. [ABSTRACT FROM AUTHOR]

Hyperspectral imagery (HSI) has shown promising results in real-world applications. However, the technological evolution of optical sensors poses two main challenges in HSI classification: 1) the spectral band is usually redundant and noisy and 2) HSI with millions of pixels has become increasingly common in real-world applications. Motivated by the recent success of hybrid huberized support vector machines (HHSVMs), which inherit the benefits of both lasso and ridge regression, this paper first investigates the advantages of HHSVM for HSI applications. Unfortunately, the existing HHSVM solvers suffer from prohibitive computational costs on large-scale data sets. To solve this problem, this paper proposes simple and effective stochastic HHSVM algorithms for HSI classification. In the stochastic settings, we show that with a probability of at least $1-\varrho $ , our algorithms find an $\epsilon $ -accurate solution using $\tilde {O}({1}/{\lambda _{2}\epsilon })$ iterations. Since the convergence rate of our algorithms does not depend on the size of the training set, our algorithms are suitable for handling large-scale problems. We demonstrate the superiority of our algorithms by conducting experiments on large-scale binary and multiclass classification problems, comparing to the state-of-the-art HHSVM solvers. Finally, we apply our algorithms to real HSI classification and achieve promising results. [ABSTRACT FROM AUTHOR]

Flooding produces debris and waste including liquids, dead animal bodies and hazardous materials such as hospital waste. Debris causes serious threats to people's health and can even block the roads used to give emergency aid, worsening the situation. To cope with these issues, flood management systems (FMSs) are adopted for the decision-making process of critical situations. Nowadays, conventional artificial intelligence and computational intelligence (CI) methods are applied to early flood event detection, having a low false alarm rate. City authorities can then provide quick and efficient response in post-disaster scenarios. This paper aims to present a comprehensive survey about the application of CI-based methods in FMSs. CI approaches are categorized as single and hybrid methods. The paper also identifies and introduces the most promising approaches nowadays with respect to the accuracy and error rate for flood debris forecasting and management. Ensemble CI approaches are shown to be highly efficient for flood prediction. [ABSTRACT FROM AUTHOR]

As the training dataset size and the model size of machine learning increase rapidly, more computing resources are consumed to speedup the training process. However, the scalability and performance reproducibility of parallel machine learning training, which mainly uses stochastic optimization algorithms, are limited. In this paper, we demonstrate that the sample difference in the dataset plays a prominent role in the scalability of parallel machine learning algorithms. We propose to use statistical properties of dataset to measure sample differences. These properties include the variance of sample features, sample sparsity, sample diversity, and similarity in sampling sequences. We choose four types of parallel training algorithms as our research objects: (1) the asynchronous parallel SGD algorithm (Hogwild! algorithm), (2) the parallel model average SGD algorithm (minibatch SGD algorithm), (3) the decentralization optimization algorithm, and (4) the dual coordinate optimization (DADM algorithm). Our results show that the statistical properties of training datasets determine the scalability upper bound of these parallel training algorithms. [ABSTRACT FROM AUTHOR]

With the rapid development of the Internet and the rapid development of big data analysis technology, data mining has played a positive role in promoting industry and academia. Classification is an important problem in data mining. This paper explores the background and theory of support vector machines (SVM) in data mining classification algorithms and analyzes and summarizes the research status of various improved methods of SVM. According to the scale and characteristics of the data, different solution spaces are selected, and the solution of the dual problem is transformed into the classification surface of the original space to improve the algorithm speed. Research Process. Incorporating fuzzy membership into multicore learning, it is found that the time complexity of the original problem is determined by the dimension, and the time complexity of the dual problem is determined by the quantity, and the dimension and quantity constitute the scale of the data, so it can be based on the scale of the data Features Choose different solution spaces. The algorithm speed can be improved by transforming the solution of the dual problem into the classification surface of the original space. Conclusion. By improving the calculation rate of traditional machine learning algorithms, it is concluded that the accuracy of the fitting prediction between the predicted data and the actual value is as high as 98%, which can make the traditional machine learning algorithm meet the requirements of the big data era. It can be widely used in the context of big data. [ABSTRACT FROM AUTHOR]

Analyzing and predicting the trend of price fluctuation has been receiving more and more attention, as price risk has become the focus of risk control research in heating oil futures market. A novel time series prediction model combined with the complex network method is put forward in the paper. First of all, this paper counts the cumulative time interval of different nodes in the network, and fits its growth trend with the Fourier model. Then a novel price fluctuation prediction model is established based on the effective information such as some topology properties extracted from the network. The results show that the Fourier model can predict the emergence time of new nodes in the next stage, and the established price fluctuation prediction model can infer the names of nodes in the prediction interval, so as to determine the forward-looking behavior of price evolution. Besides, liken to the NAR neural network, the prediction results obtained by the proposed method also show superiority, which has important theoretical value and academic significance for early warning and prediction of price behavior in the heating oil futures market. [ABSTRACT FROM AUTHOR]

Analyzing geological drilling hole images acquired by Axial View Panoramic Borehole Televiewer (APBT) is a key step to explore the geological structure in a geological exploration. Conventionally, the borehole images are examined by technicians, which is inefficient and subjective. In this paper, three dominant types of borehole-wall images on coal-rock mass structure, namely, border images, fracture images and intact rock mass images are mainly studied. The traditional image classification methods based on unified feature extraction algorithm and single classifier is not effect for the borehole images. Therefore, this paper proposes a novel two-stage classification approach to improve the classification performance of borehole images. In the first-stage classification, the border images are identified from three kinds of images based on texture features and gray-scale histograms features. For the remaining two types of images, in the second-stage classification, Gabor filter is first applied to segment the region of interest (ROI) (such as microfracture, absciss layer and horizontal cracks, etc.) and the central interference region. Then, using the same feature vector after eliminating the central interference region, fracture images are separated from intact rock mass images. We test our two-stage classification system with real borehole images. The results of experimental show that the two-stage classification method can effectively classify three major borehole-wall images with the correction rate of 95.55% in the first stage and 95% in the second stage. [ABSTRACT FROM AUTHOR]

Machine Learning (ML) methods have been proposed in the academic literature as alternatives to statistical ones for time series forecasting. Yet, scant evidence is available about their relative performance in terms of accuracy and computational requirements. The purpose of this paper is to evaluate such performance across multiple forecasting horizons using a large subset of 1045 monthly time series used in the M3 Competition. After comparing the post-sample accuracy of popular ML methods with that of eight traditional statistical ones, we found that the former are dominated across both accuracy measures used and for all forecasting horizons examined. Moreover, we observed that their computational requirements are considerably greater than those of statistical methods. The paper discusses the results, explains why the accuracy of ML models is below that of statistical ones and proposes some possible ways forward. The empirical results found in our research stress the need for objective and unbiased ways to test the performance of forecasting methods that can be achieved through sizable and open competitions allowing meaningful comparisons and definite conclusions. [ABSTRACT FROM AUTHOR]

Current suicide risk assessments for predicting suicide attempts are time consuming, of low predictive value and have inadequate reliability. This paper aims to develop a predictive model for suicide attempts among patients with depression using machine learning algorithms as well as presents a comparative study on single predictive models with ensemble predictive models for differentiating depressed patients with suicide attempts from non-suicide attempters. We applied and trained eight different machine learning algorithms using a dataset that consists of 75 patients diagnosed with a depressive disorder. A recursive feature elimination was used to reduce the features via three-fold cross validation. An ensemble predictive models outperformed the single predictive models. Voting and bagging revealed the highest accuracy of 92% compared to other machine learning algorithms. Our findings indicate that history of suicide attempt, religion, race, suicide ideation and severity of clinical depression are useful factors for prediction of suicide attempts. [ABSTRACT FROM AUTHOR]

The traditional analytical method has difficulty in accurately modelling cutting chatter. This paper constructs the vibration datasets of different chatter states and establishes a machine learning (ML) model for chatter identification, treating physical vibration signal as the input. Specifically, the cutting vibration signal was converted into the time-frequency spectrum, which was then classified by a selfdesigned deep residual convolutional neural network (DR-CNN). After that, the cutting vibration signal was broken down into chatter bands through variational mode decomposition (VMD). The information entropies of the chatter bands were calculated as cutting chatter features. Next, support vector machine (SVM) was introduced to classify the extracted features and used to create an online cutting chatter identification algorithm. The proposed method achieved a much higher mean identification accuracy (92.57%) than the traditional identification method. [ABSTRACT FROM AUTHOR]

Multi-view learning (MVL) is an active direction in machine learning that aims at exploiting the consensus and complementarity information among multiple distinct feature sets to boost the generalization performance of the counterpart algorithm. So far, two classical SVM-based MVL methods are SVM-2K and multi-view twin support vector machine (MvTSVM). They are designed only for two-view classification and cannot tackle the general multi-view classification problem. They also cannot effectively leverage the complementarity information among different feature views. In this paper, we propose two novel multi-view support vector machines with the consensus and complementarity information for MVL that not only can deal with the two-view classification problem but also the general multi-view classification problem by jointly learning multiple different views in a non-pairwise way. The disagreement among different views is regarded as a constraint or a regularization term in the objective function which plays an important role in exploring the consensus information. Combination weights for the reconstruction of each view in regularization terms are learned to explore complementarity information among different views. Finally, an efficient iteration algorithm with the classical convex quadratic programming is developed for optimization. Experimental results validate the effectiveness of our proposed methods. [ABSTRACT FROM AUTHOR]

In the collaborative filtering (CF) recommendation applications, the sparsity of user rating data, the effectiveness of cold start, the strategy of item information neglection, and user profiles construction are critical to both the efficiency and effectiveness of the recommendation algorithm. In order to solve the above problems, a personalized recommendation approach combining semisupervised support vector machine and active learning (AL) is proposed in this paper, which combines the benefits of both TSVM (Transductive Support Vector Machine) and AL. Firstly, a "maximum-minimum segmentation" of version space-based AL strategy is developed to choose the most informative unlabeled samples for human annotation; it aims to choose the least data which is enough to train a high-quality model. And then, an AL-based semisupervised TSVM algorithm is proposed to make full use of the distribution characteristics of unlabeled samples by adding a manifold regularization into objective function, which is helpful to make the proposed algorithm to overcome the traditional drawbacks of TSVM. Furthermore, during the procedure of recommendation model construction, not only user behavior information and item information, but also demographic information is utilized. Due to the benefits of the above design, the quality of unlabeled sample annotation can be improved; meanwhile, both the data sparsity and cold start problems are alleviated. Finally, the effectiveness of the proposed algorithm is verified based on UCI datasets, and then it is applied to personalized recommendation. The experimental results show the superiority of the proposed method in both effectiveness and efficiency. [ABSTRACT FROM AUTHOR]

This paper proposes a methodology for predicting online rotor angle stability in power system operation under significant contribution from wind generation. First, a novel algorithm is developed to extract a stability index (SI) that quantifies the margin of rotor angle stability of power systems reflecting the dynamics of wind power. An approach is proposed that takes advantage of the machine learning technique and the newly defined SI. In case of a contingency, the developed algorithm is employed in parallel to find SIs for all possible instability modes. The SIs are formed as a vector and then applied to a classifier algorithm for rotor angle stability prediction. Compared to other features used in state-of-the-art methods, SI vectors are highly recognizable and thus can lead to a more accurate and reliable prediction. The proposed approach is validated on two IEEE test systems with various wind power penetration levels and compared to existing methods, followed by a discussion of results. [ABSTRACT FROM AUTHOR]

In this paper, we propose a machine‐learning‐based approach to automatically detect a satellite oscillator anomaly. A major challenge is to differentiate an oscillator anomaly from ionospheric scintillation. Although both scintillation and oscillator anomalies cause phase disturbances, their underlying physics are different and, therefore, show different carrier‐frequency dependency. By using triple‐frequency signals, distinct features are extracted from the disturbed signals and applied to the radial basis function (RBF) support vector machine (SVM) classifier to identify an oscillator anomaly. The results show that the proposed RBF SVM displays superior performance and outperforms several other classification methods. The proposed approach is applied to an extensive GNSS database to conduct automatic satellite oscillator anomaly detection. Preliminary detection results validate the effectiveness of the proposed method. On average, one‐to‐three satellite oscillator anomaly events are detected daily at each receiver location. [ABSTRACT FROM AUTHOR]

Background: Machine learning is a branch of Artificial Intelligence that is concerned with the design and development of algorithms, and it enables today's computers to have the property of learning. Machine learning is gradually growing and becoming a critical approach in many domains such as health, education, and business.Methods: In this paper, we applied machine learning to the diabetes dataset with the aim of recognizing patterns and combinations of factors that characterizes or explain re-admission among diabetes patients. The classifiers used include Linear Discriminant Analysis, Random Forest, k-Nearest Neighbor, Naïve Bayes, J48 and Support vector machine.Results: Of the 100,000 cases, 78,363 were diabetic and over 47% were readmitted.Based on the classes that models produced, diabetic patients who are more likely to be readmitted are either women, or Caucasians, or outpatients, or those who undergo less rigorous lab procedures, treatment procedures, or those who receive less medication, and are thus discharged without proper improvements or administration of insulin despite having been tested positive for HbA1c.Conclusion: Diabetic patients who do not undergo vigorous lab assessments, diagnosis, medications are more likely to be readmitted when discharged without improvements and without receiving insulin administration, especially if they are women, Caucasians, or both. [ABSTRACT FROM AUTHOR]

Background: Dementia is a complex disorder characterized by poor outcomes for the patients and high costs of care. After decades of research little is known about its mechanisms. Having prognostic estimates about dementia can help researchers, patients and public entities in dealing with this disorder. Thus, health data, machine learning and microsimulation techniques could be employed in developing prognostic estimates for dementia. Objective: The goal of this paper is to present evidence on the state of the art of studies investigating and the prognosis of dementia using machine learning and microsimulation techniques. Method: To achieve our goal we carried out a systematic literature review, in which three large databases—Pubmed, Socups and Web of Science were searched to select studies that employed machine learning or microsimulation techniques for the prognosis of dementia. A single backward snowballing was done to identify further studies. A quality checklist was also employed to assess the quality of the evidence presented by the selected studies, and low quality studies were removed. Finally, data from the final set of studies were extracted in summary tables. Results: In total 37 papers were included. The data summary results showed that the current research is focused on the investigation of the patients with mild cognitive impairment that will evolve to Alzheimer’s disease, using machine learning techniques. Microsimulation studies were concerned with cost estimation and had a populational focus. Neuroimaging was the most commonly used variable. Conclusions: Prediction of conversion from MCI to AD is the dominant theme in the selected studies. Most studies used ML techniques on Neuroimaging data. Only a few data sources have been recruited by most studies and the ADNI database is the one most commonly used. Only two studies have investigated the prediction of epidemiological aspects of Dementia using either ML or MS techniques. Finally, care should be taken when interpreting the reported accuracy of ML techniques, given studies’ different contexts. [ABSTRACT FROM AUTHOR]

Among Parkinson’s disease (PD) symptoms, freezing of gait (FoG) is one of the most debilitating. To assess FoG, current clinical practice mostly employs repeated evaluations over weeks and months based on questionnaires, which may not accurately map the severity of this symptom. The use of a non-invasive system to monitor the activities of daily living (ADL) and the PD symptoms experienced by patients throughout the day could provide a more accurate and objective evaluation of FoG in order to better understand the evolution of the disease and allow for a more informed decision-making process in making adjustments to the patient’s treatment plan. This paper presents a new algorithm to detect FoG with a machine learning approach based on Support Vector Machines (SVM) and a single tri-axial accelerometer worn at the waist. The method is evaluated through the acceleration signals in an outpatient setting gathered from 21 PD patients at their home and evaluated under two different conditions: first, a generic model is tested by using a leave-one-out approach and, second, a personalised model that also uses part of the dataset from each patient. Results show a significant improvement in the accuracy of the personalised model compared to the generic model, showing enhancement in the specificity and sensitivity geometric mean (GM) of 7.2%. Furthermore, the SVM approach adopted has been compared to the most comprehensive FoG detection method currently in use (referred to as MBFA in this paper). Results of our novel generic method provide an enhancement of 11.2% in the GM compared to the MBFA generic model and, in the case of the personalised model, a 10% of improvement with respect to the MBFA personalised model. Thus, our results show that a machine learning approach can be used to monitor FoG during the daily life of PD patients and, furthermore, personalised models for FoG detection can be used to improve monitoring accuracy. [ABSTRACT FROM AUTHOR]

With the rapid development of ICT and Web technologies, a large an amount of information is becoming available and this is producing, in some instances, a condition of information overload. Under these conditions, it is difficult for a person to locate and access useful information for making decisions. To address this problem, there are information filtering systems, such as the personalized recommendation system (PRS) considered in this paper, that assist a person in identifying possible products or services of interest based on his/her preferences. Among available approaches, collaborative Filtering (CF) is one of the most widely used recommendation techniques. However, CF has some limitations, e.g., the relatively simple similarity calculation, cold start problem, etc. In this context, this paper presents a new regression model based on the support vector machine (SVM) classification and an improved PSO (IPSO) for the development of an electronic movie PRS. In its implementation, a SVM classification model is first established to obtain a preliminary movie recommendation list based on which a SVM regression model is applied to predict movies’ ratings. The proposed PRS not only considers the movie’s content information but also integrates the users’ demographic and behavioral information to better capture the users’ interests and preferences. The efficiency of the proposed method is verified by a series of experiments based on the MovieLens benchmark data set. [ABSTRACT FROM AUTHOR]

Sensor network intrusion detection has attracted extensive attention. However, previous intrusion detection methods face the highly imbalanced attack class distribution problem, and they may not achieve a satisfactory performance. To solve this problem, we propose a new intrusion detection algorithm based on normalized cut spectral clustering for sensor network in this paper. The main aim is to reduce the imbalance degree among classes in an intrusion detection system. First, we design a normalized cut spectral clustering to reduce the imbalance degree between every two classes in the intrusion detection data set. Second, we train a network intrusion detection classifier on the new data set. Finally, we do extensive experiments and analyze the experimental results in detail. Simulation experiments show that our algorithm can reduce the imbalance degree among classes and reserves the distribution of the original data on the one hand, and improve effectively the detection performance on the other hand. [ABSTRACT FROM AUTHOR]

In this paper, we propose a human action recognition method using HOIRM (histogram of oriented interest region motion) feature fusion and a BOW (bag of words) model based on AP (affinity propagation) clustering. First, a HOIRM feature extraction method based on spatiotemporal interest points ROI is proposed. HOIRM can be regarded as a middle-level feature between local and global features. Then, HOIRM is fused with 3D HOG and 3D HOF local features using a cumulative histogram. The method further improves the robustness of local features to camera view angle and distance variations in complex scenes, which in turn improves the correct rate of action recognition. Finally, a BOW model based on AP clustering is proposed and applied to action classification. It obtains the appropriate visual dictionary capacity and achieves better clustering effect for the joint description of a variety of features. The experimental results demonstrate that by using the fused features with the proposed BOW model, the average recognition rate is 95.75% in the KTH database, and 88.25% in the UCF database, which are both higher than those by using only 3D HOG+3D HOF or HOIRM features. Moreover, the average recognition rate achieved by the proposed method in the two databases is higher than that obtained by other methods. [ABSTRACT FROM AUTHOR]

This paper attempts to design an automated, efficient and intelligent tomato grading method that facilitates the graded selling of the fruit. Based on machine vision, the color images of tomatoes with different morphologies were studied, and the color, shape and size were selected as the key features. On this basis, an automated grading classifier was created based on the surface features of tomatoes, and a grading platform was set up to verify the effect of the classifier. Specifically, the Hue value distributions of tomatoes with different maturities were investigated, and the Hue value ranges were determined for mature, semi-mature and immature tomatoes, producing the color classifier. Next, the first-order Fourier descriptor (1D- FD) was adopted to describe the radius sequence of tomato contour, and an equation was established to compute the irregularity of tomato contour, creating the shape classifier. After that, a linear regression equation was constructed to reflect the relationship between the transverse diameters of actual tomatoes and tomato images, and a classifier between large, medium and small tomatoes was produced based on the transverse diameter. Finally, a comprehensive tomato classifier was built based on the color, shape and size diameters. The experimental results show that the mean grading accuracy of the proposed method was 90.7%. This means our method can achieve automated real-time grading of tomatoes. [ABSTRACT FROM AUTHOR]

A brain-computer interface (BCI), based on motor imagery EEG, uses information extracted from the electroencephalography signals generated by a person who intends to perform any action. One of the most important issues of current research is how to detect automatically whether the user intends to send some message to a certain device. This study presents a proposal, based on a hierarchical structured system, for recognising intentional and non-intentional mental tasks on a BCI system by applying machine learning techniques to the EEG signals. First-level clustering is performed to distinguish between intentional control (IC) and non-intentional control (NC) state patterns. Then, the patterns recognised as IC are passed on to a second stage where supervised learning techniques are used to classify them. In BCI applications, it is critical to correctly classify NC states with a low false positive rate (FPR) to avoid undesirable effects. According to the literature, we selected a maximum FPR of 10%. Under these conditions, our proposal achieved an average test accuracy of 66.6%, with an 8.2% FPR, for the BCI competition IIIa dataset. The main contribution of this paper is the hierarchical approach, based on machine learning paradigms, which performs intentional and non-intentional discrimination and, depending on the case, classifies the intended command selected by the user. [ABSTRACT FROM AUTHOR]

Despite the several speedup methods proposed in the literature, the computational complexity of High Efficiency Video Coding (HEVC) video encoding is still a problem. This paper proposes a fast coding unit (CU) partition decision for use in HEVC encoders based on support vector machine (SVM)-trained offline. The SVM classifiers, features, and training procedures are described in detail, and a justification for the use of SVMs is provided. The trained classifiers are incorporated into a modified reference encoder in the form of a fast CU partition decision algorithm, which decides if the exhaustive search for the best partition is continued or terminated prematurely. Using the proposed method, an average complexity reduction of 48% is achieved with a 0.48% Bjontegaard-Delta bitrate (BD-BR) loss using the random access coding configuration, 44% reduction with a 0.62% BD-BR loss for the Low Delay B, and a 41% reduction with a 0.6% BD-BR loss for the Low Delay P configuration. We also tested our approach under constant bitrate conditions, achieving a 47% reduction in encoding time with a 1.11% loss in the BD-BR. In addition, a decision threshold adaptation is also proposed to allow adjusting the rate-distortion/complexity trade-off of our solution. With this approach, the computational complexity reduction can be varied from 34.9% (with a 0.13% loss in the BD-BR) up to 52.4% (with a 1.11% BD-BR loss) using the random access configuration. Compared with the state-of-the-art solutions, our decision scheme outperforms the related works in terms of combined rate distortion and complexity. [ABSTRACT FROM AUTHOR]

Target tracking is an important field of investigation in wireless sensor networks. When multiple targets are closely spaced, their measurement points are mixed together due to the insufficient accuracy of the sensor. This may bring some difficulties in determining the positions of observation points required by subsequent algorithms and applications. Most of the known tracking algorithms are derived from the Kalman filter, extended Kalman filter, and particles filter. In this paper, a novel measurement data classification algorithm based on support vector machine (SVM) is provided. SVM and Kalman filter are combined to obtain the updated classification line at each sampling period, and the sampling points would be classified by the updated classification line to calculate the coordinates of the corresponding observation points, which are then used to estimate the precise positions of two targets. A series of simulations and experiments are carried out to validate the presented algorithm on classifying and tracking two targets moving closely. Simulation results for a maneuvering targets classification example illustrate the feasibility of the new algorithm, as well as experimental and quantitative results from the practical data validate the effectiveness and stability of our proposal in contrast with existing methods. [ABSTRACT FROM AUTHOR]

In general, the stock prices of the same industry have a similar trend, but those of different industries do not. When investing in stocks of different industries, one should select the optimal model from lots of trading models for each industry because any model may not be suitable for capturing the stock trends of all industries. However, the study has not been carried out at present. In this paper, firstly we select 424 S&P 500 index component stocks (SPICS) and 185 CSI 300 index component stocks (CSICS) as the research objects from 2010 to 2017, divide them into 9 industries such as finance and energy respectively. Secondly, we apply 12 widely used machine learning algorithms to generate stock trading signals in different industries and execute the back-testing based on the trading signals. Thirdly, we use a non-parametric statistical test to evaluate whether there are significant differences among the trading performance evaluation indicators (PEI) of different models in the same industry. Finally, we propose a series of rules to select the optimal models for stock investment of every industry. The analytical results on SPICS and CSICS show that we can find the optimal trading models for each industry based on the statistical tests and the rules. Most importantly, the PEI of the best algorithms can be significantly better than that of the benchmark index and “Buy and Hold” strategy. Therefore, the algorithms can be used for making profits from industry stock trading. [ABSTRACT FROM AUTHOR]