Coal Gangue Recognition during Coal Preparation Using an Adaptive Boosting Algorithm

Cancer is a threatening disease for the human race affecting most people around the world. The topmost reason for cancer demise across the globe is lung cancer and therefore there were many algorithms applied in predicting the survival rate of lung cancer patients. As a result of which the survival rate of lung cancer patients is increasing gradually. Support Vector Machine (SVM) technique have high accuracy than other technique in prediction. The performance of the SVM algorithm depends on the kernel function. In this paper, a comparison of three different kernel functions predicting the survival rate of a lung cancer patient with an efficient normalization technique is studied. Experiments are conducted in the dataset obtained from Cancer Imaging Archive (TCIA). Along with SVM kernel functions, five machine learning techniques were also used in predicting the survival rate of lung cancer. RBF_SVM with normalized data produced high accuracy of 97.72% compared to another algorithm. Various performance metrics such as accuracy, precision, recall, F1 score are used to evaluate the performance of the SVM kernel function.

In the process of coal mining, the separation of coal and gangue is a very important step. Traditional coal preparation methods include manual coal preparation, heavy medium coal preparation, ray projection coal preparation, etc. these methods can not separate coal and gangue under the condition of safety and speed at the same time. Therefore, to improve the recognition rate of coal gangue separation, a coal gangue recognition method based on improved Support Vector Machine is proposed in this paper. First, the images of the coal and gangue are preprocessed. Then, the gray and texture features of the coal and gangue are extracted from the preprocessed images. Finally, each feature vector is input into the Support Vector Machine model optimized by Fruit Fly for recognition and classification. The experimental results show that the accuracy is 96.33%.

Health monitoring and prognostics of axial piston pump is very helpful for the safety of aerial hydraulic system. Directing to the difficulties of measuring the wear loss between the valve plate and cylinder barrel, this paper presents a hybrid prediction method based on EMD (Empirical Mode Decomposition) and SVM (Support Vector Machine), in which EMD is used to get the pump's health state and PSO (Particle Swarm Optimization)-SVM is used to make a prediction for the pump's remaining useful lifetime. Oil-return flow was selected to indicate the wear condition of pump with several IMFs. SVM was trained by these IMFs, and then be used to predict the oil-return flow one-step ahead or multi-step ahead. In the SVM's training process, PSO was used to search the optimal parameter of SVM's kernel function. Applications show that hybrid prediction method has higher prediction precision and could be applied for the remaining useful lifetime prognostics.

The incorporation of prior knowledge into the Support Vector Machine (SVM) architecture is a problem which if solved can lead to much more accurate classifiers in the near future. This result could be particularly effective in the classification of remote sensing imagery, where an abundance of information is available prior to classification. The most evident method to feed prior knowledge into the SVM algorithm is through the SVM kernel function. This paper proposes several composite kernel functions designed specifically for land cover classification of remote sensing imagery. These kernels make use of the spectral signature information, inherently available in remote sensing imagery. The results achieved from these kernels are very much satisfactory and surpass all previous results produced by classical kernels.

This study developed a methodology that can use real-time strain data for the assessment of scaffolding safety conditions. The researchers identified 23 safety cases of individual member failure with generic global failure for a four-bay, three-story scaffold model and used scaffold member strain values to identify potential failure cases. A computer simulation on the scaffold model generated the strain datasets required for classification with a support vector machine (SVM). The SVM classification demonstrated a stable prediction accuracy after training with a certain number of strain datasets. Furthermore, the 2nd order polynomial kernel function resulted in better prediction compared to other SVM kernel functions. These results imply that the real-time assessment of scaffolding structures is possible with a limited number of training data for machine-learning classification.

The types of kernel function and relevant parameters’ selection in support vector machine (SVM) have a major impact on the performance of the classifier. In order to improve the accuracy and generalization ability of the model, we used mixed kernel function SVM classification algorithm based on the information entropy particle swarm optimization (PSO): on the one hand, the generalization ability of classifier is effectively enhanced by constructing a mixed kernel function with global kernel function and local kernel function; on the other hand, the accuracy of classification is improved through optimization for related kernel parameters based on information entropy PSO. Compared with PSO-RBF kernel and PSO-mixed kernel, the improved PSO-mixed kernel SVM can effectively improve the classification accuracy through the classification experiment on biomedical datasets, which would not only prove the efficiency of this algorithm, but also show that the algorithm has good practical application value in biomedicine prediction.

