{"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}
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.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
