Privacy-Preserving Outsourced Support Vector Machine Design for Secure Drug Discovery

This paper presents a classification method for power quality problems in electrical power systems. To improve the electric power quality, sources of disturbances must be known and controlled. Power quality disturbance waveform recognition is often troublesome because it involves a broad range of disturbance categories or classes. This is a study of power quality problem classification using support vector machine. After training support vector machine, the parameter of support vector machine is obtained for using to classify the power quality problems. The support vector machine is able to classify 4 types for power quality problems correctly.

Automatic recognition of skin symptom plays an importance role in the skin diagnosis and treatment. Feature selection is to increase the classification performance of skin symptom. In this paper, the effects of feature selection on the classification of 4-class skin symptoms (chloasma, blackhead, freckled and comedone) are analyzed. Support vector machine (SVM) is employed to construct classifier, the parameters setting is very crucial to the learning results and generalization ability of SVM, and many irrelevant and redundant features degrade the performance of classification, furthermore, the choice of SVM parameters is influenced by the feature subset taken into account and vice versa. So a joint optimization method for selecting features and SVM parameters is proposed. Genetic algorithms, which have a lot of improvements about fitness, crossover and mutation in comparison with simple genetic algorithms, is to achieve a balance between the classification accuracy and the size of the feature subsets selected and have a fast convergence rate. Furthermore, ‘one-against-one’ approach is used to solve multi-class classification problems and a comparison of the model performances is made among the results of the joint optimization and the single optimization of features or SVM parameters in the experiments. The simulation result shows that our approach can find subsets of features for 4-class skin symptoms classification with higher average cross validation accuracy and a higher rate of convergence compared with single optimization of features or SVM parameters.

These days, the Internet is developing at an exponential rate and can cover just about any data required. Nonetheless, the immense measure of web pages makes it more difficult to effectively discover the target data by a user. Therefore, an efficient method, for classifying this huge amount of data is essential if the web pages are to be exploited to its full potential. In the domain of automatic web page classifier many approaches have been tried to solve this problem using different Machine learning-based algorithms including Support Vector Machine (SVM), Naive Bayes, Decision Tree, K-Nearest Neighbor (K-NN) and Neural Networks. However, there is a lack of comparison between these algorithms to find a better framework for the classification and analysis of health related web pages. In this research study, we compare two commonly used supervised Machine Learning algorithms; Support Vector Machines (SVM) and Naive Bayes to classify web pages which provide drugs related information of patients for example side effects, patient action and follow-up information for patients. We use Unified Medical Language System (UMLS) to annotate the health related concepts in Web pages and train SVM and Naive Bayes classifiers in General Architecture for Text Engineering to classify health related and non-health related Web pages. The evaluation was performed using K-fold cross validation using four runs on a data set of fifty Web pages. Results found that SVM performed better to classify health and non-health related pages in terms of precision, recall and F-measure.

Support vector machine (SVM) and artificial neural network (ANN) systems were applied to a drug/nondrug classification problem as an example of binary decision problems in early-phase virtual compound filtering and screening. The results indicate that solutions obtained by SVM training seem to be more robust with a smaller standard error compared to ANN training. Generally, the SVM classifier yielded slightly higher prediction accuracy than ANN, irrespective of the type of descriptors used for molecule encoding, the size of the training data sets, and the algorithm employed for neural network training. The performance was compared using various different descriptor sets and descriptor combinations based on the 120 standard Ghose-Crippen fragment descriptors, a wide range of 180 different properties and physicochemical descriptors from the Molecular Operating Environment (MOE) package, and 225 topological pharmacophore (CATS) descriptors. For the complete set of 525 descriptors cross-validated classification by SVM yielded 82% correct predictions (Matthews cc = 0.63), whereas ANN reached 80% correct predictions (Matthews cc = 0.58). Although SVM outperformed the ANN classifiers with regard to overall prediction accuracy, both methods were shown to complement each other, as the sets of true positives, false positives (overprediction), true negatives, and false negatives (underprediction) produced by the two classifiers were not identical. The theory of SVM and ANN training is briefly reviewed.

A combination classification algorithm, ER-SVM, is proposed to improve the generalization performance of support vector machine (SVM) by directly making full use of the empirical risk (ER) information of SVM in the paper. SVM classification is the implementation of structure risk minimization (SRM) principle. SVM may achieve SRM from the minimal summation of ER and VC confidence according to the theory of VC dimension. However, the ER is seldom zero for a trained SVM in practice. That is, though the minimal summation of ER and VC confidence can be achieved in theory, it is very time-consuming in parameters selection for a given task to make ER zero. In order to overcome such difficulty, a combination classification algorithm is proposed to improve the performance by utilizing ER information. The SR arising from the existing ER is reduced by using aided nearest neighbor method. In addition, the proposed algorithm is independent of training parameters in SVM. The experimental results verify the effectiveness of the proposed algorithm

