scholarly journals Pulmonary Nodule Recognition Based on Multiple Kernel Learning Support Vector Machine-PSO

2018 ◽  
Vol 2018 ◽  
pp. 1-10 ◽  
Author(s):  
Yang Li ◽  
Zhichuan Zhu ◽  
Alin Hou ◽  
Qingdong Zhao ◽  
Liwei Liu ◽  
...  
Keyword(s):  
Support Vector Machine ◽  
Pulmonary Nodule ◽  
Multiple Kernel Learning ◽  
Pso Algorithm ◽  
Support Vector ◽  
Training Time ◽  
Inertia Weight ◽  
Fitness Value ◽  
Svm Algorithm ◽  
Fitness Curve

Pulmonary nodule recognition is the core module of lung CAD. The Support Vector Machine (SVM) algorithm has been widely used in pulmonary nodule recognition, and the algorithm of Multiple Kernel Learning Support Vector Machine (MKL-SVM) has achieved good results therein. Based on grid search, however, the MKL-SVM algorithm needs long optimization time in course of parameter optimization; also its identification accuracy depends on the fineness of grid. In the paper, swarm intelligence is introduced and the Particle Swarm Optimization (PSO) is combined with MKL-SVM algorithm to be MKL-SVM-PSO algorithm so as to realize global optimization of parameters rapidly. In order to obtain the global optimal solution, different inertia weights such as constant inertia weight, linear inertia weight, and nonlinear inertia weight are applied to pulmonary nodules recognition. The experimental results show that the model training time of the proposed MKL-SVM-PSO algorithm is only 1/7 of the training time of the MKL-SVM grid search algorithm, achieving better recognition effect. Moreover, Euclidean norm of normalized error vector is proposed to measure the proximity between the average fitness curve and the optimal fitness curve after convergence. Through statistical analysis of the average of 20 times operation results with different inertial weights, it can be seen that the dynamic inertial weight is superior to the constant inertia weight in the MKL-SVM-PSO algorithm. In the dynamic inertial weight algorithm, the parameter optimization time of nonlinear inertia weight is shorter; the average fitness value after convergence is much closer to the optimal fitness value, which is better than the linear inertial weight. Besides, a better nonlinear inertial weight is verified.

Modeling of Flexible Structures by Means of Least Square Support Vector Machine

2015 ◽  
Author(s):  
Hammam Tamimi ◽  
Dirk Söffker
Keyword(s):  
Support Vector Machine ◽  
Least Squares ◽  
Flexible Structures ◽  
Operating Conditions ◽  
Least Square ◽  
Support Vector ◽  
Suitable Model ◽  
Support Vector Machine Algorithm ◽  
Training Time ◽  
Svm Algorithm

This paper investigates modeling of flexible structures by means of the least squares support vector machine (LS-SVM) algorithm. Modeling is the first step to obtain a suitable model-based controller for any given system. Accurate modeling of a flexible structure based on experimental data using LS-SVM algorithm requires less knowledge about the physical system. Least squares support vector machine algorithm can achieve global and unique solution when compared with other soft computing algorithms. Also, LS-SVM algorithm requires less training time. In this paper, the successful use of support vector machine algorithm to model the flexible cantilever is demonstrated. The acquired model is able to provide accurate prediction of the system output under different operating conditions. Experimental results demonstrate the efficiency and high precision of the proposed approach.

scholarly journals MRI Image Segmentation Model with Support Vector Machine Algorithm in Diagnosis of Solitary Pulmonary Nodule

2021 ◽  
Vol 2021 ◽  
pp. 1-10
Author(s):  
Bo Feng ◽  
Meihua Zhang ◽  
Hanlin Zhu ◽  
Lingang Wang ◽  
Yanli Zheng
Keyword(s):  
Support Vector Machine ◽  
Image Segmentation ◽  
Pulmonary Nodule ◽  
Solitary Pulmonary Nodule ◽  
Support Vector ◽  
B Values ◽  
Svm Algorithm ◽  
Malignant Group ◽  
Benign Group ◽  
Mri Image

