Support Vector Machine Performance with Optimal Parameters Identification in Recognising Asphyxiated Infant Cry

<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>

Industrial big data has created a challenge for data measurement, detection, and processing. This paper shows that support vector machine (SVM) is extremely useful in detecting fault information in modern complex industrial processes. With a pilot plant of Continuous Stirred Tank Heater (CSTH) process, the SVM method with radial basis function (RBF) kernels is tested on the CSTH database and compared with an improved Partial Least Squares (IPLS) and Principal Component Analysis (PCA). The performance of SVM is validated using k-fold cross-validation where the classifier based on SVM outperforms those based on PCA and IPLS. These comparisons show that SVM has remarkable detection performance and satisfying elapsed time. From an industrial point of view, the vitality of SVM algorithm in actual industrial process is discussed.

Abstract:Bankruptcy prediction and credit scoring are the two important problems facing financial decision support. The multilayer perceptron (MLP) network has shown its applicability to these problems and its performance is usually superior to those of other traditional statistical models. Support vector machines (SVMs) are the core machine learning techniques and have been used to compare with MLP as the benchmark. However, the performance of SVMs is not fully understood in the literature because an insufficient number of data sets is considered and different kernel functions are used to train the SVMs. In this paper, four public data sets are used. In particular, three different sizes of training and testing data in each of the four data sets are considered (i.e. 3:7, 1:1 and 7:3) in order to examine and fully understand the performance of SVMs. For SVM model construction, the linear, radial basis function and polynomial kernel functions are used to construct the SVMs. Using MLP as the benchmark, the SVM classifier only performs better in one of the four data sets. On the other hand, the prediction results of the MLP and SVM classifiers are not significantly different for the three different sizes of training and testing data.

In the evolving field of cybersecurity, detecting malicious activity in high-dimensional network data remains a persistent challenge for traditional machine learning (ML) techniques. This study investigates the use of convolutional variational autoencoders (VAEs) to generate latent features that enhance the performance of various ML classifiers on the 2015 NSL-KDD dataset. Classifiers, including Gaussian Naïve Bayes (GNB), support vector machines (SVMs) with Radial Basis Function (RBF) kernel, decision trees, and dense neural networks, were evaluated using metrics such as accuracy, precision, recall, F1 score, and the Matthews Correlation Coefficient (MCC). To assess the effectiveness of VAEs, Principal Component Analysis (PCA) was used as a baseline dimensionality reduction method, and performance comparisons were made. The best-performing model was an SVM with an RBF kernel, a PCA (threshold = 0.92), and a VAE with six latent features, achieving an accuracy of 82.8%, an F1 score of 0.830, and an MCC of 0.682. The results indicate that VAEs can significantly enhance classifier performance, particularly in GNB and SVM models, suggesting their value in developing more effective intrusion detection systems. Received: 23 August 2024 | Revised: 3 June 2025 | Accepted: 15 July 2025 Conflicts of Interest The authors declare that they have no conflicts of interest to this work. Data Availability Statement The data that support the findings of this study are openly available in NSL-KDD Dataset at https://github.com/t-taylor/cvaes-research/tree/main/results. Author Contribution Statement Thomas Taylor: Conceptualization, Methodology, Software, Validation, Formal analysis, Investigation, Data curation, Writing – original draft, Writing – review & editing, Visualization. Amna Eleyan: Conceptualization, Methodology, Writing – original draft, Writing – review & editing, Supervision, Project administration. Mohammed Al-Khalidi: Validation, Resources, Writing – original draft, Writing – review & editing, Visualization, Supervision.

