Ad Prediction using Click Through Rate and Machine Learning with Reinforcement Learning

A. Lakshmanarao, S. Ushanag, B. Leela
{"title":"Ad Prediction using Click Through Rate and Machine Learning with Reinforcement Learning","authors":"A. Lakshmanarao, S. Ushanag, B. Leela","doi":"10.1109/ICECCT52121.2021.9616653","DOIUrl":null,"url":null,"abstract":"Predicting the click-through rate (CTR) is an essential problem in enterprise systems such as online advertising. It is a crucial factor of advertisements platforms. It is fed into auctions to determine the final ranking of advertising. Machine Learning techniques are often used to tackle challenges involving human-computer interaction. Almost every website on the internet displays advertisements. Companies who want to promote their products use these websites as a method of promotion. The goal is to determine which of the company's several advertisement versions can get the best conversion rate, i.e., the most number of ad clicks. The major issue for firms that rely on ad revenue is ad placement on websites. The placement of the ad has a significant impact on whether or not the ad gets clicked. This kind of challenge lends itself very well to Reinforcement Learning algorithms. In this paper, we applied the machine learning approach for Ad Prediction. We used a dataset from Kaggle and applied two reinforcement learning algorithms Upper Confidence Bound, Thompson Sampling for predicting Ad position based on ad clicks and achieved a good prediction rate. All the implementations are done in python.","PeriodicalId":155129,"journal":{"name":"2021 Fourth International Conference on Electrical, Computer and Communication Technologies (ICECCT)","volume":"57 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-09-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 Fourth International Conference on Electrical, Computer and Communication Technologies (ICECCT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICECCT52121.2021.9616653","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Predicting the click-through rate (CTR) is an essential problem in enterprise systems such as online advertising. It is a crucial factor of advertisements platforms. It is fed into auctions to determine the final ranking of advertising. Machine Learning techniques are often used to tackle challenges involving human-computer interaction. Almost every website on the internet displays advertisements. Companies who want to promote their products use these websites as a method of promotion. The goal is to determine which of the company's several advertisement versions can get the best conversion rate, i.e., the most number of ad clicks. The major issue for firms that rely on ad revenue is ad placement on websites. The placement of the ad has a significant impact on whether or not the ad gets clicked. This kind of challenge lends itself very well to Reinforcement Learning algorithms. In this paper, we applied the machine learning approach for Ad Prediction. We used a dataset from Kaggle and applied two reinforcement learning algorithms Upper Confidence Bound, Thompson Sampling for predicting Ad position based on ad clicks and achieved a good prediction rate. All the implementations are done in python.
广告预测使用点击率和机器学习与强化学习
预测点击率(CTR)是网络广告等企业系统中的一个重要问题。这是广告平台的关键因素。它被输入到拍卖中,以决定广告的最终排名。机器学习技术通常用于解决涉及人机交互的挑战。互联网上几乎每个网站都有广告。想要推广产品的公司使用这些网站作为一种推广方法。目标是确定公司的几个广告版本中哪一个可以获得最好的转化率,即最多的广告点击次数。对于依赖广告收入的公司来说,主要问题是在网站上放置广告。广告的位置对广告是否被点击有很大的影响。这种挑战非常适合于强化学习算法。在本文中,我们将机器学习方法应用于广告预测。我们使用来自Kaggle的数据集,并应用了两种强化学习算法Upper Confidence Bound和Thompson Sampling来基于广告点击预测广告位置,并取得了良好的预测率。所有的实现都是用python完成的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信