The parameters selection and optimization of kernel function is the core of support vector machine (SVM), which is closely related to the distribution of datasets. It can be obtained a series of different group index, either mapped by different kernel functions on the same dataset or did by same kernel function on the different subsets. We analyze the impact of the choice of kernel functions and parameters on the performance of SVM, and propose a GA-optimized weighted mixed kernel function of SVM based on information entropy (GA-IE-RBF-SVM). The algorithm uses the information entropy to improve the contribution of the features that are conducive to classification firstly to mitigate falling into a local optimum, then learn from the idea of multi-core learning to enhance the adaptability of the algorithm. The optimal genetic algorithm (GA) is used to select the type of mixed kernel function, kernel function parameters and error penalty factor. The experimental results show that compared with other similar algorithms, this algorithm has a higher classification accuracy rate and faster convergence speed.

Fast discrimination of rice varieties plays a key role in the rice processing industry and benefits the management of rice in the supermarket. In order to discriminate rice varieties in a fast and nondestructive way, hyperspectral technology and several classification algorithms were used in this study. The hyperspectral data of 250 rice samples of 5 varieties were obtained using FieldSpec®3 spectrometer. Multiplication Scatter Correction (MSC) was used to preprocess the raw spectra. Principal Component Analysis (PCA) was used to reduce the dimension of raw spectra. To investigate the influence of different linear and non-linear classification algorithms on the discrimination results, K-Nearest Neighbors (KNN), Support Vector Machine (SVM) and Least Square Support Vector Machine (LS-SVM) were used to develop the discrimination models respectively. Then the performances of these three multivariate classification methods were compared according to the discrimination accuracy. The number of Principal Components (PCs) and K parameter of KNN, kernel function of SVM or LS-SVM, were optimized by cross-validation in corresponding models. One hundred and twenty five rice samples (25 of each variety) were chosen as calibration set and the remaining 125 rice samples were prediction set. The experiment results showed that, the optimal PCs was 8 and the cross-validation accuracy of KNN (K = 2), SVM, LS-SVM were 94.4, 96.8 and 100%, respectively, while the prediction accuracy of KNN (K = 2), SVM, LS-SVM were 89.6, 93.6 and 100%, respectively. The results indicated that LS-SVM performed the best in the discrimination of rice varieties.

<p>An investigation into optimized support vector machine (SVM) integrated with principal component analysis (PCA) and orthogonal least square (OLS) in classifying asphyxiated infant cry was performed in this study. Three approaches were used in the classification; SVM, PCA-SVM, and OLS-SVM. Various numbers of features extracted from Mel-frequency Cepstral coefficient (MFCC) were tested to obtain the optimal parameters of SVM kernels. Once the optimal feature set is obtained, PCA and OLS selected the most significant features and the optimized SVM then classified the selected cry patterns. In PCA-SVM, eigenvalue-one-criterion (EOC), cumulative percentage variance (CPV) and the Scree test (SCREE) were used to select the most significant features. SVM with radial basis function (RBF) kernel was chosen in the classification stage. The classification accuracy and computation time were computed to evaluate the performance of each method. The best method for classifying asphyxiated infant cry is PCA-SVM with EOC since it produces the highest classification accuracy which is 94.84%. Using PCA-SVM, the classification process was performed in 1.98s only. The results also show that employing feature selection techniques could enhance the classifier performance.</p>

Adaptive boosting (AdaBoost) algorithms fuse multiple weak classifiers to generate a strong classifier by adaptively determining the fusion weights of the weak classifiers. According to incorrect or correct classification results, sample weights become larger or smaller. However, this weight update scheme neglects valuable information in the results. Moreover, an important requirement for weak classifiers is an accuracy higher than random guessing. This requirement is likely to lead to an unexpected result. This means that several generated weak classifiers with similar classification results cannot learn from each other. Consequently, the advantage of fusing multiple weak classifiers disappears. The classification and therefore distinction of different failure modes in materials is a typical task for classical nondestructive testing approaches as well as for new approaches based on machine learning methods. In the case different approaches can be applied, the main question is, which and how tuned approaches provide the best results in terms of accuracy or similar metrics. In the multi-damage classification task distinguishing different physical failure mechanisms in Carbon Fiber Reinforced Polymer (CFRP), the above two aspects complicate the application of AdaBoost algorithms. To improve the results, a novel AdaBoost with distance-based weighted least square support vector machine (WLSSVM) and filter factor is proposed. The distance-based WLSSVM is employed to increase the diversity of weak classifiers, the distances of the classification plane and samples are used to measure the classification task. The filter factor is proposed to filter out unnecessary classifiers contributing less to the final decision. The experimental results demonstrate that the improved AdaBoost schemes with distance-based WLSSVM and filter factor outperform state-of-the-art algorithms. The effects of the scheme using the new weighted update and the filter factor on the algorithm are discussed, respectively. The experimental results show that the combination of the two schemes perform better than other schemes.

