z-logo
open-access-imgOpen Access
Naive Bayes Classifier Optimization on Sentiment Analysis of Hotel Reviews
Author(s) -
Siti Khomsah
Publication year - 2020
Publication title -
jurnal penelitian pos dan informatika
Language(s) - English
Resource type - Journals
eISSN - 2476-9266
pISSN - 2088-9402
DOI - 10.17933/jppi.v10i2.322
Subject(s) - naive bayes classifier , particle swarm optimization , artificial intelligence , computer science , classifier (uml) , bayes' theorem , inertia , machine learning , swarm intelligence , algorithm , pattern recognition (psychology) , bayesian probability , support vector machine , physics , classical mechanics
Feature extraction plays an important role in the sentiment analysis process, especially of text data. The Naive Bayes Classifier performs well on low feature dimensions. However, the accuracy provided is not optimal. To acquire  optimal machine learning model,  information gain method, evolutionary algorithm, and swarm intelligent algorithm are applied. The objective of this study is to determine the performance of the Particle Swarm Optimization (PSO) to optimize the Naive Bayes Classifier. Vectorization of words is carried out using TF-IDF. In order to produce high PSO performance, the PSO-NBC model is tested with several parameters, namely the number of particles (k = 3), setting of the number of iterations and inertia weight, individual intelligence coefficient (c1 = 1), and social intelligence coefficient (c2 = 2). Inert weight is calculated using the formulation (w = 0.5+ Rand ([- 1,1])). In conclusion, PSO is able to solve the problem space of text-based sentiment analysis. PSO is able to optimize the accuracy of Naive Bayes at a value of 89% to 91.76%. PSO performance is determined by the parameters used, especially the number of particles, the number of iterations, and the weight of inertia. A large number of particles accompanied by an increase in inertia weight can increase accuracy. The number of particles 20-30 has reached the optimal accuracy.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here