An Approach to Perform Sentiment Analysis using Data Mining Algorithms

Milanjit Kaur, K. Joshi, Bhawna Goyal, Ayush Dogra
{"title":"An Approach to Perform Sentiment Analysis using Data Mining Algorithms","authors":"Milanjit Kaur, K. Joshi, Bhawna Goyal, Ayush Dogra","doi":"10.1109/ICECAA58104.2023.10212404","DOIUrl":null,"url":null,"abstract":"To perform the sentiment analysis as a basis for defining and extracting subjective information from sources or easily relating to the identification phase of the polarity of the text, the concept of Natural Processing is used. Participatory approach is required to perform this analysis. It was also called opinion mining as it extracts a user's view or perspective. There are many attributes which pose a problem with knowledge. It is an arbitrary for choosing assets giving a wider range of values. In the current paper, various algorithms of classification are used and it is concluded that the best algorithm is random forest. The issue is that decision trees, especially if the tree is particularly deep, are vulnerable to being over fit. To minimize the bias and error of variance, classification along with random forest classification is used. Through practicing on different data sets, random forests minimize variance. In the proposed study, boosted methodology along with Random forest, instead of using only random forest is implemented due to which optimization of the Ant colony search alongside with the proposed classification to hit the classification for sentiment analysis of various reviews of films for research precision.","PeriodicalId":114624,"journal":{"name":"2023 2nd International Conference on Edge Computing and Applications (ICECAA)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-07-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2023 2nd International Conference on Edge Computing and Applications (ICECAA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICECAA58104.2023.10212404","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

To perform the sentiment analysis as a basis for defining and extracting subjective information from sources or easily relating to the identification phase of the polarity of the text, the concept of Natural Processing is used. Participatory approach is required to perform this analysis. It was also called opinion mining as it extracts a user's view or perspective. There are many attributes which pose a problem with knowledge. It is an arbitrary for choosing assets giving a wider range of values. In the current paper, various algorithms of classification are used and it is concluded that the best algorithm is random forest. The issue is that decision trees, especially if the tree is particularly deep, are vulnerable to being over fit. To minimize the bias and error of variance, classification along with random forest classification is used. Through practicing on different data sets, random forests minimize variance. In the proposed study, boosted methodology along with Random forest, instead of using only random forest is implemented due to which optimization of the Ant colony search alongside with the proposed classification to hit the classification for sentiment analysis of various reviews of films for research precision.
一种基于数据挖掘算法的情感分析方法
为了将情感分析作为从来源中定义和提取主观信息或容易与文本极性识别阶段相关的基础,使用了自然处理的概念。进行这种分析需要参与性方法。它也被称为意见挖掘,因为它提取用户的观点或观点。有许多属性会给知识带来问题。对于选择具有更大范围价值的资产来说,这是一种随意性。在本文中,使用了各种分类算法,并得出了最佳的算法是随机森林。问题是决策树,特别是如果树特别深,很容易被过度拟合。为了最小化方差的偏差和误差,采用了分类和随机森林分类相结合的方法。通过对不同数据集的练习,随机森林使方差最小化。在提出的研究中,增强了随机森林的方法,而不是只使用随机森林,因为蚁群搜索的优化与提出的分类一起达到了对各种电影评论的情感分析的分类,以提高研究精度。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信