Efficient Support Vector Machine Research Articles

MaGENEgerZ: An Efficient Artificial Intelligence-Based Framework Can Extract More Expressed Genes and Biological Insights Underlying Breast Cancer Drug Response Mechanism

Understanding breast cancer drug response mechanisms can play a crucial role in improving treatment outcomes and survival rates. Existing bioinformatics-based approaches are far from perfect and do not adopt computational methods based on advanced artificial intelligence concepts. Therefore, we introduce a novel computational framework based on an efficient support vector machine (esvm) working as follows: First, we downloaded and processed three gene expression datasets related to breast cancer responding and non-responding to treatments from the gene expression omnibus (GEO) according to the following GEO accession numbers: GSE130787, GSE140494, and GSE196093. Our method esvm is formulated as a constrained optimization problem in its dual form as a function of λ. We recover the importance of each gene as a function of λ, y, and x. Then, we select p genes out of n, which are provided as input to enrichment analysis tools, Enrichr and Metascape. Compared to existing baseline methods, including deep learning, results demonstrate the superiority and efficiency of esvm, achieving high-performance results and having more expressed genes in well-established breast cancer cell lines, including MD-MB231, MCF7, and HS578T. Moreover, esvm is able to identify (1) various drugs, including clinically approved ones (e.g., tamoxifen and erlotinib); (2) seventy-four unique genes (including tumor suppression genes such as TP53 and BRCA1); and (3) thirty-six unique TFs (including SP1 and RELA). These results have been reported to be linked to breast cancer drug response mechanisms, progression, and metastasizing. Our method is available publicly on the maGENEgerZ web server.

Convolution smoothing and non-convex regularization for support vector machine in high dimensions

The support vector machine (SVM) is a well-known statistical learning tool for binary classification. One serious drawback of SVM is that it can be adversely affected by redundant variables, and research has shown that variable selection is crucial and necessary for achieving good classification accuracy. Hence some SVM variable selection studies have been devoted, and they have an unified “empirical hinge loss plus sparse penalty” formulation. However, a noteworthy issue is the computational complexity of existing methods is high especially for large-scale problems, due to the non-smoothness of the hinge loss. To solve this issue, we first propose a convolution smoothing approach, which turns the non-smooth hinge loss into a smooth surrogate one, and they are asymptotically equivalent. Moreover, we construct computationally more efficient SVM variable selection procedure by implementing non-convex penalized convolution smooth hinge loss. In theory, we prove that the resulting variable selection possesses the oracle property when the number of predictors is diverging. Numerical experiments also confirm the good performance of the new method.

An Efficient Support Vector Machine Algorithm Based Network Outlier Detection System

An Efficient Support Vector Machine Algorithm Based Network Outlier Detection System

A new support vector machine for categorical features

Support vector machine (SVM) was originally developed to solve binary classification problems for objects with only continuous features, and it often outperforms other classifiers. However, we often encounter datasets with mixed-type features or categorical features only. This study proposes an efficient SVM for dealing with such datasets. The proposed SVM uses a subset of categorical features and it performs well in most cases, including imbalanced and/or high-dimensional categorical datasets. In particular, it is more efficient than existing SVMs in high-dimensional categorical datasets. To validate its performance, it is applied to simulated datasets and various benchmark datasets, and it is also compared to existing SVMs for categorical features.

On quantifying uncertainty in lightning strike damage of composite laminates: A hybrid stochastic framework of coupled transient thermal-electrical simulations

Lightning strike damage can severely affect the thermo-mechanical performance of composite laminates. It is essential to quantify the effect of lightning strikes considering the inevitable influence of material and geometric uncertainties for ensuring the operational safety of aircraft. This paper presents an efficient support vector machine (SVM)-based surrogate approach coupled with computationally intensive transient thermal-electrical finite element simulations to quantify the uncertainty in lightning strike damage. The uncertainty in epoxy matrix thermal damage and electrical responses of unprotected carbon/epoxy composite laminates is probabilistically quantified considering the stochasticity in temperature-dependent multi-physical material properties and ply orientations. Further, the SVM models are exploited for variance-based global sensitivity analysis to investigate the input parameters' relative influence on the lightning strike-induced damage behavior. Due to the adoption of a coupled SVM-based simulation approach here, it has become possible to carry out a comprehensive uncertainty quantification leading to complete probabilistic descriptions of the electrical and lightning damage parameters despite the requirement of performing a large number of computationally intensive function evaluations. The results reveal that source-uncertainty of the unprotected laminates significantly influences the epoxy matrix decomposition, electrical current density and electric potential, wherein longitudinal electrical conductivity is most sensitive to stochastic variations followed by other electrical, thermal and geometric parameters.