In recent years, the urban impervious surface has been recognized as a key quantifiable indicator in assessing urbanization impacts on environmental and ecological conditions. A surge of research interests has resulted in the estimation of urban impervious surface using remote sensing studies. The objective of this paper is to examine and compare the effectiveness of two algorithms for extracting impervious surfaces from Landsat TM imagery; the multilayer perceptron neural network (MLPNN) and the support vector machine (SVM). An accuracy assessment was performed using the high-resolution WorldView images. The root mean square error (RMSE), the mean absolute error (MAE), and the coefficient of determination (R(2)) were calculated to validate the classification performance and accuracies of MLPNN and SVM. For the MLPNN model, the RMSE, MAE, and R(2) were 17.18%, 11.10%, and 0.8474, respectively. The SVM yielded a result with an RMSE of 13.75%, an MAE of 8.92%, and an R2 of 0.9032. The results indicated that SVM performance was superior to that of MLPNN in impervious surface classification. To further evaluate the performance of MLPNN and SVM in handling the mixed-pixels, an accuracy assessment was also conducted for the selected test areas, including commercial, residential, and rural areas. Our results suggested that SVM had better capability in handling the mixed-pixel problem than MLPNN. The superior performance of SVM over MLPNN is mainly attributed to the SVM's capability of deriving the global optimum and handling the over-fitting problem by suitable parameter selection. Overall, SVM provides an efficient and useful method for estimating the impervious surface. (C) 2011 Society of Photo-Optical Instrumentation Engineers (SPIE). [DOI: 10.1117/1.3539767]

This work proposes a methodology for content-based image retrieval of glioblastoma multiforme (GBM) and non-GBM tumors. Regions containing GBM lesions from 40 patients and non-GBM lesions from 20 patients were manually segmented from MR imaging studies (T1 post-contrast and T2 weighted channels) to form the training set. In addition to the two acquired channels, a composite image was formed by an image fusion method. Data reduction techniques, principal component analysis (PCA) and linear discriminant analysis (LDA), were applied on the training sets (T1 post, T2, composite, and multi-channel combining the PCA features from T1 post and T2). The retrieval accuracy was evaluated using a 'leave-one-out' strategy with query images belonging to 'normal', 'GBM' and 'non-GBM' classes. Several combinations of the similarity metric and classifier were used: Euclidean similarity measures with k-means classifier for the PCA and LDA features and support vector machine (SVM) nonlinear classifier (radial basis function kernel) with the PCA derived features. The SVM classifier served as a comparison of nonlinear techniques vs. linear ones. Multi-channel PCA was 100% accurate in classifying a query image as either 'normal' or 'abnormal'. The highest accuracy in classification of tumor grade (GBM or other Grade 3) was 77% and was achieved by SVM coupled with the PCA features. The proposed algorithm intent is to be integrated into an automated decision support system for MR brain tumor studies.

Flood susceptibility mapping using a novel ensemble weights-of-evidence and support vector machine models in GIS

Dyslexia is referred as learning disability that causes learner having difficulties in decoding, reading and writing words. This disability associates with learning processing region in the human brain. Activities in this region can be examined using electroencephalogram (EEG) which record electrical activity during learning process. This study looks into performance of Support Vector Machine (SVM) using RBF kernel in classifying EEG signal of Normal, Poor and Capable Dyslexic children during writing words and non-words. Discrete Wavelet Transform (DWT) with Daubechies order 2 was employed to extract the power of beta and theta waves of EEG signal. Beta and Theta/Beta ratio form the input features for classifier. Multiclass one versus one SVM was used in the classification where RBF kernel parameters and box constraint values were varied with the factor of 10 to analyze performance of the classifier. It was found that the best performance of SVM with 91% overall accuracy was obtained when both kernel scale and box constraint are set to one.

Stock trend forecasting is one of the important issues in stock market research. However, forecasting stock trend remains a challenge because of its irregular characteristic in the stock indices distribution, which changes over time. Support Vector Machine (SVM) produces a fairly good result in stock trend forecasting, but the performance of SVM can be affected by the high dimensional input features and noisy data. This paper hybridizes the Particle Swarm Optimization (PSO) algorithm to generate the optimum features set prior to facilitate SVM learning. The SVM algorithm uses the Radial Basis Function (RBF) kernel function and optimization of the gamma and large margin parameters are done using the PSO algorithm. The proposed algorithm was tested on a pre-sampled 17 years record of daily Kuala Lumpur Composite Index (KLCI) data. The PSOSVM approach is applied to eliminate unnecessary or insignificant features, and effectively determine the parameter values, in turn improving the overall prediction results. The optimized feature space of technical indicators of the algorithm is proven by the experimental results showing that PSOSVM has outperformed SVM technique significantly.

Early auxiliary screening of cerebral infarction based on lacrimal Raman spectroscopy and SVM algorithm