This study focused on the application value of MRI images processed by a Support Vector Machine (SVM) algorithm-based model in diagnosis of benign and malignant solitary pulmonary nodule (SPN). The SVM algorithm was constrained by a self-paced regularization item and gradient value to establish the MRI image segmentation model (SVM-L) for lung. Its performance was compared factoring into the Dice index (DI), sensitivity (SE), specificity (SP), and Mean Square Error (MSE). 28 SPN patients who underwent the parallel MRI examination were selected as research subjects and were divided into the benign group (11 patients) and malignant group (17 patients) according to different plans for diagnosis and treatment. The apparent diffusion coefficient (ADC) at different b values was analyzed, and the steepest slope (SS) and washout ratio (WR) values in the two groups were calculated. The result showed that the MSE, DI, SE, SP values, and operation time of the SVM-L model were (0.41 ± 0.02), (0.84 ± 0.13), (0.89 ± 0.04), (0.993 ± 0.004), and (30.69 ± 2.60)s, respectively, apparently superior to those of the other algorithms, but there were no statistic differences ( P > 0.05 ) in the WR value between the two groups of patients. The SS values of the time-signal curve in the benign and malignant groups were (2.52 ± 0.69) %/s and (3.34 ± 00.41) %/s, respectively. Obviously, the SS value of the benign group was significantly lower than that of the malignant group ( P < 0.01 ). The ADC value with different b values in the benign group was significantly lower than that of the malignant group ( P < 0.01 ). It suggested that the SVM-L model significantly improved the quality of lung MRI images and increased the accuracy to differentiate benign and malignant SPN, providing reference for the diagnosis and treatment of SPN patients.

Algorithm Comparation of Naive Bayes and Support Vector Machine based on Particle Swarm Optimization in Sentiment Analysis of Freight Forwarding Services

2020 ◽  
Vol 4 (2) ◽  
pp. 362-369
Author(s):  
Sharazita Dyah Anggita ◽  
Ikmah
Keyword(s):  
Support Vector Machine ◽  
Sentiment Analysis ◽  
Naive Bayes ◽  
Naïve Bayes ◽  
Support Vector ◽  
The Public ◽  
Svm Algorithm ◽  
Bayes Algorithm ◽  
Freight Forwarding ◽  
Improved Accuracy

The needs of the community for freight forwarding are now starting to increase with the marketplace. User opinion about freight forwarding services is currently carried out by the public through many things one of them is social media Twitter. By sentiment analysis, the tendency of an opinion will be able to be seen whether it has a positive or negative tendency. The methods that can be applied to sentiment analysis are the Naive Bayes Algorithm and Support Vector Machine (SVM). This research will implement the two algorithms that are optimized using the PSO algorithms in sentiment analysis. Testing will be done by setting parameters on the PSO in each classifier algorithm. The results of the research that have been done can produce an increase in the accreditation of 15.11% on the optimization of the PSO-based Naive Bayes algorithm. Improved accuracy on the PSO-based SVM algorithm worth 1.74% in the sigmoid kernel.

Search on Method of Netwok Intrusion Detection Based on Support Vector Machine with Pre-Extracting Support Vector

2013 ◽  
Vol 655-657 ◽  
pp. 1787-1790
Author(s):  
Sheng Chen Yu ◽  
Li Min Sun ◽  
Yang Xue ◽  
Hui Guo ◽  
Xiao Ju Wang ◽  
...  
Keyword(s):  
Support Vector Machine ◽  
Intrusion Detection ◽  
Intrusion Detection System ◽  
Detection System ◽  
Detection Algorithm ◽  
Support Vector ◽  
Distance Ratio ◽  
Training Time ◽  
Training Examples ◽  
Center Distance

Intrusion detection algorithm based on support vector machine with pre-extracting support vector is proposed which combines the center distance ratio and classification algorithm. Given proper thresholds, we can use the support vector as a substitute for the training examples. Then the scale of dataset is decreased and the performance of support vector machine is improved in the detection rate and the training time. The experiment result has shown that the intrusion detection system(IDS) based on support vector machine with pre-extracting support needs less training time under the same detection performance condition.

scholarly journals Improved Instance Selection Methods for Support Vector Machine Speed Optimization

2017 ◽  
Vol 2017 ◽  
pp. 1-11 ◽  
Author(s):  
Andronicus A. Akinyelu ◽  
Aderemi O. Adewumi
Keyword(s):  
Support Vector Machine ◽  
Machine Learning Algorithms ◽  
Support Vector ◽  
Instance Selection ◽  
Training Time ◽  
Svm Classification ◽  
Support Vectors ◽  
Increase With Increase ◽  
Dataset Size ◽  
Machine Speed