Least squares support vector machine with self-organizing multiple kernel learning and sparsity

Support vector machine (SVM) is always used for face recognition. However, kernel function selection is a key problem for SVM. This paper tries to make some contributions to this problem with focus on optimizing the parameters in the selected kernel function to improve the accuracy of classification and recognition of SVM. Firstly, an improved artificial fish swarm optimization algorithm (IAFSA) is proposed to optimize the parameters in SVM. In the improved version of artificial fish swarm optimization algorithm, the visual distance and the step size of artificial fish are adjusted adaptively. In the early stage of convergence, artificial fish are widely distributed, and the visual distance and step size take larger values to accelerate the convergence of the algorithm. In the later stage of convergence, artificial fish gathered gradually, and the visual distance and the step size were given small values to prevent oscillation. Then the optimized SVM is used to recognize face images. Simultaneously, in order to improve the accuracy rate of face recognition, an improved local binary pattern (ILBP) is proposed to extract features of face images. Numerical results show the advantage of our new algorithm over a range of existing algorithms.

Coal, as a vital energy source, requires rapid and accurate classification to ensure efficient utilization. Laser-induced breakdown spectroscopy (LIBS) shows great potential in coal analysis owing to its fast detection speed and minimal sample preparation requirements. However, for coal classification, due to the high variability of LIBS spectra from different measurements and the high similarity of LIBS spectra among different coal types, the accuracy of coal classification still needs to be improved. This study proposes a LIBS spectral classification method for coal based on feature selection, applied to four sample types: coal gangue, bituminous coal, lignite, and anthracite. First, the ReliefF algorithm is used to assess the importance weights of spectral features, and feature subsets are constructed in descending order of weight to eliminate redundant information. Subsequently, the extracted features are input into a Support Vector Machine (SVM) model for classification. Experimental results show that compared with traditional full-spectrum classification methods, the proposed method improves the classification accuracy of coal and coal gangue from 99.33% to 100%, and the classification accuracy of different types of coal from 98.66% to 100%. Moreover, feature selection significantly reduces model training time and enhances the model's generalization performance on the test set. The proposed method offers notable advantages in improving classification accuracy and training efficiency, providing a reliable technical foundation for the rapid and precise identification of coal.

In order to predict the anti-trypanosome effect of carbazole-derived compounds by quantitative structure-activity relationship, five models were established by the linear method, random forest, radial basis kernel function support vector machine, linear combination mix-kernel function support vector machine, and nonlinear combination mix-kernel function support vector machine (NLMIX-SVM). The heuristic method and optimized CatBoost were used to select two different key descriptor sets for building linear and nonlinear models, respectively. Hyperparameters in all nonlinear models were optimized by comprehensive learning particle swarm optimization with low complexity and fast convergence. Furthermore, the models' robustness and reliability underwent rigorous assessment using fivefold and leave-one-out cross-validation, y-randomization, and statistics including concordance correlation coefficient (CCC), [Formula: see text] , [Formula: see text] , and [Formula: see text] . Among all the models, the NLMIX-SVM model, which was established by support vector regression using a nonlinear combination of radial basis kernel function, sigmoid kernel function, and linear kernel function as a new kernel function, demonstrated excellent learning and generalization abilities as well as robustness: [Formula: see text] = 0.9581, mean square error (MSE) = 0.0199 for the training set and [Formula: see text] = 0.9528, MSE = 0.0174 for the test set. [Formula: see text] , [Formula: see text] , CCC, [Formula: see text] , [Formula: see text], and [Formula: see text] are 0.9539, 0.8908, 0.9752, 0.9529, 0.9528, and 0.9633, respectively. The NLMIX-SVM method proved to be a promising way in quantitative structure-activity relationship research. In addition, molecular docking experiments were conducted to analyze the properties of new derivatives, and a new potential candidate drug molecule was ultimately found. In summary, this study will provide help for the design and screening of novel anti-trypanosome drugs.

Support vector machines (SVMs) are a class of machine learning algorithms which use kernel functions to map data into feature space, where a separating hyperplane can be computed to classify the data. Generally, SVMs are reliant on the selection of kernel function and parameters, which can severely downgrade the performance of the classifier if mishandled. In this paper, we compare the performance of the Euclidean-SVM (ESVM), that have low dependency on kernel selection, with conventional SVM. The comparison are conducted with two different datasets. Results show that the ESVM has higher performance consistency as compared to SVM.