Web ad-slot offline scheduling using an ant colony algorithm

Vasile Palade; Soumya Banerjee

doi:10.1109/ICMLA.2011.158

Web ad-slot offline scheduling using an ant colony algorithm

Vasile Palade, Soumya Banerjee

Research output: Chapter in Book/Report/Conference proceeding › Conference proceeding › peer-review

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 language	English
Title of host publication	Proceedings - 10th International Conference on Machine Learning and Applications, ICMLA 2011
Pages	263-268
Number of pages	6
Volume	2
DOIs	https://doi.org/10.1109/ICMLA.2011.158
Publication status	Published - 2011
Externally published	Yes
Event	10th International Conference on Machine Learning and Applications, ICMLA 2011 - Honolulu, United States Duration: 18 Dec 2011 → 21 Dec 2011

Conference

Conference	10th International Conference on Machine Learning and Applications, ICMLA 2011
Country/Territory	United States
City	Honolulu
Period	18/12/11 → 21/12/11

Keywords

Ant Colony Optimization
Web Ad-Slot Scheduling

ASJC Scopus subject areas

Computer Science Applications
Human-Computer Interaction

Access to Document

10.1109/ICMLA.2011.158

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, 6147685, pp. 263-268, 10th International Conference on Machine Learning and Applications, ICMLA 2011, Honolulu, Hawaii, United States, 18/12/11. https://doi.org/10.1109/ICMLA.2011.158

@inproceedings{2503d20235064f7fbd96db971dcb005b,

title = "Web ad-slot offline scheduling using an ant colony algorithm",

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.",

keywords = "Ant Colony Optimization, Web Ad-Slot Scheduling",

author = "Vasile Palade and Soumya Banerjee",

year = "2011",

doi = "10.1109/ICMLA.2011.158",

language = "English",

isbn = "9780769546070",

volume = "2",

pages = "263--268",

booktitle = "Proceedings - 10th International Conference on Machine Learning and Applications, ICMLA 2011",

note = "10th International Conference on Machine Learning and Applications, ICMLA 2011 ; Conference date: 18-12-2011 Through 21-12-2011",

}

TY - GEN

T1 - Web ad-slot offline scheduling using an ant colony algorithm

AU - Palade, Vasile

AU - Banerjee, Soumya

PY - 2011

Y1 - 2011

N2 - 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.

AB - 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.

KW - Ant Colony Optimization

KW - Web Ad-Slot Scheduling

UR - https://www.scopus.com/pages/publications/84857890833

U2 - 10.1109/ICMLA.2011.158

DO - 10.1109/ICMLA.2011.158

M3 - Conference proceeding

AN - SCOPUS:84857890833

SN - 9780769546070

VL - 2

SP - 263

EP - 268

BT - Proceedings - 10th International Conference on Machine Learning and Applications, ICMLA 2011

T2 - 10th International Conference on Machine Learning and Applications, ICMLA 2011

Y2 - 18 December 2011 through 21 December 2011

ER -

Web ad-slot offline scheduling using an ant colony algorithm

Abstract

Conference

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this