Proceedings of the ADKDD'17最新文献

筛选
英文 中文
Optimal Reserve Price for Online Ads Trading Based on Inventory Identification 基于库存识别的网络广告交易最优保留价
Proceedings of the ADKDD'17 Pub Date : 2017-08-14 DOI: 10.1145/3124749.3124760
Zhihui Xie, Kuang-chih Lee, Liang Wang
{"title":"Optimal Reserve Price for Online Ads Trading Based on Inventory Identification","authors":"Zhihui Xie, Kuang-chih Lee, Liang Wang","doi":"10.1145/3124749.3124760","DOIUrl":"https://doi.org/10.1145/3124749.3124760","url":null,"abstract":"The online ads trading platform plays a crucial role in connecting publishers and advertisers and generates tremendous value in facilitating the convenience of our lives. It has been evolving into a more and more complicated structure. In this paper, we consider the problem of maximizing the revenue for the seller side via utilizing proper reserve price for the auctions in a dynamical way. Predicting the optimal reserve price for each auction in the repeated auction marketplaces is a non-trivial problem. However, we were able to come up with an efficient method of improving the seller revenue by mainly focusing on adjusting the reserve price for those high-value inventories. Previously, no dedicated work has been performed from this perspective. Inspired by Paul and Michael [16], our model first identifies the value of the inventory by predicting the top bid price bucket using a cascade of classifiers. The cascade is essential in significantly reducing the false positive rate of a single classifier. Based on the output of the first step, we build another cluster of classifiers to predict the price separations between the top two bids. We showed that although the high-value auctions are only a small portion of all the traffic, successfully identifying them and setting correct reserve price would result in a significant revenue lift. Moreover, our optimization is compatible with all other reserve price models in the system and does not impact their performance. In other words, when combined with other models, the enhancement on exchange revenue will be aggregated. Simulations on randomly sampled Yahoo ads exchange (YAXR) data showed stable and expected lift after applying our model.","PeriodicalId":308091,"journal":{"name":"Proceedings of the ADKDD'17","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-08-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115301914","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 14
Deep & Cross Network for Ad Click Predictions 广告点击预测的深度和交叉网络
Proceedings of the ADKDD'17 Pub Date : 2017-08-14 DOI: 10.1145/3124749.3124754
Ruoxi Wang, Bin Fu, G. Fu, Mingliang Wang
{"title":"Deep & Cross Network for Ad Click Predictions","authors":"Ruoxi Wang, Bin Fu, G. Fu, Mingliang Wang","doi":"10.1145/3124749.3124754","DOIUrl":"https://doi.org/10.1145/3124749.3124754","url":null,"abstract":"Feature engineering has been the key to the success of many prediction models. However, the process is nontrivial and often requires manual feature engineering or exhaustive searching. DNNs are able to automatically learn feature interactions; however, they generate all the interactions implicitly, and are not necessarily efficient in learning all types of cross features. In this paper, we propose the Deep & Cross Network (DCN) which keeps the benefits of a DNN model, and beyond that, it introduces a novel cross network that is more efficient in learning certain bounded-degree feature interactions. In particular, DCN explicitly applies feature crossing at each layer, requires no manual feature engineering, and adds negligible extra complexity to the DNN model. Our experimental results have demonstrated its superiority over the state-of-art algorithms on the CTR prediction dataset and dense classification dataset, in terms of both model accuracy and memory usage.","PeriodicalId":308091,"journal":{"name":"Proceedings of the ADKDD'17","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-08-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126450052","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 865
A Practical Framework of Conversion Rate Prediction for Online Display Advertising 一个实用的网络展示广告转化率预测框架
Proceedings of the ADKDD'17 Pub Date : 2017-08-14 DOI: 10.1145/3124749.3124750
Quan Lu, Shengjun Pan, Liang Wang, Junwei Pan, Fengdan Wan, Hongxia Yang
{"title":"A Practical Framework of Conversion Rate Prediction for Online Display Advertising","authors":"Quan Lu, Shengjun Pan, Liang Wang, Junwei Pan, Fengdan Wan, Hongxia Yang","doi":"10.1145/3124749.3124750","DOIUrl":"https://doi.org/10.1145/3124749.3124750","url":null,"abstract":"Cost-per-action (CPA), or cost-per-acquisition, has become the primary campaign performance objective in online advertising industry. As a result, accurate conversion rate (CVR) prediction is crucial for any real-time bidding (RTB) platform. However, CVR prediction is quite challenging due to several factors, including extremely sparse conversions, delayed feedback, attribution gaps between the platform and the third party, etc. In order to tackle these challenges, we proposed a practical framework that has been successfully deployed on Yahoo! BrightRoll, one of the largest RTB ad buying platforms. In this paper, we first show that over-prediction and the resulted over-bidding are fundamental challenges for CPA campaigns in a real RTB environment. We then propose a safe prediction framework with conversion attribution adjustment to handle over-predictions and to further alleviate over-bidding at different levels. At last, we illustrate both offline and online experimental results to demonstrate the effectiveness of the framework.","PeriodicalId":308091,"journal":{"name":"Proceedings of the ADKDD'17","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-08-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116934052","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 37
Blacklisting the Blacklist in Online Advertising: Improving Delivery by Bidding for What You Can Win 将网络广告中的“黑名单”列入黑名单:通过竞标来提高交付效果
Proceedings of the ADKDD'17 Pub Date : 2017-08-14 DOI: 10.1145/3124749.3124753
Yeming Shi, O. Stitelman, C. Perlich
{"title":"Blacklisting the Blacklist in Online Advertising: Improving Delivery by Bidding for What You Can Win","authors":"Yeming Shi, O. Stitelman, C. Perlich","doi":"10.1145/3124749.3124753","DOIUrl":"https://doi.org/10.1145/3124749.3124753","url":null,"abstract":"Every day, billions of online advertising slots are bought and sold through real time bidding (RTB). In RTB, publishers sometimes reject bids to deliver ads (impressions) for some brands, due to, for example, direct deals with other brands. Publishers rarely disclose which brands they blacklist to ad buyers. Buyers bidding for a blacklisted brand waste computing resources in a low latency environment and lose an opportunity to show a good ad for a different brand. Here we describe a dynamic system developed at Dstillery that detects these (publisher, brand) combinations based on ad auction win rates and limits bidding for them to the minimum. This system demonstrates 1) a significant increase in the win rates of our bids, 2) a sizable reduction of system load, and 3) effectiveness in finding qualified non-blacklisted brands to replace blacklisted brands to show ads for. The system allows us to deliver more ad impressions while making fewer bids. In addition, we develop and demonstrate a methodology of choosing the optimal exploration-exploitation balance of the problem.","PeriodicalId":308091,"journal":{"name":"Proceedings of the ADKDD'17","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-08-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121916605","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
MM2RTB MM2RTB
Proceedings of the ADKDD'17 Pub Date : 2017-08-14 DOI: 10.1145/3124749.3124757
Xiang Chen, Bowei Chen, M. Kankanhalli
{"title":"MM2RTB","authors":"Xiang Chen, Bowei Chen, M. Kankanhalli","doi":"10.1145/3124749.3124757","DOIUrl":"https://doi.org/10.1145/3124749.3124757","url":null,"abstract":"In display advertising, users' online ad experiences are important for the advertising effectiveness. However, users have not been well accommodated in real-time bidding (RTB). This further influences their site visits and perception of the displayed banner ads. In this paper, we propose a novel computational framework which brings multimedia metrics, like the contextual relevance, the visual saliency and the ad memorability into RTB to improve the users' ad experiences as well as maintain the benefits of the publisher and the advertiser. We aim at developing a vigorous ecosystem by optimizing the trade-offs among all stakeholders. The framework considers the scenario of a webpage with multiple ad slots. Our experimental results show that the benefits of the advertiser and the user can be significantly improved if the publisher would slightly sacrifice his short-term revenue. The improved benefits will increase the advertising requests (demand) and the site visits (supply), which can further boost the publisher's revenue in the long run.","PeriodicalId":308091,"journal":{"name":"Proceedings of the ADKDD'17","volume":"101 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-08-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123200943","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
An Ensemble-based Approach to Click-Through Rate Prediction for Promoted Listings at Etsy 一种基于集成的方法来预测Etsy推广列表的点击率
Proceedings of the ADKDD'17 Pub Date : 2017-08-14 DOI: 10.1145/3124749.3124758
Kamelia Aryafar, Devin Guillory, Liangjie Hong
{"title":"An Ensemble-based Approach to Click-Through Rate Prediction for Promoted Listings at Etsy","authors":"Kamelia Aryafar, Devin Guillory, Liangjie Hong","doi":"10.1145/3124749.3124758","DOIUrl":"https://doi.org/10.1145/3124749.3124758","url":null,"abstract":"Etsy1 is a global marketplace where people across the world connect to make, buy and sell unique goods. Sellers at Etsy can promote their product listings via advertising campaigns similar to traditional sponsored search ads. Click-Through Rate (CTR) prediction is an integral part of online search advertising systems where it is utilized as an input to auctions which determine the final ranking of promoted listings to a particular user for each query. In this paper, we provide a holistic view of Etsy's promoted listings' CTR prediction system and propose an ensemble learning approach which is based on historical or behavioral signals for older listings as well as content-based features for new listings. We obtain representations from texts and images by utilizing state-of-the-art deep learning techniques and employ multimodal learning to combine these different signals. We compare the system to non-trivial baselines on a large-scale real world dataset from Etsy, demonstrating the effectiveness of the model and strong correlations between offline experiments and online performance. The paper is also the first technical overview to this kind of product in e-commerce context.","PeriodicalId":308091,"journal":{"name":"Proceedings of the ADKDD'17","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-08-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129046588","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 19
Ranking and Calibrating Click-Attributed Purchases in Performance Display Advertising 排名和校准点击属性购买在性能显示广告
Proceedings of the ADKDD'17 Pub Date : 2017-08-14 DOI: 10.1145/3124749.3124755
Sougata Chaudhuri, A. Bagherjeiran, James Liu
{"title":"Ranking and Calibrating Click-Attributed Purchases in Performance Display Advertising","authors":"Sougata Chaudhuri, A. Bagherjeiran, James Liu","doi":"10.1145/3124749.3124755","DOIUrl":"https://doi.org/10.1145/3124749.3124755","url":null,"abstract":"In performance display advertising, bidders compete on behalf of advertisers for ad impressions, that is, the opportunity to display relevant ads on a publisher website. We consider bidding on behalf of online retailers who buy ad impressions hoping to realize value only from purchases attributed from clicks. The bidder has a two stage problem. In the first stage, the bidder has to select a small subset from a large selection of ads, with the selected ads most likely to lead to purchases. In the second stage, the bidder has to estimate the purchase probability of the selected ads, which can then be used to create bid values. The challenge in the first stage is that a model optimized for purchases also needs to be (near) optimal for clicks, due to the click attribution constraint. The challenge in the second stage is that true probability of purchases is extremely small, and is difficult to accurately model. We propose a ranking model, followed by a calibration method, to sequentially address the two stage problem. We describe how ordinal ranking is a natural fit for the ad selection problem and how to learn a single model by optimizing for purchases, while being (near) optimal for clicks. We then propose a calibration method, which comprises of a novel non-uniform binning technique for empirical probability estimation, in conjunction with calibration functions such as isotonic and polynomial regression and Platt scaling. We provide empirical results on logged events from a major ad network, that demonstrate the superiority of ordinal model over binary classifiers for ranking ads and the superiority of our proposed calibration technique over traditional uniform binning based calibration technique.","PeriodicalId":308091,"journal":{"name":"Proceedings of the ADKDD'17","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-08-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132302399","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 9
Data-Driven Reserve Prices for Social Advertising Auctions at LinkedIn 数据驱动的保留价格在领英的社会广告拍卖
Proceedings of the ADKDD'17 Pub Date : 2017-08-14 DOI: 10.1145/3124749.3124759
Tingting Cui, Lijun Peng, D. Pardoe, Kun Liu, D. Agarwal, Deepak Kumar
{"title":"Data-Driven Reserve Prices for Social Advertising Auctions at LinkedIn","authors":"Tingting Cui, Lijun Peng, D. Pardoe, Kun Liu, D. Agarwal, Deepak Kumar","doi":"10.1145/3124749.3124759","DOIUrl":"https://doi.org/10.1145/3124749.3124759","url":null,"abstract":"Online advertising auctions constitute an important source of revenue for search engines such as Google and Bing, as well as social networks such as Facebook, LinkedIn and Twitter. We study the problem of setting the optimal reserve price in a Generalized Second Price auction, guided by auction theory with suitable adaptations to social advertising at LinkedIn. Two types of reserve prices are deployed: one at the user level, which is kept private by the publisher, and the other at the audience segment level, which is made public to advertisers. We demonstrate through field experiments the effectiveness of this reserve price mechanism to promote demand growth, increase ads revenue, and improve advertiser experience.","PeriodicalId":308091,"journal":{"name":"Proceedings of the ADKDD'17","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-08-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129365383","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Anti-Ad Blocking Strategy: Measuring its True Impact 反广告拦截策略:衡量其真正影响
Proceedings of the ADKDD'17 Pub Date : 2017-08-14 DOI: 10.1145/3124749.3124756
Atanu R. Sinha, Meghanath Macha, Pranav Maneriker, Sopan Khosla, Avani Samdariya, Navjot Singh
{"title":"Anti-Ad Blocking Strategy: Measuring its True Impact","authors":"Atanu R. Sinha, Meghanath Macha, Pranav Maneriker, Sopan Khosla, Avani Samdariya, Navjot Singh","doi":"10.1145/3124749.3124756","DOIUrl":"https://doi.org/10.1145/3124749.3124756","url":null,"abstract":"The increasing use of ad blocking software poses a major threat for publishers in loss of online ad revenue, and for advertisers in the loss of audience. Major publishers have adopted various anti-ad blocking strategies such as denial of access to website content and asking users to subscribe to paid ad-free versions. However, publishers are unsure about the true impact of these strategies [2, 3]. We posit that the real problem lies in the measurement of effectiveness because the existing methods compare metrics after implementation of such strategies with that of metrics just before implementation, making them error prone due to sampling bias. The errors arise due to differences in group compositions across before and after periods, as well as differences in time-period selection for the before measurement. We propose a novel algorithmic method which modifies the difference-in-differences approach to address the sampling bias due to differences in time-period selection. Unlike difference-in-differences, we choose the time-period for comparison in an endogenous manner, as well as, exploit differences in ad blocking tendencies among visitors' arriving on the publisher's site to allow cluster specific choice of the control time-period. We evaluate the method on both synthetic data (which we make available) and proprietary real data from an online publisher and find good support.","PeriodicalId":308091,"journal":{"name":"Proceedings of the ADKDD'17","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-08-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130748064","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 4
Attribution Modeling Increases Efficiency of Bidding in Display Advertising 归因建模提高了展示广告的竞价效率
Proceedings of the ADKDD'17 Pub Date : 2017-07-20 DOI: 10.1145/3124749.3124752
E. Diemert, J. Meynet, Pierre Galland, Damien Lefortier
{"title":"Attribution Modeling Increases Efficiency of Bidding in Display Advertising","authors":"E. Diemert, J. Meynet, Pierre Galland, Damien Lefortier","doi":"10.1145/3124749.3124752","DOIUrl":"https://doi.org/10.1145/3124749.3124752","url":null,"abstract":"Predicting click and conversion probabilities when bidding on ad exchanges is at the core of the programmatic advertising industry. Two separated lines of previous works respectively address i) the prediction of user conversion probability and ii) the attribution of these conversions to advertising events (such as clicks) after the fact. We argue that attribution modeling improves the efficiency of the bidding policy in the context of performance advertising. Firstly we explain the inefficiency of the standard bidding policy with respect to attribution. Secondly we learn and utilize an attribution model in the bidder itself and show how it modifies the average bid after a click. Finally we produce evidence of the effectiveness of the proposed method on both offline and online experiments with data spanning several weeks of real traffic from Criteo, a leader in performance advertising.","PeriodicalId":308091,"journal":{"name":"Proceedings of the ADKDD'17","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133093856","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 40
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书