| Summary: | 碩士 === 國立交通大學 === 資訊科學與工程研究所 === 105 === In recent years, the digital signage industry has experienced tremendous growth, so the topic of digital signage-based advertisement scheduling become hotter. In this paper, we study a impression maximization problem for advertisement scheduling on digital signages. We train an AD-model to make our system more intelligent to help our scheduling. We proposed two sets of advertisement scheduling algorithms, probability-based scheduling and AD-Pair scheduling. Our probability-based scheduling algorithms help us to save much time to schedule the playing order. And the AD-Pair scheduling algorithms groundbreakingly bind two Ads together as a playing unit. In the situation that there are not many, even any strong Ads, we creatively add some strong Ads (we call them "Attractions") into the advertisements set given by advertisers, to attract more people to watch the signage. We have conducted comprehensive experiments on synthetic datasets, and the experimental results show that the proposed models are suitable for effective impression maximization in digital signage advertising.
|
|---|
