CTR Prediction of Advertisements using Decision Trees based Algorithms

Mayur Rattan Jaisinghani, Chirag Lundwani, Orijeet Mukherjee, Neeharika Nagori, Prerna. B. Solanke
{"title":"CTR Prediction of Advertisements using Decision Trees based Algorithms","authors":"Mayur Rattan Jaisinghani, Chirag Lundwani, Orijeet Mukherjee, Neeharika Nagori, Prerna. B. Solanke","doi":"10.1109/iSemantic55962.2022.9920363","DOIUrl":null,"url":null,"abstract":"In this age of digitization, all the businesses have started focusing their attention on getting customers online. In the present scenario to attract huge customer bases, businesses require proper marketing which is incomplete without advertising. To maximize their reach, online advertising came into picture and to optimize their marketing potential, knowing and understanding the CTR(Click Through Rate) of an advertisement is very important. This paper delves into the sector of machine learning, to predict the CTR of an advertisement. It provides a comparative study of four algorithms - Decision Trees, XGB(Extreme Gradient Boosting), Random Forest and LGBM (Light Gradient Boosting Method) - based on their performance to determine which algorithm gives the highest AUC(Area Under the Curve) score, F1 score, accuracy and precision.","PeriodicalId":360042,"journal":{"name":"2022 International Seminar on Application for Technology of Information and Communication (iSemantic)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 International Seminar on Application for Technology of Information and Communication (iSemantic)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/iSemantic55962.2022.9920363","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

In this age of digitization, all the businesses have started focusing their attention on getting customers online. In the present scenario to attract huge customer bases, businesses require proper marketing which is incomplete without advertising. To maximize their reach, online advertising came into picture and to optimize their marketing potential, knowing and understanding the CTR(Click Through Rate) of an advertisement is very important. This paper delves into the sector of machine learning, to predict the CTR of an advertisement. It provides a comparative study of four algorithms - Decision Trees, XGB(Extreme Gradient Boosting), Random Forest and LGBM (Light Gradient Boosting Method) - based on their performance to determine which algorithm gives the highest AUC(Area Under the Curve) score, F1 score, accuracy and precision.
基于决策树算法的广告点击率预测
在这个数字化时代,所有的企业都开始把注意力集中在网上吸引客户上。在目前的情况下,吸引庞大的客户群,企业需要适当的营销,这是不完整的广告。为了最大限度地扩大他们的覆盖范围,在线广告进入了人们的视野,为了优化他们的营销潜力,了解和理解广告的点击率是非常重要的。本文深入研究了机器学习领域,以预测广告的点击率。它提供了四种算法的比较研究-决策树,XGB(极端梯度增强),随机森林和LGBM(光梯度增强方法)-基于它们的性能来确定哪种算法给出最高的AUC(曲线下面积)分数,F1分数,准确度和精度。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信