Web ad-slot offline scheduling using an ant colony algorithm

Vasile Palade, Soumya Banerjee

Research output: Chapter in Book/Report/Conference proceedingConference proceeding

4 Citations (Scopus)

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.

Original languageEnglish
Title of host publicationProceedings - 10th International Conference on Machine Learning and Applications, ICMLA 2011
Pages263-268
Number of pages6
Volume2
DOIs
Publication statusPublished - 2011
Externally publishedYes
Event10th International Conference on Machine Learning and Applications, ICMLA 2011 - Honolulu, HI, United States
Duration: 18 Dec 201121 Dec 2011

Conference

Conference10th International Conference on Machine Learning and Applications, ICMLA 2011
CountryUnited States
CityHonolulu, HI
Period18/12/1121/12/11

Keywords

  • Ant Colony Optimization
  • Web Ad-Slot Scheduling

ASJC Scopus subject areas

  • Computer Science Applications
  • Human-Computer Interaction

Fingerprint Dive into the research topics of 'Web ad-slot offline scheduling using an ant colony algorithm'. Together they form a unique fingerprint.

  • Cite this

    Palade, V., & Banerjee, S. (2011). Web ad-slot offline scheduling using an ant colony algorithm. In Proceedings - 10th International Conference on Machine Learning and Applications, ICMLA 2011 (Vol. 2, pp. 263-268). [6147685] https://doi.org/10.1109/ICMLA.2011.158