Machine learning applications for photovoltaic system optimization in zero green energy buildings

In this paper, the energy supply of a zero-energy building with 220 square meters is considered using optimized nanocomposite solar panels with respect to maximum efficiency. An optimized hybrid machine learning method plays a key role in presenting solar panel modeling with over 0.99% accuracy. Predicting the properties of the nanomaterial solar cell in four different seasons is performed by efficient support vector machines (SVM), and k-nearest neighbors (KNN) machine learning algorithms. In addition, the KNN algorithm is optimized by the Particle Swarm Optimization (PSO) method to improve the capabilities of KNN and reveal the best performance criteria for the photovoltaic modeling characteristics. The parameters of the nanocomposite cells are optimized using the proposed novel Multidisciplinary Optimization Method (MDO) to increase the efficiency of the solar panel by up to 170%. Optimization of solar cell performance with nanocomposite material under energy consumption constraints is carried out to propose the best construction of cells with 3 layers. The presented approach as a solution and indicator for the next generation of commercial and residential buildings can increase the potential values of solar cells to at least 70%.

Quantum Fuzzy Support Vector Machine for Binary Classification

In the objective world, how to deal with the complexity and uncertainty of big data efficiently and accurately has become the premise and key to machine learning. Fuzzy support vector machine (FSVM) not only deals with the classification problems for training samples with fuzzy information, but also assigns a fuzzy membership degree to each training sample, allowing different training samples to contribute differently in predicting an optimal hyperplane to separate two classes with maximum margin, reducing the effect of outliers and noise, Quantum computing has super parallel computing capabilities and holds the promise of faster algorithmic processing of data. However, FSVM and quantum computing are incapable of dealing with the complexity and uncertainty of big data in an efficient and accurate manner. This paper research and propose an efficient and accurate quantum fuzzy support vector machine (QFSVM) algorithm based on the fact that quantum computing can efficiently process large amounts of data and FSVM is easy to deal with the complexity and uncertainty problems. The central idea of the proposed algorithm is to use the quantum algorithm for solving linear systems of equations (HHL algorithm) and the least-squares method to solve the quadratic programming problem in the FSVM. The proposed algorithm can determine whether a sample belongs to the positive or negative class while also achieving a good generalization performance. Furthermore, this paper applies QFSVM to handwritten character recognition and demonstrates that QFSVM can be run on quantum computers, and achieve accurate classification of handwritten characters. When compared to FSVM, QFSVM’s computational complexity decreases exponentially with the number of training samples.

Uncertainty quantification of aeroelastic wings flutter using an optimized machine learning approach

This study outlines the flutter characteristics of aeroelastic wings under unsteady aerodynamic loading based on an efficient support vector machine assisted k-method. First, the aeroelastic wing flutter speed and flutter frequency are obtained using k-method. Then, the uncertain input parameters distribution is modeled by probability density functions. These parameters are propagated to the aeroelastic wing equations. The Monte Carlo simulation using 12 parallel logical threads is carried out to obtain the flutter speed and the flutter frequency distribution. An optimal robust surrogate model is trained by limited numbers of input and output using support vector machine. Monte Carlo simulation is also carried out in conjunction with the machine learning based k-method computational framework for obtaining the complete probabilistic description of flutter speed and flutter frequency. The coupled support vector regression based k-method is a novel approach that is first used in the aeroelastic wings flutter. The present method is found to reduce the computational time and cost significantly without compromising the accuracy of results.

Optimization of Support Vector Machine Classifier Using Grey Wolf Optimization Algorithm for Chronic Kidney Disease Prediction

The massive generation of medical data from smart health-care applications in recent years necessitates the development of big data classification strategies. Medical data classification can be used to visualize patterns in the data and detect the presence of the disease in medical data. We present an efficient support vector machine (SVM) hybridized with a grey wolf optimization (GWO) algorithm for chronic kidney disease (CKD) data classification in this work. Initially, infinite feature selection (IFS) algorithm is used to select the best features from a set of available features. The dataset’s selected features are processed and fed into the GWO optimized SVM algorithm. The proposed CKD classification strategy has been simulated in MATLAB. CKD dataset from UCI machine learning repository is utilized for testing the developed strategy. The performance of the proposed CKD classification strategy is examined by accuracy and root mean square error (RMSE) values. According to the investigational findings, the proposed CKD classification system achieved accuracy and RMSE value of 97.58% and 0.1581, respectively, for classifying subjects into the CKD and non-CKD categories. The performance of GWO optimized SVM algorithm is outstanding, according to the experimental observations.

