Opinion classification using Maximum Entropy and K-Means Clustering

A. Hamzah, Naniek Widyastuti
{"title":"Opinion classification using Maximum Entropy and K-Means Clustering","authors":"A. Hamzah, Naniek Widyastuti","doi":"10.1109/ICTS.2016.7910292","DOIUrl":null,"url":null,"abstract":"responds from academic questionnaire generally contains many comments, advice and suggestions. This responds is not processed systematically due to lack of method to process. whereas such information might be very useful as additional source in decision making. Opinion mining is well suited to address the issue. The objective of this study is to develop opinion classification system using Maximum entropy (ME)) and K-Means Clustering (KMC). Opinion to be classified was Indonesian textual comments from academic questionnaire. Classification was conducted into two classes, i.e. negative opinion and positive opinion. Data contained of 2000 comments that was sampled as multi domain opinion, represented many objects such as lecturer, class room, etc. Features used for classification was selected from word in the opinion text. The weighting scheme that we used for clustering was TF/IDF. The results show that K-Means Clustering gives better performance as compared with ME in averages about 3% precision. KMC also perform faster than ME about 25 msec using 2000 text opinion.","PeriodicalId":177275,"journal":{"name":"2016 International Conference on Information & Communication Technology and Systems (ICTS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 International Conference on Information & Communication Technology and Systems (ICTS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICTS.2016.7910292","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 8

Abstract

responds from academic questionnaire generally contains many comments, advice and suggestions. This responds is not processed systematically due to lack of method to process. whereas such information might be very useful as additional source in decision making. Opinion mining is well suited to address the issue. The objective of this study is to develop opinion classification system using Maximum entropy (ME)) and K-Means Clustering (KMC). Opinion to be classified was Indonesian textual comments from academic questionnaire. Classification was conducted into two classes, i.e. negative opinion and positive opinion. Data contained of 2000 comments that was sampled as multi domain opinion, represented many objects such as lecturer, class room, etc. Features used for classification was selected from word in the opinion text. The weighting scheme that we used for clustering was TF/IDF. The results show that K-Means Clustering gives better performance as compared with ME in averages about 3% precision. KMC also perform faster than ME about 25 msec using 2000 text opinion.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于最大熵和k均值聚类的意见分类
学术问卷的回答通常包含许多评论、建议和建议。由于缺乏处理方法,该响应没有系统地处理。而这些信息作为决策的额外来源可能非常有用。意见挖掘非常适合解决这个问题。本研究的目的是利用最大熵(ME)和k -均值聚类(KMC)建立意见分类系统。待分类的意见是来自学术问卷的印尼语文本评论。分类分为两类,即消极意见和积极意见。数据包含2000条评论,这些评论被采样为多领域意见,代表许多对象,如讲师,教室等。从意见文本中的单词中选择用于分类的特征。我们用于聚类的加权方案是TF/IDF。结果表明,与ME相比,K-Means聚类具有更好的性能,平均精度约为3%。使用2000个文本意见时,KMC的执行速度也比ME快约25毫秒。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Detecting source code plagiarism on introductory programming course assignments using a bytecode approach Indonesia scholarship selection framework using fuzzy inferences system approach: Case study: “Bidik Misi” scholarship selection Face recognition based on Extended Symmetric Local Graph Structure Early detection study of Kidney Organ Complication caused by Diabetes Mellitus using iris image color constancy Heart murmurs extraction using the complete Ensemble Empirical Mode Decomposition and the Pearson distance metric
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1