scholarly journals Selection of Tuning Parameter in L1-Support Vector Machine via. Particle Swarm Optimization Method

2019 ◽  
Vol 15 (1) ◽  
pp. 310-318
Author(s):  
Niam Abdulmunim Al-Thanoon ◽  
Omar Saber Qasim ◽  
Zakariya Yahya Algamal
Author(s):  
Elin Panca Saputra ◽  
Sukmawati Angreani Putri ◽  
Indriyanti Indriyanti

Prediction is a systematic estimate that identifies past and future information, we predict the success of learning with elearning based on a log of student activities. In our current study we use the Support vector machine (SVM) method which is comparable with Particle Swarm Optimization. It is known that SVM has a very good generalization that can solve a problem. however, some of the attributes in the data can reduce accuracy and add complexity to the Support Vector Machine (SVM) algorithm. It is necessary for existing tribute selection, therefore using the Particle swarm optimization (PSO) method is applied to the right attribute selection in determining the success of elearning learning based on student activity logs, because with the Swarm Optimization (PSO) method can increase accuracy in determining selection of attributes.


2015 ◽  
Vol 15 (3) ◽  
pp. 140-149 ◽  
Author(s):  
Huang Dong ◽  
Gao Jian

Abstract This paper proposes a SVM (Support Vector Machine) parameter selection based on CPSO (Chaotic Particle Swarm Optimization), in order to determine the optimal parameters of the support vector machine quickly and efficiently. SVMs are new methods being developed, based on statistical learning theory. Training a SVM can be formulated as a quadratic programming problem. The parameter selection of SVMs must be done before solving the QP (Quadratic Programming) problem. The PSO (Particle Swarm Optimization) algorithm is applied in the course of SVM parameter selection. Due to the sensitivity and frequency of the initial value of the chaotic motion, the PSO algorithm is also applied to improve the particle swarm optimization, so as to improve the global search ability of the particles. The simulation results show that the improved CPSO can find more easily the global optimum and reduce the number of iterations, which also makes the search for a group of optimal parameters of SVM quicker and more efficient.


2018 ◽  
Vol 4 (10) ◽  
pp. 6
Author(s):  
Shivangi Bhargava ◽  
Dr. Shivnath Ghosh

News popularity is the maximum growth of attention given for particular news article. The popularity of online news depends on various factors such as the number of social media, the number of visitor comments, the number of Likes, etc. It is therefore necessary to build an automatic decision support system to predict the popularity of the news as it will help in business intelligence too. The work presented in this study aims to find the best model to predict the popularity of online news using machine learning methods. In this work, the result analysis is performed by applying Co-relation algorithm, particle swarm optimization and principal component analysis. For performance evaluation support vector machine, naïve bayes, k-nearest neighbor and neural network classifiers are used to classify the popular and unpopular data. From the experimental results, it is observed that support vector machine and naïve bayes outperforms better with co-relation algorithm as well as k-NN and neural network outperforms better with particle swarm optimization.


Sign in / Sign up

Export Citation Format

Share Document