Bond rating is regarded as an important event for measuring financial risk of companies and for determining the investment returns of investors. As a result, it has been a popular research topic for researchers to predict companies' credit ratings by applying statistical and machine learning techniques. The statistical techniques, including multiple regression, multiple discriminant analysis (MDA), logistic models (LOGIT), and probit analysis, have been traditionally used in bond rating. However, one major drawback is that it should be based on strict assumptions. Such strict assumptions include linearity, normality, independence among predictor variables and pre-existing functional forms relating the criterion variablesand the predictor variables. Those strict assumptions of traditional statistics have limited their application to the real world. Machine learning techniques also used in bond rating prediction models include decision trees (DT), neural networks (NN), and Support Vector Machine (SVM). Especially, SVM is recognized as a new and promising classification and regression analysis method. SVM learns a separating hyperplane that can maximize the margin between two categories. SVM is simple enough to be analyzed mathematical, and leads to high performance in practical applications. SVM implements the structuralrisk minimization principle and searches to minimize an upper bound of the generalization error. In addition, the solution of SVM may be a global optimum and thus, overfitting is unlikely to occur with SVM. In addition, SVM does not require too many data sample for training since it builds prediction models by only using some representative sample near the boundaries called support vectors. A number of experimental researches have indicated that SVM has been successfully applied in a variety of pattern recognition fields. However, there are three major drawbacks that can be potential causes for degrading SVM's performance. First, SVM is originally proposed for solving binary-class classification problems. Methods for combining SVMs for multi-class classification such as One-Against-One, One-Against-All have been proposed, but they do not improve the performance in multi-class classification problem as much as SVM for binary-class classification. Second, approximation algorithms (e.g. decomposition methods, sequential minimal optimization algorithm) could be used for effective multi-class computation to reduce computation time, but it could deteriorate classification performance. Third, the difficulty in multi-class prediction problems is in data imbalance problem that can occur when the number of instances in one class greatly outnumbers the number of instances in the other class. Such data sets often cause a default classifier to be built due to skewed boundary and thus the reduction in the classification accuracy of such a classifier. SVM ensemble learning is one of machine learning methods to cope with the above drawbacks. Ensemble learning is a method for improving the performance of classification and prediction algorithms. AdaBoost is one of the widely used ensemble learning techniques. It constructs a composite classifier by sequentially training classifiers while increasing weight on the misclassified observations through iterations. The observations that are incorrectly predicted by previous classifiers are chosen more often than examples that are correctly predicted. Thus Boosting attempts to produce new classifiers that are better able to predict examples for which the current ensemble's performance is poor. In this way, it can reinforce the training of the misclassified observations of the minority class. This paper proposes a multiclass Geometric Mean-based Boosting (MGM-Boost) to resolve multiclass prediction problem. Since MGM-Boost introduces the notion of geometric mean into AdaBoost, it can perform learning process considering the geometric mean-based accuracy and errors of multiclass. This study applies MGM-Boost to the real-world bond rating case for Korean companies to examine the feasibility of MGM-Boost. 10-fold cross validations for threetimes with different random seeds are performed in order to ensure that the comparison among three different classifiers does not happen by chance. For each of 10-fold cross validation, the entire data set is first partitioned into tenequal-sized sets, and then each set is in turn used as the test set while the classifier trains on the other nine sets. That is, cross-validated folds have been tested independently of each algorithm. Through these steps, we have obtained the results for classifiers on each of the 30 experiments. In the comparison of arithmetic mean-based prediction accuracy between individual classifiers, MGM-Boost (52.95%) shows higher prediction accuracy than both AdaBoost (51.69%) and SVM (49.47%). MGM-Boost (28.12%) also shows the higher prediction accuracy than AdaBoost (24.65%) and SVM (15.42%)in terms of geometric mean-based prediction accuracy. T-test is used to examine whether the performance of each classifiers for 30 folds is significantly different. The results indicate that performance of MGM-Boost is significantly different from AdaBoost and SVM classifiers at 1% level. These results mean that MGM-Boost can provide robust and stable solutions to multi-classproblems such as bond rating.

