K-Means Algorithm and Levenshtein Distance Algorithm for Sentiment Analysis of School Zonation System Policy

Muhammad Haris Al Farisi, Arini, Luh Kesuma Wardhani, Iik Muhamad Malik Matin, Yusuf Durachman, R. Adelina, Faisal Nurdin
{"title":"K-Means Algorithm and Levenshtein Distance Algorithm for Sentiment Analysis of School Zonation System Policy","authors":"Muhammad Haris Al Farisi, Arini, Luh Kesuma Wardhani, Iik Muhamad Malik Matin, Yusuf Durachman, R. Adelina, Faisal Nurdin","doi":"10.1109/ICIC54025.2021.9632943","DOIUrl":null,"url":null,"abstract":"Equity and quality of education must be guaranteed in the national education system. To that end, the government issued a new student admission policy with a zoning system. To ensure the implementation of new student admissions (PPDB), the zoning system needs to be evaluated for community responses. However, evaluation using conventional techniques still has limitations. Sentiment analysis is a new approach to explore computing-based opinion. In this paper, we conduct a sentiment analysis of the new student admissions system (PPDB) zoning policy. We identify two types of sentiment namely positive and negative. We used the Levenshtein Distance algorithm for word normalization and clustered using the K-Means algorithm. The results of clustering are classified based on the confusion matrix. The data sources that we use are taken from 200 comments on Facebook and Youtube channels. The results obtained from public sentiment towards this policy are more negative sentiments than positive sentiments. The results obtained from the accuracy of the K-Means algorithm are 84%, while the combination of the k-means algorithm with Levenshtein distance reaches 90% accuracy.","PeriodicalId":189541,"journal":{"name":"2021 Sixth International Conference on Informatics and Computing (ICIC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 Sixth International Conference on Informatics and Computing (ICIC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICIC54025.2021.9632943","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Equity and quality of education must be guaranteed in the national education system. To that end, the government issued a new student admission policy with a zoning system. To ensure the implementation of new student admissions (PPDB), the zoning system needs to be evaluated for community responses. However, evaluation using conventional techniques still has limitations. Sentiment analysis is a new approach to explore computing-based opinion. In this paper, we conduct a sentiment analysis of the new student admissions system (PPDB) zoning policy. We identify two types of sentiment namely positive and negative. We used the Levenshtein Distance algorithm for word normalization and clustered using the K-Means algorithm. The results of clustering are classified based on the confusion matrix. The data sources that we use are taken from 200 comments on Facebook and Youtube channels. The results obtained from public sentiment towards this policy are more negative sentiments than positive sentiments. The results obtained from the accuracy of the K-Means algorithm are 84%, while the combination of the k-means algorithm with Levenshtein distance reaches 90% accuracy.
基于k -均值算法和Levenshtein距离算法的学区政策情感分析
教育公平和教育质量必须在国家教育体系中得到保障。为此,政府出台了分区制的新招生政策。为了确保新学生入学(PPDB)的实施,需要对分区制度进行评估,以了解社区的反应。然而,使用传统技术进行评估仍然存在局限性。情感分析是一种探索基于计算的意见的新方法。本文对新招生制度(PPDB)分区政策进行了情感分析。我们确定了两种情绪,即积极的和消极的。我们使用Levenshtein Distance算法进行单词规范化,并使用K-Means算法进行聚类。基于混淆矩阵对聚类结果进行分类。我们使用的数据来源来自Facebook和Youtube频道上的200条评论。从公众对这项政策的看法中得到的结果是负面情绪多于正面情绪。K-Means算法得到的结果准确率为84%,而K-Means算法与Levenshtein距离的结合准确率达到90%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:481959085
Book学术官方微信