基于GRU-Attention的V-NDN多特征内容流行度预测算法

IF 2 3区 计算机科学 Q3 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS Computer Supported Cooperative Work-The Journal of Collaborative Computing Pub Date : 2023-05-24 DOI:10.1109/CSCWD57460.2023.10152582
Min Feng, Meiju Yu, Ru Li
{"title":"基于GRU-Attention的V-NDN多特征内容流行度预测算法","authors":"Min Feng, Meiju Yu, Ru Li","doi":"10.1109/CSCWD57460.2023.10152582","DOIUrl":null,"url":null,"abstract":"The Vehicle Named Data Networking(V-NDN) is a vehicular ad-hoc network with the Named Data Networking(NDN) as the architecture, and the most advantageous feature is the in-network cache, which caches the content in the intermediate nodes of the network and can quickly satisfy the requests of subsequent consumers for the same content. Since the cache space of nodes is limited, the cached content should be the popular content frequently requested by users in the network, so the most important problem is accurately finding out the future popular content in the network. This paper designs a multi-feature content popularity prediction algorithm to address this problem based on the attention mechanism and GRU (GRU-Attention). According to the characteristics of multiple historical requests for content, the GRU-Attention model is used to predict the future popularity of content. Through experimental verification, the content popularity prediction algorithm proposed in this paper effectively improves the accuracy of prediction.","PeriodicalId":51008,"journal":{"name":"Computer Supported Cooperative Work-The Journal of Collaborative Computing","volume":"1 1","pages":"1136-1141"},"PeriodicalIF":2.0000,"publicationDate":"2023-05-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Multi-feature content popularity prediction algorithm based on GRU-Attention in V-NDN\",\"authors\":\"Min Feng, Meiju Yu, Ru Li\",\"doi\":\"10.1109/CSCWD57460.2023.10152582\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The Vehicle Named Data Networking(V-NDN) is a vehicular ad-hoc network with the Named Data Networking(NDN) as the architecture, and the most advantageous feature is the in-network cache, which caches the content in the intermediate nodes of the network and can quickly satisfy the requests of subsequent consumers for the same content. Since the cache space of nodes is limited, the cached content should be the popular content frequently requested by users in the network, so the most important problem is accurately finding out the future popular content in the network. This paper designs a multi-feature content popularity prediction algorithm to address this problem based on the attention mechanism and GRU (GRU-Attention). According to the characteristics of multiple historical requests for content, the GRU-Attention model is used to predict the future popularity of content. Through experimental verification, the content popularity prediction algorithm proposed in this paper effectively improves the accuracy of prediction.\",\"PeriodicalId\":51008,\"journal\":{\"name\":\"Computer Supported Cooperative Work-The Journal of Collaborative Computing\",\"volume\":\"1 1\",\"pages\":\"1136-1141\"},\"PeriodicalIF\":2.0000,\"publicationDate\":\"2023-05-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Computer Supported Cooperative Work-The Journal of Collaborative Computing\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://doi.org/10.1109/CSCWD57460.2023.10152582\",\"RegionNum\":3,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computer Supported Cooperative Work-The Journal of Collaborative Computing","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1109/CSCWD57460.2023.10152582","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 0

摘要

汽车命名数据网络(V-NDN)是一种以命名数据网络(NDN)为架构的车载自组网,其最大的优势是网络内缓存,将内容缓存在网络的中间节点上,可以快速满足后续消费者对相同内容的请求。由于节点的缓存空间有限,缓存的内容应该是网络中用户频繁请求的热门内容,所以最重要的问题是准确发现网络中未来的热门内容。本文设计了一种基于注意机制和GRU (GRU- attention)的多特征内容流行度预测算法来解决这一问题。根据多个历史内容请求的特点,采用GRU-Attention模型预测内容的未来流行度。通过实验验证,本文提出的内容流行度预测算法有效提高了预测的准确性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Multi-feature content popularity prediction algorithm based on GRU-Attention in V-NDN
The Vehicle Named Data Networking(V-NDN) is a vehicular ad-hoc network with the Named Data Networking(NDN) as the architecture, and the most advantageous feature is the in-network cache, which caches the content in the intermediate nodes of the network and can quickly satisfy the requests of subsequent consumers for the same content. Since the cache space of nodes is limited, the cached content should be the popular content frequently requested by users in the network, so the most important problem is accurately finding out the future popular content in the network. This paper designs a multi-feature content popularity prediction algorithm to address this problem based on the attention mechanism and GRU (GRU-Attention). According to the characteristics of multiple historical requests for content, the GRU-Attention model is used to predict the future popularity of content. Through experimental verification, the content popularity prediction algorithm proposed in this paper effectively improves the accuracy of prediction.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Computer Supported Cooperative Work-The Journal of Collaborative Computing
Computer Supported Cooperative Work-The Journal of Collaborative Computing COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS-
CiteScore
6.40
自引率
4.20%
发文量
31
审稿时长
>12 weeks
期刊介绍: Computer Supported Cooperative Work (CSCW): The Journal of Collaborative Computing and Work Practices is devoted to innovative research in computer-supported cooperative work (CSCW). It provides an interdisciplinary and international forum for the debate and exchange of ideas concerning theoretical, practical, technical, and social issues in CSCW. The CSCW Journal arose in response to the growing interest in the design, implementation and use of technical systems (including computing, information, and communications technologies) which support people working cooperatively, and its scope remains to encompass the multifarious aspects of research within CSCW and related areas. The CSCW Journal focuses on research oriented towards the development of collaborative computing technologies on the basis of studies of actual cooperative work practices (where ‘work’ is used in the wider sense). That is, it welcomes in particular submissions that (a) report on findings from ethnographic or similar kinds of in-depth fieldwork of work practices with a view to their technological implications, (b) report on empirical evaluations of the use of extant or novel technical solutions under real-world conditions, and/or (c) develop technical or conceptual frameworks for practice-oriented computing research based on previous fieldwork and evaluations.
期刊最新文献
Text-based Patient – Doctor Discourse Online And Patients’ Experiences of Empathy Agency, Power and Confrontation: the Role for Socially Engaged Art in CSCW with Rurban Communities in Support of Inclusion Data as Relation: Ontological Trouble in the Data-Driven Public Administration The Avatar Facial Expression Reenactment Method in the Metaverse based on Overall-Local Optical-Flow Estimation and Illumination Difference Investigating Author Research Relatedness through Crowdsourcing: A Replication Study on MTurk
×
引用
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