Support vector machine (SVM) is one of the top picks in pattern recognition and classification related tasks. It has been used successfully to classify linearly separable and nonlinearly separable data with high accuracy. However, in terms of classification speed, SVMs are outperformed by many machine learning algorithms, especially, when massive datasets are involved. SVM classification speed scales linearly with number of support vectors, and support vectors increase with increase in dataset size. Hence, SVM classification speed can be enormously reduced if it is trained on a reduced dataset. Instance selection techniques are one of the most effective techniques suitable for minimizing SVM training time. In this study, two instance selection techniques suitable for identifying relevant training instances are proposed. The techniques are evaluated on a dataset containing 4000 emails and results obtained compared to other existing techniques. Result reveals excellent improvement in SVM classification speed.

scholarly journals Intercropping Classification From GF-1 and GF-2 Satellite Imagery Using a Rotation Forest Based on an SVM

2019 ◽  
Vol 8 (2) ◽  
pp. 86 ◽  
Author(s):  
Ping Liu ◽  
Xi Chen
Keyword(s):  
Support Vector Machine ◽  
Satellite Imagery ◽  
Vegetation Cover ◽  
Support Vector ◽  
Sufficient Information ◽  
Classification Result ◽  
Rotation Forest ◽  
Svm Algorithm ◽  
Multi Temporal ◽  
Occurrence Matrix

Remote sensing has been widely used in vegetation cover research but is rarely used for intercropping area monitoring. To investigate the efficiency of Chinese Gaofen satellite imagery, in this study the GF-1 and GF-2 of Moyu County south of the Tarim Basin were studied. Based on Chinese GF-1 and GF-2 satellite imagery features, this study has developed a comprehensive feature extraction and intercropping classification scheme. Textural features derived from a Gray level co-occurrence matrix (GLCM) and vegetation features derived from multi-temporal GF-1 and GF-2 satellites were introduced and combined into three different groups. The rotation forest method was then adopted based on a Support Vector Machine (RoF-SVM), which offers the advantage of using an SVM algorithm and that boosts the diversity of individual base classifiers by a rotation forest. The combined spectral-textural-multitemporal features achieved the best classification result. The results were compared with those of the maximum likelihood classifier, support vector machine and random forest method. It is shown that the RoF-SVM algorithm for the combined spectral-textural-multitemporal features can effectively classify an intercropping area (overall accuracy of 86.87% and kappa coefficient of 0.78), and the classification result effectively eliminated salt and pepper noise. Furthermore, the GF-1 and GF-2 satellite images combined with spectral, textural, and multi-temporal features can provide sufficient information on vegetation cover located in an extremely complex and diverse intercropping area.

An Improved Particle Swarm Optimization Algorithm with Adaptive Inertia Weights

2019 ◽  
Vol 18 (03) ◽  
pp. 833-866 ◽  
Author(s):  
Mi Li ◽  
Huan Chen ◽  
Xiaodong Wang ◽  
Ning Zhong ◽  
Shengfu Lu
Keyword(s):  
Particle Swarm Optimization ◽  
Particle Swarm ◽  
Pso Algorithm ◽  
Local Optimum ◽  
Random Mutation ◽  
Swarm Optimization ◽  
Inertia Weight ◽  
Fitness Value ◽  
The One ◽  
Individual Particles

The particle swarm optimization (PSO) algorithm is simple to implement and converges quickly, but it easily falls into a local optimum; on the one hand, it lacks the ability to balance global exploration and local exploitation of the population, and on the other hand, the population lacks diversity. To solve these problems, this paper proposes an improved adaptive inertia weight particle swarm optimization (AIWPSO) algorithm. The AIWPSO algorithm includes two strategies: (1) An inertia weight adjustment method based on the optimal fitness value of individual particles is proposed, so that different particles have different inertia weights. This method increases the diversity of inertia weights and is conducive to balancing the capabilities of global exploration and local exploitation. (2) A mutation threshold is used to determine which particles need to be mutated. This method compensates for the inaccuracy of random mutation, effectively increasing the diversity of the population. To evaluate the performance of the proposed AIWPSO algorithm, benchmark functions are used for testing. The results show that AIWPSO achieves satisfactory results compared with those of other PSO algorithms. This outcome shows that the AIWPSO algorithm is conducive to balancing the abilities of the global exploration and local exploitation of the population, while increasing the diversity of the population, thereby significantly improving the optimization ability of the PSO algorithm.

Analysis of HCV’s Linearity Using Support Vector Machine (SVM)