This work presents an automated diabetes mellitus detection system (DMDS), based on wrist photoplethysmography (PPG) signal and physiological parameters. The PPG signal with an average duration of 2.5 minutes is obtained using the handle Empatica E4 Wristband from 217 patients. The mel frequency cepstral coefficients (MFCC) features are extracted from 5 second segments of the PPG signal. The extracted features and physiological parameters constitute the input for machine learning (ML) systems. K-nearest neighbors (KNN) and Support Vector machine (SVM) algorithms are used for classification. 83.87% and 84.49% classification accuracy is achieved with KNN and radial basis function (RBF) Kernel SVM based DMDS respectively. Further principal component analysis is used on the input feature set to the SVM classifier which provides 7.79% improvement in the performance. The performance of the developed systems is also analysed using entropy triangle. Results reveal the effectiveness of proposed DMDS for non-invasive DM detection. The designed wrist band identifies the diabetic and pre-diabetic cases in real time on the basis of short duration PPG signal and physiological parameters.

Support vector machine (SVM) is a statistical learning tool developed to a more complex concept of structural risk minimization. SVM is playing an increasing role in applications to detection problems in statistical signal processing and communication systems. In this paper, SVM is applied to the detection of root-mean-square-gain combining (RMSGC) diversity signals in single-input-multiple-output (SIMO) systems, in the presence of channel noise characterized as partially developed Rician multipath fading and interference noise generalized as additive color Gaussian noise (ACGN). The structure and performance of SVM in terms of the bit error rate (BER) metric is analysed for these advanced stochastic noise models. The performance of SVM is then compared to conventional SIMO signaling with optimal model-based detection. We show that the SVM performance is superior to that of the maximum likelihood detector for all the selected pre-detection diversity gain combining schemes.

Objective. The quantitative assessment of Parkinsonian tremor, e.g. (0, 1, 2, 3, 4) according to the Movement Disorder Society-Unified Parkinson’s Disease Rating Scale, is crucial for treating Parkinson’s disease. However, the tremor amplitude constantly fluctuates due to environmental and psychological effects on the patient. In clinical practice, clinicians assess the tremor severity for a short duration, whereas manual tremor labeling relies on the clinician’s physician experience. Therefore, automatic tremor quantification based on wearable inertial sensors and machine learning algorithms is affected by the manual labels of clinicians. In this study, an automatic modification method for the labels judged by clinicians is presented to improve Parkinsonian tremor quantitation. Approach. For the severe overlapping of dynamic feature range between different severities, an outlier modification algorithm (PCA-IQR) based on the combination of principal component analysis and interquartile range statistic rule is proposed to learn the blurred borders between different severity scores, thereby optimizing the labels. Afterward, according to the modified feature vectors, a support vector machine (SVM) with a radial basis function (RBF) kernel is proposed to classify the tremor severity. The classifier models of SVM with RBF kernel, k-nearest neighbors, and SVM with the linear kernel are compared. Main results. Experimental results show that the proposed method has high classification performance and excellent model generalization ability for tremor quantitation (accuracy: 97.93%, precision: 97.96%, sensitivity: 97.93%, F1-score: 97.94%). Significance. The proposed method may not only provide valuable assistance for clinicians to assess the tremor severity accurately, but also provides self-monitoring for patients at home and improve the assessment skills of clinicians.

Indonesia holds vast tourism potential, including Nusa Penida, Bali, renowned for its natural beauty. However, the adoption of modern technology to support tourism promotion and management remains limited. This study aims to compare the performance of Support Vector Machine (SVM) with Radial Basis Function (RBF) kernel and Random Forest algorithms in classifying images of three main tourist attractions in Nusa Penida: Angel’s Billabong, Broken Beach, and Kelingking Beach. The dataset consists of 450 images processed using the Histogram of Oriented Gradients (HOG) method for feature extraction. Two data split scenarios (80:20 and 70:30) were applied to evaluate the algorithms based on accuracy, precision, recall, and F1-score metrics. The experimental results revealed that SVM with RBF kernel outperformed Random Forest in all scenarios, achieving the best results in the 70% training and 30% testing data split with an accuracy of 0.967, precision of 0.969, recall of 0.967, and F1-score of 0.967. While Random Forest demonstrated stable performance, it remained inferior to SVM with RBF kernel. This study concludes that SVM with RBF kernel is superior for image classification tasks, offering opportunities for implementing artificial intelligence technologies to advance the tourism sector in Indonesia.