Pengukuran Kinerja Optimasi Algoritma Bat Pada Algoritma Naive Bayes, KNN Dan Decision Tree Untuk Sentimen Analisis Di Lini Masa Twitter

Candra Adipradana
{"title":"Pengukuran Kinerja Optimasi Algoritma Bat Pada Algoritma Naive Bayes, KNN Dan Decision Tree Untuk Sentimen Analisis Di Lini Masa Twitter","authors":"Candra Adipradana","doi":"10.30646/tikomsin.v11i1.731","DOIUrl":null,"url":null,"abstract":"Social media is a very effective communication media in today's digital era. Of the social media, Twitter is the most widely used social media. Many tweets entered on Twitter have encouraged research in the field of text mining. One of the branches of text mining is sentiment analysis. Sentiment analysis in this study was formed from 3 classification algorithms, namely Naïve Bayes and Decission Tree. In practice, the results of the 3 classification algorithms often produce very low levels of accuracy. Bat algorithm is an algorithm that can optimize the results from the accuracy of the Naïve Bayes, K-NN algorithm and Decission Tree. In this study, two research scenarios were made: first, calculating the accuracy of the Naïve Bayes, K-NN algorithm, and Decission Tree. Second, optimizing the classification results of the 3 algorithms with the Bat algorithm method, which then re-tested the accuracy value. In the first scenario the percentage is generated from the accuracy value of Naïve Bayes of 33,58, K-NN of 33,61 and Decission Tree of 32,82. In the second scenario, using one of the objective functions, namely f(x) = x2, the Naïve Bayes value is obtained 39,01, K-NN 66,15 and Decission Tree 76,63. From the results of 3 the optimization test of classification Algorithm, it was found that the overall objective functions of the Bat algorithm were all able to increase the data accuracy value from before optimization. From all the tests, it was found that the Decision Tree algorithm has the highest average value of optimization increment, namely 43,81 %","PeriodicalId":189908,"journal":{"name":"Jurnal Teknologi Informasi dan Komunikasi (TIKomSiN)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Jurnal Teknologi Informasi dan Komunikasi (TIKomSiN)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.30646/tikomsin.v11i1.731","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Social media is a very effective communication media in today's digital era. Of the social media, Twitter is the most widely used social media. Many tweets entered on Twitter have encouraged research in the field of text mining. One of the branches of text mining is sentiment analysis. Sentiment analysis in this study was formed from 3 classification algorithms, namely Naïve Bayes and Decission Tree. In practice, the results of the 3 classification algorithms often produce very low levels of accuracy. Bat algorithm is an algorithm that can optimize the results from the accuracy of the Naïve Bayes, K-NN algorithm and Decission Tree. In this study, two research scenarios were made: first, calculating the accuracy of the Naïve Bayes, K-NN algorithm, and Decission Tree. Second, optimizing the classification results of the 3 algorithms with the Bat algorithm method, which then re-tested the accuracy value. In the first scenario the percentage is generated from the accuracy value of Naïve Bayes of 33,58, K-NN of 33,61 and Decission Tree of 32,82. In the second scenario, using one of the objective functions, namely f(x) = x2, the Naïve Bayes value is obtained 39,01, K-NN 66,15 and Decission Tree 76,63. From the results of 3 the optimization test of classification Algorithm, it was found that the overall objective functions of the Bat algorithm were all able to increase the data accuracy value from before optimization. From all the tests, it was found that the Decision Tree algorithm has the highest average value of optimization increment, namely 43,81 %
在当今的数字时代,社交媒体是一种非常有效的沟通媒体。在社交媒体中,Twitter是使用最广泛的社交媒体。Twitter上的许多推文鼓励了文本挖掘领域的研究。情感分析是文本挖掘的一个分支。本研究中的情感分析由Naïve贝叶斯和决策树3种分类算法组成。在实践中,这三种分类算法的结果往往产生非常低的精度水平。Bat算法是一种可以从Naïve贝叶斯、K-NN算法和决策树的精度中优化结果的算法。本研究进行了两种研究场景:一是计算Naïve Bayes、K-NN算法和decision Tree的准确率。其次,利用Bat算法方法对3种算法的分类结果进行优化,并重新测试准确率值。在第一种场景中,百分比是由Naïve的准确率值Bayes为33,58,K-NN为33,61,decision Tree为32,82生成的。在第二种场景中,使用其中一个目标函数f(x) = x2,得到Naïve贝叶斯值39,01,K-NN 66,15, decision Tree 76,63。从分类算法优化测试3的结果可以发现,Bat算法的总体目标函数都能够比优化前提高数据精度值。从所有测试中发现,决策树算法具有最高的优化增量平均值,为43.81%
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信