A Computer Aided Dental X-rays Analysis (CADXA) framework is proposed to semi-automatically detect areas of bone loss and root decay in digital dental X-rays. In this framework, first, a new proposed competitive coupled level set method is proposed to segment the image into three pathologically meaningful regions using two coupled level set functions. Tailored for the dental clinical environment, the segmentation stage uses a trained support vector machine (SVM) classifier to provide initial contours. Then, based on the segmentation results, an analysis scheme is applied. First, the scheme builds an uncertainty map from which those areas with bone loss will be automatically detected. Secondly, the scheme employs a method based on the SVM and the average intensity profile to isolate the teeth and detect root decay. Experimental results show that our proposed framework is able to automatically detect the areas of bone loss and, when given the orientation of the teeth, it is able to automatically detect the root decay with a seriousness level marked for diagnosis.

A two-class support vector machine (SVM)-based image segmentation approach has been developed for the extraction of nasopharyngeal carcinoma (NPC) lesion from magnetic resonance (MR) images. By exploring two-class SVM, the developed method can learn the actual distribution of image data without prior knowledge and draw an optimal hyperplane for class separation, via an SVM parameters training procedure and an implicit kernel mapping. After learning, segmentation task is performed by the trained SVM classifier. The proposed technique is evaluated by 39 MR images with NPC and the results suggest that the proposed query-based approach provides an effective method for NPC extraction from MR images with high accuracy.

Support Vector Machine (SVM) has become a popular method in machine learning in recent years. SVM is widely used as a tool in many classifiction areas. The selection optimum values of the parameters (model selection) for SVM is an important step in SVM design. This paper presents the results of research and testing method Particle Swarm Optimization (PSO) in selecting the parameters for SVM. Here we focus on the selection parameter γ of the RBF function and soft margin parameter C of SVM for classification problems. In this paper we propose a Particle Swarm Optimization variation model which combine the cognition-only model with the social-only model and use randomised low discrepancy sequences for initialising particle swarms. We then evaluate the suggested strategies with a series of experiments on 6 benchmark datasets. Experimental results demonstrate the model we proposed better than grid search and full PSO-SVM model.

Parameters of support vector machines (SVM) which is optimized by standard genetic algorithm is easy to trap into the local minimum, in order to get the optimal parameters of support vector machine, this paper proposed a parameters optimization method for support vector machines based on improved genetic algorithm, the simulation experiment is carried out on 5 benchmark datasets. The simulation show that the proposed method not only can assure the classification precision, but also can reduce training time markedly compared with standard genetic algorithm. DOI : http://dx.doi.org/10.11591/telkomnika.v12i1.3182

Hyperspectral remote sensing imagery, due to its rich source of spectral information, provides an efficient tool for land cover classifications in complex geographical areas. However, the high-dimensional space of this imagery poses two important challenges in the classification process: the Hughes phenomena and the existence of relevant and redundant features. The robustness of Support Vector Machines (SVM) in high-dimensional space makes them an efficient tool for classifying hyperspectral imagery. However, optimum SVM parameter determination and optimum feature selection are the two optimization issues that strongly effect SVM performance. Traditional optimization algorithms can discover optimum solutions in a limited search space with one local optimum. Nevertheless, in high-dimensional space traditional optimization algorithms usually get trapped in a local optimum, therefore it is necessary to apply meta-heuristic optimization algorithms to obtain near-global optimum solutions. This study evaluates the potential of Ant Colony Optimization (ACO) for determining SVM parameters and selecting features. Results obtained from AVIRIS and ROSIS hyperspectral datasets demonstrate the superior performance of SVM, achieved by simultaneously optimizing SVM parameters and subsets of the input feature. For comparison, the evaluation is also performed by applying it to other meta-heuristic optimization algorithms such as simulated annealing, tabu search, and genetic algorithm. The results demonstrate a better performance of the ACO-based algorithm in regards to improving the classification accuracy and decreasing the size of selected feature subsets.

