基于交叉粒度情感分析的推荐算法研究

Jin Xiao, Bo Liu, Sihan Li, Ke Liao, Jing Huang
{"title":"基于交叉粒度情感分析的推荐算法研究","authors":"Jin Xiao, Bo Liu, Sihan Li, Ke Liao, Jing Huang","doi":"10.1109/CSAIEE54046.2021.9543356","DOIUrl":null,"url":null,"abstract":"In the era of internet and big data, traditional method of user preferences mining has been difficult to keep up with the update speed of enterprise product or service decision adjustment, so it is a new idea to apply recommendation algorithm to user preferences mining. Most of the recommendation algorithms based on review emotion analysis are carried out at a single level of fine-granularity or coarse-granularity, which is difficult to ensure the accuracy and comprehensiveness of user preferences mining. This paper proposes a new recommendation algorithm EAFM, which is based on cross-grained emotion analysis. Based on the latent dirichlet allocation, dependency syntactic analysis and convolutional neural network model, the algorithm synchronously performs fine-grained and coarse-grained emotion analysis with online review data as corpus, and then proposes the emotion score correction mechanism, which solves the problems of data sparsity and algorithm time complexity in user preference mining. In the experimental design section, we use Amazon product data for verification, and regard root mean square error as the performance evaluation index. Experimental results show that the EAFM approach has better user preference mining performance than the compared algorithm.","PeriodicalId":376014,"journal":{"name":"2021 IEEE International Conference on Computer Science, Artificial Intelligence and Electronic Engineering (CSAIEE)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-08-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Research on Recommendation Algorithm Based on Cross-grained Emotion Analysis\",\"authors\":\"Jin Xiao, Bo Liu, Sihan Li, Ke Liao, Jing Huang\",\"doi\":\"10.1109/CSAIEE54046.2021.9543356\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In the era of internet and big data, traditional method of user preferences mining has been difficult to keep up with the update speed of enterprise product or service decision adjustment, so it is a new idea to apply recommendation algorithm to user preferences mining. Most of the recommendation algorithms based on review emotion analysis are carried out at a single level of fine-granularity or coarse-granularity, which is difficult to ensure the accuracy and comprehensiveness of user preferences mining. This paper proposes a new recommendation algorithm EAFM, which is based on cross-grained emotion analysis. Based on the latent dirichlet allocation, dependency syntactic analysis and convolutional neural network model, the algorithm synchronously performs fine-grained and coarse-grained emotion analysis with online review data as corpus, and then proposes the emotion score correction mechanism, which solves the problems of data sparsity and algorithm time complexity in user preference mining. In the experimental design section, we use Amazon product data for verification, and regard root mean square error as the performance evaluation index. Experimental results show that the EAFM approach has better user preference mining performance than the compared algorithm.\",\"PeriodicalId\":376014,\"journal\":{\"name\":\"2021 IEEE International Conference on Computer Science, Artificial Intelligence and Electronic Engineering (CSAIEE)\",\"volume\":\"14 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-08-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2021 IEEE International Conference on Computer Science, Artificial Intelligence and Electronic Engineering (CSAIEE)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CSAIEE54046.2021.9543356\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 IEEE International Conference on Computer Science, Artificial Intelligence and Electronic Engineering (CSAIEE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CSAIEE54046.2021.9543356","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

在互联网和大数据时代,传统的用户偏好挖掘方法已经难以跟上企业产品或服务决策调整的更新速度,因此将推荐算法应用于用户偏好挖掘是一种新的思路。大多数基于评论情感分析的推荐算法都是在细粒度或粗粒度的单一层次上进行的,难以保证用户偏好挖掘的准确性和全面性。本文提出了一种新的基于跨粒度情感分析的推荐算法EAFM。该算法基于潜在狄利克雷分配、依赖句法分析和卷积神经网络模型,以在线评论数据为语料库,同步进行细粒度和粗粒度情感分析,并提出情感评分校正机制,解决了用户偏好挖掘中的数据稀疏性和算法时间复杂度问题。在实验设计部分,我们使用亚马逊的产品数据进行验证,并以均方根误差作为性能评价指标。实验结果表明,EAFM方法比对比算法具有更好的用户偏好挖掘性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Research on Recommendation Algorithm Based on Cross-grained Emotion Analysis
In the era of internet and big data, traditional method of user preferences mining has been difficult to keep up with the update speed of enterprise product or service decision adjustment, so it is a new idea to apply recommendation algorithm to user preferences mining. Most of the recommendation algorithms based on review emotion analysis are carried out at a single level of fine-granularity or coarse-granularity, which is difficult to ensure the accuracy and comprehensiveness of user preferences mining. This paper proposes a new recommendation algorithm EAFM, which is based on cross-grained emotion analysis. Based on the latent dirichlet allocation, dependency syntactic analysis and convolutional neural network model, the algorithm synchronously performs fine-grained and coarse-grained emotion analysis with online review data as corpus, and then proposes the emotion score correction mechanism, which solves the problems of data sparsity and algorithm time complexity in user preference mining. In the experimental design section, we use Amazon product data for verification, and regard root mean square error as the performance evaluation index. Experimental results show that the EAFM approach has better user preference mining performance than the compared algorithm.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Res-Attention Net: An Image Dehazing Network Teacher-Student Network for Low-quality Remote Sensing Ship Detection Optimization of GNSS Signals Acquisition Algorithm Complexity Using Comb Decimation Filter Basic Ensemble Learning of Encoder Representations from Transformer for Disaster-mentioning Tweets Classification Measuring Hilbert-Schmidt Independence Criterion with Different Kernels
×
引用
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