Improving Cost Estimation in Internet Advertising Using Machine Learning: Preliminary Results

Şeyma Tahmaz, M. Ünalir, G. Giray, Sena Koçer
{"title":"Improving Cost Estimation in Internet Advertising Using Machine Learning: Preliminary Results","authors":"Şeyma Tahmaz, M. Ünalir, G. Giray, Sena Koçer","doi":"10.1109/UYMS50627.2020.9247015","DOIUrl":null,"url":null,"abstract":"In the internet advertising industry, web and mobile applications that display ads need to choose high-paying ads to increase their revenue. Ad mediators create various decision mechanisms to select ads that will generate higher revenues in order to increase the revenue of advertising applications. One type of these decision mechanisms is to select and deliver the ad with the highest eCPM (Effective Cost Per Mille) value from ads that can be placed in an ad slot. The eCPM value varies depending on different external factors for different applications. It is not possible for domain experts to make successful predictions by analyzing different sets of external factors for many applications and to keep these predictions constantly updated. Therefore, eCPM values were automatically predicted separately for each application on different ad slots and different countries using time series analysis and machine learning algorithms. SARIMA, MLP, CNN and LSTM algorithms are used to make predictions. The LSTM algorithm has generally yielded better results in eCPM estimation. As a result of the trials conducted with a limited number of users of the two applications on production environment, an increase in daily income per user was observed.","PeriodicalId":358654,"journal":{"name":"2020 Turkish National Software Engineering Symposium (UYMS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 Turkish National Software Engineering Symposium (UYMS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/UYMS50627.2020.9247015","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

In the internet advertising industry, web and mobile applications that display ads need to choose high-paying ads to increase their revenue. Ad mediators create various decision mechanisms to select ads that will generate higher revenues in order to increase the revenue of advertising applications. One type of these decision mechanisms is to select and deliver the ad with the highest eCPM (Effective Cost Per Mille) value from ads that can be placed in an ad slot. The eCPM value varies depending on different external factors for different applications. It is not possible for domain experts to make successful predictions by analyzing different sets of external factors for many applications and to keep these predictions constantly updated. Therefore, eCPM values were automatically predicted separately for each application on different ad slots and different countries using time series analysis and machine learning algorithms. SARIMA, MLP, CNN and LSTM algorithms are used to make predictions. The LSTM algorithm has generally yielded better results in eCPM estimation. As a result of the trials conducted with a limited number of users of the two applications on production environment, an increase in daily income per user was observed.
利用机器学习改进网络广告的成本估算:初步结果
在互联网广告行业,显示广告的网络和移动应用程序需要选择高付费广告来增加收入。为了增加广告应用的收入,广告中介创建了各种决策机制来选择能够产生更高收入的广告。其中一种决策机制是选择并投放具有最高eCPM(每英里有效成本)价值的广告。对于不同的应用,eCPM值取决于不同的外部因素。领域专家不可能通过分析许多应用程序的不同外部因素集来做出成功的预测,并使这些预测不断更新。因此,使用时间序列分析和机器学习算法,对不同广告时段和不同国家的每个应用程序分别自动预测eCPM值。使用SARIMA、MLP、CNN和LSTM算法进行预测。LSTM算法在eCPM估计中通常能得到较好的结果。由于在生产环境中对有限数量的两种应用程序用户进行了试验,观察到每个用户的日收入有所增加。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信