Sentiment analysis on review texts using category of words information and string kernels

IF 3.5 2区 计算机科学 Q2 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE
Jose M. Cuevas-Muñoz, Nicolás E. García-Pedrajas, Aida De Haro-García
{"title":"Sentiment analysis on review texts using category of words information and string kernels","authors":"Jose M. Cuevas-Muñoz,&nbsp;Nicolás E. García-Pedrajas,&nbsp;Aida De Haro-García","doi":"10.1007/s10489-026-07256-4","DOIUrl":null,"url":null,"abstract":"<div><p>With millions of opinions written every day around the internet, analyzing review sentiment has been shown to be an interesting and relevant problem. Support vector machines offer an excellent alternative when the amount of available data makes other models, such as deep learning, infeasible. A usual way to detect hidden sentiments in textual data is to address the mutual information through a corpus with a support vector machine or any other sophisticated classification algorithm. Approaches that are able to extract information from sequences of words, such as string kernels, have the potential for better performance. However, finding similarities can be difficult given the ample texts used to express opinions and the wide variety of vocabulary. To solve that problem, we suggest using clustering methods to automatically group words into categories based on a word vector, replacing the words in the dataset with their corresponding categories, and then using these categories to find mutual information in the text with support vector machines that use string kernels. This approach significantly reduces the token space and enhances the efficiency of the kernel methods. The proposed method showed better performance than state-of-the-art approaches for this task in a set of real-world problems. Different models were tested against our proposal. Results indicate that the proposed method has the ability to extract useful data from opinions in long texts and remains an interesting option for review sentiment analysis in general, even outperforming other state-of-the-art methods in certain datasets. It also opens the possibility of applying the same philosophy to deep learning and similar models.</p></div>","PeriodicalId":8041,"journal":{"name":"Applied Intelligence","volume":"56 7","pages":""},"PeriodicalIF":3.5000,"publicationDate":"2026-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s10489-026-07256-4.pdf","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Applied Intelligence","FirstCategoryId":"94","ListUrlMain":"https://link.springer.com/article/10.1007/s10489-026-07256-4","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

Abstract

With millions of opinions written every day around the internet, analyzing review sentiment has been shown to be an interesting and relevant problem. Support vector machines offer an excellent alternative when the amount of available data makes other models, such as deep learning, infeasible. A usual way to detect hidden sentiments in textual data is to address the mutual information through a corpus with a support vector machine or any other sophisticated classification algorithm. Approaches that are able to extract information from sequences of words, such as string kernels, have the potential for better performance. However, finding similarities can be difficult given the ample texts used to express opinions and the wide variety of vocabulary. To solve that problem, we suggest using clustering methods to automatically group words into categories based on a word vector, replacing the words in the dataset with their corresponding categories, and then using these categories to find mutual information in the text with support vector machines that use string kernels. This approach significantly reduces the token space and enhances the efficiency of the kernel methods. The proposed method showed better performance than state-of-the-art approaches for this task in a set of real-world problems. Different models were tested against our proposal. Results indicate that the proposed method has the ability to extract useful data from opinions in long texts and remains an interesting option for review sentiment analysis in general, even outperforming other state-of-the-art methods in certain datasets. It also opens the possibility of applying the same philosophy to deep learning and similar models.

Abstract Image

基于词类信息和字符串核的评论文本情感分析
互联网上每天都有数百万条评论,分析评论情绪已被证明是一个有趣且相关的问题。当可用数据量使其他模型(如深度学习)不可行的时候,支持向量机提供了一个很好的替代方案。检测文本数据中隐藏情感的常用方法是使用支持向量机或任何其他复杂的分类算法通过语料库处理互信息。能够从单词序列中提取信息的方法,如字符串核,具有更好的性能潜力。然而,考虑到用来表达观点的大量文本和各种各样的词汇,找到相似之处可能很困难。为了解决这个问题,我们建议使用聚类方法根据词向量自动将词分组为类别,用相应的类别替换数据集中的词,然后使用使用字符串核的支持向量机使用这些类别在文本中查找相互信息。这种方法大大减少了令牌空间,提高了内核方法的效率。在一组现实世界的问题中,所提出的方法比最先进的方法表现出更好的性能。针对我们的建议测试了不同的模型。结果表明,所提出的方法能够从长文本的观点中提取有用的数据,并且在一般情况下仍然是评论情感分析的有趣选择,甚至在某些数据集中优于其他最先进的方法。它也开启了将同样的哲学应用于深度学习和类似模型的可能性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Applied Intelligence
Applied Intelligence 工程技术-计算机:人工智能
CiteScore
6.60
自引率
20.80%
发文量
1361
审稿时长
5.9 months
期刊介绍: With a focus on research in artificial intelligence and neural networks, this journal addresses issues involving solutions of real-life manufacturing, defense, management, government and industrial problems which are too complex to be solved through conventional approaches and require the simulation of intelligent thought processes, heuristics, applications of knowledge, and distributed and parallel processing. The integration of these multiple approaches in solving complex problems is of particular importance. The journal presents new and original research and technological developments, addressing real and complex issues applicable to difficult problems. It provides a medium for exchanging scientific research and technological achievements accomplished by the international community.
×
引用
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学术官方微信
小红书