An Efficient Angle-based Universum Least Squares Twin Support Vector Machine for Classification

Universum-based support vector machine incorporates prior information about the distribution of data in training of the classifier. This leads to better generalization performance but with increased computation cost. Various twin hyperplane-based models are proposed to reduce the computation cost of universum-based algorithms. In this work, we present an efficient angle-based universum least squares twin support vector machine (AULSTSVM) for classification. This is a novel approach of incorporating universum in the formulation of least squares-based twin SVM model. First, the proposed AULSTSVM constructs a universum hyperplane, which is proximal to universum data points. Then, the classifying hyperplane is constructed by minimizing the angle with the universum hyperplane. This gives prior information about data distribution to the classifier. In addition to the quadratic loss, we introduce linear loss in the optimization problem of the proposed AULSTSVM, which leads to lesser computation cost of the model. Numerical experiments are performed on several benchmark synthetic, real-world, and large-scale datasets. The results show that proposed AULSTSVM performs better than existing algorithms w.r.t. generalization performance as well as computation time. Moreover, an application to Alzheimer’s disease is presented, where AULSTSVM obtains accuracy of 95% for classification of healthy and Alzheimers subjects. The results imply that the proposed AULSTSVM is a better alternative for classification of large-scale datasets and biomedical applications.

Purging of silence for robust speaker identification in colossal database

The aim of this work is to develop an effective speaker recognition system under noisy environments for large data sets. The important phases involved in typical identification systems are feature extraction, training and testing. During the feature extraction phase, the speaker-specific information is processed based on the characteristics of the voice signal. Effective methods have been proposed for the silence removal in order to achieve accurate recognition under noisy environments in this work. Pitch and Pitch-strength parameters are extracted as distinct features from the input speech spectrum. Multi-linear principle component analysis (MPCA) is is utilized to minimize the complexity of the parameter matrix. Silence removal using zero crossing rate (ZCR) and endpoint detection algorithm (EDA) methods are applied on the source utterance during the feature extraction phase. These features are useful in later classification phase, where the identification is made on the basis of support vector machine (SVM) algorithms. Forward loking schostic (FOLOS) is the efficient large-scale SVM algorithm that has been employed for the effective classification among speakers. The evaluation findings indicate that the methods suggested increase the performance for large amounts of data in noise ecosystems.

Large-Scale Least Squares Twin SVMs

In the last decade, twin support vector machine (TWSVM) classifiers have achieved considerable emphasis on pattern classification tasks. However, the TWSVM formulation still suffers from the following two shortcomings: (1) TWSVM deals with the inverse matrix calculation in the Wolfe-dual problems, which is intractable for large-scale datasets with numerous features and samples, and (2) TWSVM minimizes the empirical risk instead of the structural risk in its formulation. With the advent of huge amounts of data today, these disadvantages render TWSVM an ineffective choice for pattern classification tasks. In this article, we propose an efficient large-scale least squares twin support vector machine (LS-LSTSVM) for pattern classification that rectifies all the aforementioned shortcomings. The proposed LS-LSTSVM introduces different Lagrangian functions to eliminate the need for calculating inverse matrices. The proposed LS-LSTSVM also does not employ kernel-generated surfaces for the non-linear case, and thus uses the kernel trick directly. This ensures that the proposed LS-LSTSVM model is superior to the original TWSVM and LSTSVM. Lastly, the structural risk is minimized in LS-LSTSVM. This exhibits the essence of statistical learning theory, and consequently, classification accuracy on datasets can be improved due to this change. The proposed LS-LSTSVM is solved using the sequential minimal optimization (SMO) technique, making it more suitable for large-scale problems. We further proved the convergence of the proposed LS-LSTSVM. Exhaustive experiments on several real-world benchmarks and NDC-based large-scale datasets demonstrate that the proposed LS-LSTSVM is feasible for large datasets and, in most cases, performed better than existing algorithms.

Bone metabolic biomarker-based diagnosis of type 2 diabetes osteoporosis by support vector machine.