(1) Background: The coronavirus variants have posed serious challenges for the prevention and control of the COVID-19 pandemic. Individuals selectively watch and forward videos that help them reduce the damage caused by the virus. Therefore, the factors influencing video viewing and sharing in the context of the COVID-19 pandemic caused by virus variation must be explored. (2) Method: Based on a combination of uncertainty reduction theory and functional emotion theory, this paper designed hypotheses regarding how content relevance and emotional consistency affect video views and shares. We used the support vector machine (SVM) classification algorithm to measure the content relevance between videos and virus variant topics. We performed sentiment analysis of video text to evaluate the emotional consistency between videos and virus variant topics. Then, we used empirical analysis to build the model. (3) Results: The trained SVM classifier was effective in judging whether the video text was related to virus variant topics (F = 88.95%). The content relevance between COVID-19 videos and virus variant topics was generally low. The results showed that the higher the content relevance, the more views (IRR = 1.005, p = 0.017) and shares (IRR = 1.008, p = 0.009) the video received. Individuals were more willing to view (IRR = 1.625, p < 0.001) and share (IRR = 1.761, p < 0.001) COVID-19 videos with high emotional consistency with virus variant topics. (4) Conclusions: The results of empirical analysis showed that content relevance and emotional consistency between videos and virus variant topics significantly positively impacted video views and shares. The trained SVM classifier can support public health departments in monitoring and assessing the COVID-19 pandemic. Our study provides management advice while helping individuals reduce harm and inform next-step decisions.

Abstract. The Support Vector Machine (SVM) is a theoretically superior machine learning methodology with great results in classification of remotely sensed datasets. Determination of optimal parameters applied in SVM is still vague to some scientists. In this research, it is suggested to use the Taguchi method to optimize these parameters. The objective of this study was to detect tree crowns on very high resolution (VHR) aerial imagery in Zagros woodlands by SVM optimized by Taguchi method. A 30 ha plot of Persian oak (Quercus persica) coppice trees was selected in Zagros woodlands, Iran. The VHR aerial imagery of the plot with 0.06 m spatial resolution was obtained from National Geographic Organization (NGO), Iran, to extract the crowns of Persian oak trees in this study. The SVM parameters were optimized by Taguchi method and thereafter, the imagery was classified by the SVM with optimal parameters. The results showed that the Taguchi method is a very useful approach to optimize the combination of parameters of SVM. It was also concluded that the SVM method could detect the tree crowns with a KHAT coefficient of 0.961 which showed a great agreement with the observed samples and overall accuracy of 97.7% that showed the accuracy of the final map. Finally, the authors suggest applying this method to optimize the parameters of classification techniques like SVM.

Support Vector Machine (SVM) is a relatively novel classification technology, which has shown higher performance than traditional learning methods in many applications. Therefore, some security researchers have proposed an intrusion detection method based on SVM. However, the SVM algorithm is very sensitive to the choice of kernel function and parameter adjustment. Once the parameter selection is unscientific, it will lead to poor classification accuracy. To solve this problem, this paper presents a Grey Wolf Optimizer Algorithm based on Particle Swarm Optimization (PSOGWO) algorithm to improve the Intrusion Detection System (IDS) based on SVM. This method uses PSOGWO algorithm to optimize the parameters of SVM to improve the overall performance of intrusion detection based on SVM. The "optimal detection model" of SVM classifier is determined by the fusion of PSOGWO algorithm and SVM. The comparison experiments based on NSL-KDD dataset show that the intrusion detection method based on PSOGWO-SVM achieves the optimization of the parameters of SVM, and has improved significantly in terms of detection rate, convergence speed and model balance. This shows that the method has better performance for network intrusion detection.

To reduce the occurrence of traffic accidents caused by distraction. a detection method based on histogram of oriented gradient (HOG) and support vector machine (SVM) is proposed for driver’s distraction behavior in this paper. Interest region of driver was detected first from video image, also the image was enhanced, denoised and normalized. Then the histogram of oriented gradient is used to extract the feature of the image. Meanwhile, the cross-validation method is used to optimize parameters in SVM. Finally, the effectiveness of the method is verified by compared with classical SVM algorithm and Local Binary Pattern algorithm (LBP) based on SVM algorithms. The results show that, the proposed method can obtain better classification accuracy.

With regard to the lack of the sample of faults in the test of autopilot, a model of fault diagnosis based on support vector machine (SVM) optimized by multi-verse optimizer (MVO) is put forward. SVM does well in solving the few samples and nonlinear problem, which is suitable for the fault diagnosis of autopilot. To solve the overfitting and underfitting resulted from the improper parameters of SVM, multi-verse optimizer was applied to optimizing the parameters of SVM. By this way, a model of fault diagnosis with better performance was built. The simulation experiment results show that the accuracy of SVM based on MVO can achieve 98.3673% using 50 training samples. However, the accuracy of genetic algorithm (GA)-SVM achieves 91.0204% and the accuracy of SVM based on gravitational search algorithm (GSA) achieves 91.6327%. The simulation experiment results shows that SVM based on MVO has much better performance than others.