Adslot Mining for Online Display Ads

Kazuki Taniguchi, Yuki Harada, Nguyen Tuan Duc
{"title":"Adslot Mining for Online Display Ads","authors":"Kazuki Taniguchi, Yuki Harada, Nguyen Tuan Duc","doi":"10.1109/ICDMW.2015.82","DOIUrl":null,"url":null,"abstract":"Finding appropriate adslots to display ads is an important step to achieve high conversion rates in online display advertising. Previous work on ad recommendation and conversion prediction often focuses on matching between adslots, users and ads simultaneously for each impression at micro level. Such methods require rich attributes of users, ads and adslots, which might not always be available, especially with ad-adslot pairs that have never been displayed. In this research, we propose a macro approach for mining new adslots for each ad by recommending appropriate adslots to the ad. The proposed method does not require any user information and can be pre-calculated offline, even when there are not any impressions of the ad on the target adslots. It applies matrix factorization techniques to the ad-adslot performance history matrix to calculate the predicted performance of the target adslots. Experiments show that the proposed method achieves a small root mean-square error (RMSE) when testing with offline data and it yields high conversion rates in online tests with real-world ad campaigns.","PeriodicalId":192888,"journal":{"name":"2015 IEEE International Conference on Data Mining Workshop (ICDMW)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 IEEE International Conference on Data Mining Workshop (ICDMW)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICDMW.2015.82","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

Finding appropriate adslots to display ads is an important step to achieve high conversion rates in online display advertising. Previous work on ad recommendation and conversion prediction often focuses on matching between adslots, users and ads simultaneously for each impression at micro level. Such methods require rich attributes of users, ads and adslots, which might not always be available, especially with ad-adslot pairs that have never been displayed. In this research, we propose a macro approach for mining new adslots for each ad by recommending appropriate adslots to the ad. The proposed method does not require any user information and can be pre-calculated offline, even when there are not any impressions of the ad on the target adslots. It applies matrix factorization techniques to the ad-adslot performance history matrix to calculate the predicted performance of the target adslots. Experiments show that the proposed method achieves a small root mean-square error (RMSE) when testing with offline data and it yields high conversion rates in online tests with real-world ad campaigns.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
在线展示广告的广告位挖掘
寻找合适的广告位是网络展示广告实现高转化率的重要一步。以前关于广告推荐和转化预测的工作通常侧重于在微观层面上同时匹配每个印象的广告位、用户和广告。这些方法需要用户、广告和adslot的丰富属性,这些属性可能并不总是可用的,特别是对于从未显示过的ad-adslot对。在这项研究中,我们提出了一种宏观方法,通过向广告推荐合适的广告位来为每个广告挖掘新的广告位。所提出的方法不需要任何用户信息,并且可以离线预计算,即使在目标广告槽上没有任何广告印象。它将矩阵分解技术应用于ad-adslot性能历史矩阵,以计算目标adslot的预测性能。实验表明,该方法在离线数据测试中获得了较小的均方根误差(RMSE),并且在真实广告活动的在线测试中产生了较高的转化率。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Large-Scale Linear Support Vector Ordinal Regression Solver Joint Recovery and Representation Learning for Robust Correlation Estimation Based on Partially Observed Data Accurate Classification of Biological Data Using Ensembles Large-Scale Unusual Time Series Detection Sentiment Polarity Classification Using Structural Features
×
引用
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