Abstract
AbstractPixel 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.KeywordsExecution TimeKnapsack ProblemGreedy Randomize Adaptive Search ProcedureDomain OntologyAdvertisement BannerThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