2014 ◽  
Vol 548-549 ◽  
pp. 1265-1269
Author(s):  
Yun Sik Hwang ◽  
Byeong Joo Jun ◽  
Tae Seon Yoon
Keyword(s):  
Neural Network ◽  
Support Vector Machine ◽  
Hepatitis C Virus ◽  
Data Analysis ◽  
Hepatitis C ◽  
Amino Acid ◽  
Support Vector ◽  
Svm Algorithm ◽  
Genetic Patterns

As the stage of bioinformatics has been upgraded, classification of certain pathogen has been improved into a new manner. The main topic of this research is genetic singularity of HCV (Hepatitis C Virus) and our objective is to assay features of the HCV's amino acid under usage of Support Vector Machine (SVM) algorithm. HCV data used in our experiment has 10 kinds of sequences and 257 kinds of data. According to data analysis, some peculiar genetic patterns of HCV’s linearity that discord pre-existing neural network and C5.0 were found.

scholarly journals The Prediction of Human Abdominal Adiposity Based on the Combination of a Particle Swarm Algorithm and Support Vector Machine

2020 ◽  
Vol 17 (3) ◽  
pp. 1117
Author(s):  
Xiue Gao ◽  
Wenxue Xie ◽  
Shifeng Chen ◽  
Junjie Yang ◽  
Bo Chen
Keyword(s):  
Support Vector Machine ◽  
Sample Size ◽  
Size Dependence ◽  
Prediction Models ◽  
Test Group ◽  
Support Vector ◽  
Particle Swarm Algorithm ◽  
Abdominal Adiposity ◽  
Modeling Group ◽  
Svm Algorithm

Background: Abdominal adiposity is an important risk factor of chronic cardiovascular diseases, thus the prediction of abdominal adiposity and obesity can reduce the risks of contracting such diseases. However, the current prediction models display low accuracy and high sample size dependence. The purpose of this study is to put forward a new prediction method based on an improved support vector machine (SVM) to solve these problems. Methods: A total of 200 individuals participated in this study and were further divided into a modeling group and a test group. Their physiological parameters (height, weight, age, the four parameters of abdominal impedance and body fat mass) were measured using the body composition tester (the universal INBODY measurement device) based on BIA. Intelligent algorithms were used in the modeling group to build predictive models and the test group was used in model performance evaluation. Firstly, the optimal boundary C and parameter gamma were optimized by the particle swarm algorithm. We then developed an algorithm to classify human abdominal adiposity according to the parameter setup of the SVM algorithm and constructed the prediction model using this algorithm. Finally, we designed experiments to compare the performances of the proposed method and the other methods. Results: There are different abdominal obesity prediction models in the 1 KHz and 250 KHz frequency bands. The experimental data demonstrates that for the frequency band of 250 KHz, the proposed method can reduce the false classification rate by 10.7%, 15%, and 33% in relation to the sole SVM algorithm, the regression model, and the waistline measurement model, respectively. For the frequency band of 1 KHz, the proposed model is still more accurate. (4) Conclusions: The proposed method effectively improves the prediction accuracy and reduces the sample size dependence of the algorithm, which can provide a reference for abdominal obesity.

scholarly journals Comparison of Support Vector Machine-Based Techniques for Detection of Bearing Faults

2018 ◽  
Vol 2018 ◽  
pp. 1-13
Author(s):  
Lijun Wang ◽  
Shengfei Ji ◽  
Nanyang Ji
Keyword(s):  
Support Vector Machine ◽  
Global Optimization ◽  
Fault Diagnosis ◽  
Model Simulation ◽  
Rolling Bearing ◽  
Support Vector ◽  
Denoising Method ◽  
Svm Algorithm ◽  
Svm Model ◽  
Shuffled Frog Leaping

This paper presents a method that combines Shuffled Frog Leaping Algorithm (SFLA) with Support Vector Machine (SVM) method in order to identify the fault types of rolling bearing in the gearbox. The proposed method improves the accuracy of fault diagnosis identification after processing the collected vibration signals through wavelet threshold denoising. The global optimization and high computational efficiency of SFLA are applied to the SVM model. Simulation results show that the SFLA-SVM algorithm is effective in fault diagnosis. Compared with SVM and Particle Swarm Optimization SVM (PSO-SVM) algorithms, it is demonstrated that the SFLA-SVM algorithm has the advantages of better global optimization, higher accuracy, and better reliability of diagnosis. Its accuracy is further improved through the integration of the wavelet threshold denoising method.

Sign in / Sign up

Export Citation Format

Share Document