Abstract
Pixel advertising represents the placement of multiple pixel blocks on a banner for the purpose of advertising companies and their products. In this paper, we investigate how one can avoid product conflicts in the placement of pixel advertisements on a Web banner, while maximizing the overall banner revenue. Our solution for this problem is based on a product ontology that defines products and their relationships. We evaluate three heuristic algorithms for generating allocation patterns, i.e., the left justified algorithm, the orthogonal algorithm, and the GRASP constructive algorithm. The results show that the left justified algorithm and the orthogonal algorithm are most effective in terms of profit per pixel, while the GRASP constructive algorithm is identified as most efficient in terms of computational time.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Alvarez-Valdes, R., Parreño, F., Tamarit, J.M.: A GRASP algorithm for constrained two-dimensional non-guillotine cutting problems. The Journal of the Operational Research Society 56(4), 414–425 (2005)
Beasley, J.: An exact two-dimensional non-guillotine cutting tree search procedure. Operations Research 33(1), 49–64 (1985)
Boskamp, V., Knoops, A., Frasincar, F., Gabor, A.: Maximizing revenue with allocation of multiple advertisements on a web banner. Computers & Operations Research 38, 1412–1424 (2011)
Budak Arpinar, I., Karthikeyan Giriloganathan, B.A.M.: Ontology quality by detection of conflicts in metadata. In: 4th International Workshop on Evaluation of Ontologies for the Web (EON 2006) (2006)
Google: Financial tables 2014 (2014), http://investor.google.com/financial/tables.html
Hadjiconstantinou, E., Christofides, N.: An exact algorithm for general, orthogonal, two-dimensional knapsack problems. European Journal of Operational Research 83(1), 39–56 (1995)
Hof, R.: Online ad revenues to pass print in 2012, http://www.forbes.com/sites/roberthof/2012/01/19/online-ad-revenues-to-pass-print-in-2012/
Interactive Advertising Bureau: Ad unit guidelines, http://www.iab.net/iab_products_and_industry_services/1421/1443/1452
Knoops, A., Boskamp, V., Wojciechowski, A., Frasincar, F.: Single pattern generating heuristics for pixel advertisements. In: Vossen, G., Long, D.D.E., Yu, J.X. (eds.) WISE 2009. LNCS, vol. 5802, pp. 415–428. Springer, Heidelberg (2009)
Nah, F.F.H.: A study on tolerable waiting time: how long are web users willing to wait? Behaviour & Information Technology 23(3), 153–163 (2004)
OECD: Competition: Economic issues, http://www.oecd.org/
Tew, A.: Million dollar homepage, http://www.milliondollarhomepage.com/
Wäscher, G., Haussner, H., Schumann, H.: An improved typology of cutting and packing problems. European Journal of Operational Research 183(3), 1109–1130 (2007)
Wojciechowski, A.: An improved web system for pixel advertising. In: Bauknecht, K., Pröll, B., Werthner, H. (eds.) EC-Web 2006. LNCS, vol. 4082, pp. 232–241. Springer, Heidelberg (2006)
Wojciechowski, A., Kapral, D.: Allocation of multiple advertisement on limited space: Heuristic approach. In: Mauthe, A., Zeadally, S., Cerqueira, E., Curado, M. (eds.) FMN 2009. LNCS, vol. 5630, pp. 230–235. Springer, Heidelberg (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Boon, F., Bouzidi, S., Vermaas, R., Vandic, D., Frasincar, F. (2014). Ontology-Based Management of Conflicting Products in Pixel Advertising. In: Benatallah, B., Bestavros, A., Manolopoulos, Y., Vakali, A., Zhang, Y. (eds) Web Information Systems Engineering – WISE 2014. WISE 2014. Lecture Notes in Computer Science, vol 8786. Springer, Cham. https://doi.org/10.1007/978-3-319-11749-2_33
Download citation
DOI: https://doi.org/10.1007/978-3-319-11749-2_33
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-11748-5
Online ISBN: 978-3-319-11749-2
eBook Packages: Computer ScienceComputer Science (R0)