BackgroundDiabetes has significant effects on bone metabolism. Both type 1 and type 2 diabetes can cause osteoporotic fracture. However, it remains challenging to diagnose osteoporosis in type 2 diabetes by bone mineral density which lacks regular changes. Seen another way, osteoporosis can be ascribed to the imbalance of bone metabolism, which is closely related to diabetes as well.MethodsHere, to assist clinicians in diagnosing osteoporosis in type 2 diabetes, an efficient and simple SVM (support vector machine) model was established based on different combinations of biochemical indexes, which were collected from patients who did the test of bone turn-over markers (BTMs) from January 2016 to March 2018 in the department of endocrine, Zhongda Hospital affiliated to Southeast University. The classification was done based on a software package of machine learning in Python. The classification performance was measured by SKLearn program incorporated in the Python software package and compared with the clinical diagnostic results.ResultsThe predicting accuracy rate of final model was above 88%, with feature combination of sex, age, BMI (body mass index), TP1NP (total procollagen I N-terminal propeptide) and OSTEOC (osteocalcin).ConclusionsExperimental results show that the model showed an anticipant result for early detection and daily monitoring on type 2 diabetic osteoporosis.

Large-Scale Twin Parametric Support Vector Machine Using Pinball Loss Function

Traditional hinge loss function-based large-scale support vector machine (SVM) algorithms tend to perform poorly in the presence of noise, especially when the model is trained incrementally. In this paper, we propose an efficient stochastic quasi-Newton method-based twin parametric SVM using the pinball loss function (termed as SQN-PTWSVM), which is efficient and more robust to the presence of noise when compared to conventional hinge loss SVM for large-scale data scenarios. To establish the theoretical convergence of the method, a modified version of SQN-PTWSVM, termed as SQN-SPTWSVM, has also been proposed. It overcomes the poor convergence issue faced by stochastic gradient twin SVM thus resulting in a faster and reliable model. In SQN-SPTWSVM, the hyperplanes obtained are stable enough to handle noise and resampling issues that occur frequently in stochastic learning scenarios, leading to better generalization ability of the classifier. The proposed method has been extended to nonlinear scenarios as well. Moreover, batch versions of the proposed algorithms have also been introduced which significantly reduce the training time and memory requirement of SQN-PTWSVM and SQN-SPTWSVM. The experimental results on several benchmark datasets and activity recognition applications have shown that the performance of our method is better than the existing classifiers in terms of speed and accuracy.

Smart Affect Recognition System for Real-Time Biometric Surveillance Using Hybrid Features and Multilayered Binary Structured Support Vector Machine

Abstract Human affect recognition (HAR) using images of facial expression and electrocardiogram (ECG) signal plays an important role in predicting human intention. This system improves the performance of the system in applications like the security system, learning technologies and health care systems. The primary goal of our work is to recognize individual affect states automatically using the multilayered binary structured support vector machine (MBSVM), which efficiently classify the input into one of the four affect classes, relax, happy, sad and angry. The classification is performed efficiently by designing an efficient support vector machine (SVM) classifier in multilayer mode operation. The classifier is trained using the 8-fold cross-validation method, which improves the learning of the classifier, thus increasing its efficiency. The classification and recognition accuracy is enhanced and also overcomes the drawback of ‘facial mimicry’ by using hybrid features that are extracted from both facial images (visual elements) and physiological signal ECG (signal features). The reliability of the input database is improved by acquiring the face images and ECG signals experimentally and by inducing emotions through image stimuli. The performance of the affect recognition system is evaluated using the confusion matrix, obtaining the classification accuracy of 96.88%.

A Hybrid Intrusion Detection Model Combining SAE with Kernel Approximation in Internet of Things.

Owing to the constraints of time and space complexity, network intrusion detection systems (NIDSs) based on support vector machines (SVMs) face the “curse of dimensionality” in a large-scale, high-dimensional feature space. This study proposes a joint training model that combines a stacked autoencoder (SAE) with an SVM and the kernel approximation technique. The training model uses the SAE to perform feature dimension reduction, uses random Fourier features to perform kernel approximation, and then random Fourier mapping is explicitly applied to the sub-sample to generate the random feature space, making it possible to apply a linear SVM to uniformly approximate to the Gaussian kernel SVM. Finally, the SAE performs joint training with the efficient linear SVM. We studied the effects of an SAE structure and a random Fourier feature on classification performance, and compared that performance with that of other training models, including some without kernel approximation. At the same time, we compare the accuracy of the proposed model with that of other models, which include basic machine learning models and the state-of-the-art models in other literatures. The experimental results demonstrate that the proposed model outperforms the previously proposed methods in terms of classification performance and also reduces the training time. Our model is feasible and works efficiently on large-scale datasets.

Practical and Secure SVM Classification for Cloud-Based Remote Clinical Decision Services

