基于蚁群算法的Web广告时段离线调度

2011 10th International Conference on Machine Learning and Applications and Workshops Pub Date : 2011-12-18 DOI:10.1109/ICMLA.2011.158

V. Palade, S. Banerjee

{"title":"基于蚁群算法的Web广告时段离线调度","authors":"V. Palade, S. Banerjee","doi":"10.1109/ICMLA.2011.158","DOIUrl":null,"url":null,"abstract":"Online advertisements (ads) placed at different positions on a web page get different number of 'hits' depending on the position and the time the ad occupies a particular position of advertisement on the web page. The management of online advertisement slots (ad-slots) on a web page is a dynamic problem and various derivative free optimization techniques could be employed for solving it. This paper presents an ant colony based algorithm for assigning bidders to click generating ad-slots. The objective is to maximize the profit obtained from clicks on ads, under some budget constraints for bidders and some scheduling constraints on the slots. A few instances of results for ads' allocation and bidding have been presented in the paper and demonstrate the approach.","PeriodicalId":439926,"journal":{"name":"2011 10th International Conference on Machine Learning and Applications and Workshops","volume":"32 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Web Ad-Slot Offline Scheduling Using an Ant Colony Algorithm\",\"authors\":\"V. Palade, S. Banerjee\",\"doi\":\"10.1109/ICMLA.2011.158\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Online advertisements (ads) placed at different positions on a web page get different number of 'hits' depending on the position and the time the ad occupies a particular position of advertisement on the web page. The management of online advertisement slots (ad-slots) on a web page is a dynamic problem and various derivative free optimization techniques could be employed for solving it. This paper presents an ant colony based algorithm for assigning bidders to click generating ad-slots. The objective is to maximize the profit obtained from clicks on ads, under some budget constraints for bidders and some scheduling constraints on the slots. A few instances of results for ads' allocation and bidding have been presented in the paper and demonstrate the approach.\",\"PeriodicalId\":439926,\"journal\":{\"name\":\"2011 10th International Conference on Machine Learning and Applications and Workshops\",\"volume\":\"32 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-12-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 10th International Conference on Machine Learning and Applications and Workshops\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICMLA.2011.158\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 10th International Conference on Machine Learning and Applications and Workshops","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICMLA.2011.158","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 4

摘要

放置在网页上不同位置的在线广告(广告)获得不同数量的“点击”，这取决于广告在网页上占据特定位置的位置和时间。网页上的在线广告位(ad-slots)管理是一个动态问题，可以采用各种无导数优化技术来解决这个问题。提出了一种基于蚁群的竞价广告位分配算法。目标是最大限度地从点击广告获得的利润，在一些预算约束下投标人和一些调度约束的插槽。本文给出了广告分配和竞价的几个实例，并对该方法进行了验证。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Web Ad-Slot Offline Scheduling Using an Ant Colony Algorithm

Online advertisements (ads) placed at different positions on a web page get different number of 'hits' depending on the position and the time the ad occupies a particular position of advertisement on the web page. The management of online advertisement slots (ad-slots) on a web page is a dynamic problem and various derivative free optimization techniques could be employed for solving it. This paper presents an ant colony based algorithm for assigning bidders to click generating ad-slots. The objective is to maximize the profit obtained from clicks on ads, under some budget constraints for bidders and some scheduling constraints on the slots. A few instances of results for ads' allocation and bidding have been presented in the paper and demonstrate the approach.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2011 10th International Conference on Machine Learning and Applications and Workshops

自引率

0.00%

发文量