网络广播广告实时推荐系统

Chaeeun Jeong, Seongju Kang, K. Chung
{"title":"网络广播广告实时推荐系统","authors":"Chaeeun Jeong, Seongju Kang, K. Chung","doi":"10.1109/ICOIN50884.2021.9333921","DOIUrl":null,"url":null,"abstract":"In online broadcasting, users are exposed to advertisements for various items. Traditional advertising systems do not satisfy the expectations of various users because they provide advertisements without considering the characteristics of individuals. Personalized advertisement services can be provided by introducing recommendation algorithms that take account of users’ context and history. However, since the existing recommendation system is based on users’ consumption history, it does not quickly reflect the users’ interests that change according to items appearing in the content. In addition, when the user’s history is sparse, the performance of the recommendation system is degraded. In this paper, we propose a recommendation system for online broadcasting advertisements. The proposed system calculates the similarity between users based on the user’s region of interest (ROI). The user’s preference for the item is predicted by comparing the rating history of similar users. To reduce the time for calculating the similarity between users, a tree-structured user profile model is introduced. Finally, we conduct experiments to evaluate the performance of the proposed advertisement recommendation system.","PeriodicalId":6741,"journal":{"name":"2021 International Conference on Information Networking (ICOIN)","volume":"8 1","pages":"413-416"},"PeriodicalIF":0.0000,"publicationDate":"2021-01-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Real-Time Recommendation System for Online Broadcasting Advertisement\",\"authors\":\"Chaeeun Jeong, Seongju Kang, K. Chung\",\"doi\":\"10.1109/ICOIN50884.2021.9333921\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In online broadcasting, users are exposed to advertisements for various items. Traditional advertising systems do not satisfy the expectations of various users because they provide advertisements without considering the characteristics of individuals. Personalized advertisement services can be provided by introducing recommendation algorithms that take account of users’ context and history. However, since the existing recommendation system is based on users’ consumption history, it does not quickly reflect the users’ interests that change according to items appearing in the content. In addition, when the user’s history is sparse, the performance of the recommendation system is degraded. In this paper, we propose a recommendation system for online broadcasting advertisements. The proposed system calculates the similarity between users based on the user’s region of interest (ROI). The user’s preference for the item is predicted by comparing the rating history of similar users. To reduce the time for calculating the similarity between users, a tree-structured user profile model is introduced. Finally, we conduct experiments to evaluate the performance of the proposed advertisement recommendation system.\",\"PeriodicalId\":6741,\"journal\":{\"name\":\"2021 International Conference on Information Networking (ICOIN)\",\"volume\":\"8 1\",\"pages\":\"413-416\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-01-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2021 International Conference on Information Networking (ICOIN)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICOIN50884.2021.9333921\",\"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 International Conference on Information Networking (ICOIN)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICOIN50884.2021.9333921","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

摘要

在网络广播中,用户会看到各种各样的广告。传统的广告系统在提供广告时没有考虑到个人的特点,不能满足各种用户的期望。通过引入考虑用户背景和历史的推荐算法,可以提供个性化的广告服务。然而,由于现有的推荐系统是基于用户的消费历史,它不能快速反映用户的兴趣,因为用户的兴趣会随着内容中出现的物品而变化。此外,当用户的历史记录稀疏时,推荐系统的性能会下降。本文提出了一种针对网络广播广告的推荐系统。该系统基于用户的兴趣区域(ROI)计算用户之间的相似度。通过比较相似用户的评分历史,预测用户对该物品的偏好。为了减少计算用户间相似度的时间,引入了树形结构的用户轮廓模型。最后,我们通过实验来评估所提出的广告推荐系统的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Real-Time Recommendation System for Online Broadcasting Advertisement
In online broadcasting, users are exposed to advertisements for various items. Traditional advertising systems do not satisfy the expectations of various users because they provide advertisements without considering the characteristics of individuals. Personalized advertisement services can be provided by introducing recommendation algorithms that take account of users’ context and history. However, since the existing recommendation system is based on users’ consumption history, it does not quickly reflect the users’ interests that change according to items appearing in the content. In addition, when the user’s history is sparse, the performance of the recommendation system is degraded. In this paper, we propose a recommendation system for online broadcasting advertisements. The proposed system calculates the similarity between users based on the user’s region of interest (ROI). The user’s preference for the item is predicted by comparing the rating history of similar users. To reduce the time for calculating the similarity between users, a tree-structured user profile model is introduced. Finally, we conduct experiments to evaluate the performance of the proposed advertisement recommendation system.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信