Support vector machine (SVM) classification techniques have been widely adopted for building clinical decision models. In cloud-based remote clinical decision services, a healthcare center outsources the clinical decision model to a cloud server, which then provides remote clinical decision services to end users. In this article, we propose a practical and secure SVM classification scheme ( <inline-formula><tex-math notation="LaTeX">${\sf SSVMC}$</tex-math></inline-formula> ) for cloud-based remote clinical decision services. Specifically, we first extract SVM decision rules from an SVM classifier. Then, we leverage symmetric key encryption to protect the confidentiality of medical data and prevent the cloud service provider from misusing intellectual property of the outsourced clinical model. Finally, we build encrypted indexes to achieve efficient SVM classification. We define a leakage function, formulate a security definition, and provide a simulation-based security proof for <inline-formula><tex-math notation="LaTeX">${\sf SSVMC}$</tex-math></inline-formula> . The performance analysis demonstrates that <inline-formula><tex-math notation="LaTeX">${\sf SSVMC}$</tex-math></inline-formula> achieves linear computational complexity when an SVM classifier (a.k.a., the clinical decision model) is pre-trained. The simulations evaluate the impact of several parameters on time costs. The experimental evaluations show the performance differences between <inline-formula><tex-math notation="LaTeX">${\sf SSVMC}$</tex-math></inline-formula> and several existing schemes in terms of time costs, storage costs, communication costs, and precisions in a real-world clinical dataset, which demonstrate that <inline-formula><tex-math notation="LaTeX">${\sf SSVMC}$</tex-math></inline-formula> is computationally efficient with high decision accuracy.

An Efficient and Privacy-Preserving Outsourced Support Vector Machine Training for Internet of Medical Things

As the use of machine learning in the Internet-of-Medical Things (IoMT) settings increases, so do the data privacy concerns. Therefore, in this article, we propose an efficient privacy-preserving outsourced support vector machine scheme (EPoSVM), designed for IoMT deployment. To securely train the support vector machine (SVM), we design eight secure computation protocols to allow the cloud server to efficiently execute basic integer and floating-point computations. The proposed scheme protects training data privacy and guarantees the security of the trained SVM model. The security analysis proves that our proposed protocols and EPoSVM satisfy both security and privacy protection requirements. Findings from the performance evaluation using two real-world disease data sets also demonstrate the efficiency and effectiveness of EPoSVM in achieving the same classification accuracy as a general SVM.

Multiclass Response Feature Selection and Cancer Tumour Classification With Support Vector Machine

Background &amp; Aim: In this study, efficient Support Vector Machine (SVM) algorithm for feature selection and classification of multi-category tumour classes of biological samples using gene expression profiles was proposed.&#x0D; Methods: Feature selection interface of the algorithm employed the F-statistic of the ANOVA–like testing scheme at some chosen family-wise-error-rate which ensured efficient detection of false-positive genes. The selected gene subsets using the above method were further screened for optimality using the Misclassification Error Rates yielded by each of them and their combinations in a sequential selection manner. In a 10-fold cross-validation, the optimal values of the SVM parameters with appropriate kernel were determined for tissue sample classification using one-versus-all approach. The entire data matrix was randomly partitioned into 95% training set to train the SVM classifier and 5% test set to evaluate the predictive performance of the classifier over 1,000 Monte-Carlo cross-validation runs. Published microarray breast cancer dataset with five clinical endpoints was employed to validate the results from the simulation studies.&#x0D; Results: Results from Monte-Carlo study showed excellent performance of the SVM classifier with higher prediction accuracy of the tissue samples based on the few gene biomarkers selected by the proposed feature selection method.&#x0D; Conclusion: SVM could be considered as a classification of multi-category tumour classes of biological&#x0D;

Speaker Classification with Support Vector Machine and Crossover-Based Particle Swarm Optimization

It has been observed from the literature that speech is the most natural means of communication between humans. Human beings start speaking without any tool or any explicit education. The environment surrounding them helps them to learn the art of speaking. From the existing literature, it is found that the existing speaker classification techniques suffer from over-fitting and parameter tuning issues. An efficient tuning of machine learning techniques can improve the classification accuracy of speaker classification. To overcome this issue, in this paper, an efficient particle swarm optimization-based support vector machine is proposed. The proposed and the competitive speaker classification techniques are tested on the speaker classification data of Punjabi persons. The comparative analysis of the proposed technique reveals that it outperforms existing techniques in terms of accuracy, [Formula: see text]-measure, specificity and sensitivity.