# Optimizing Impression Counts for Outdoor Advertising

@article{Zhang2019OptimizingIC,
title={Optimizing Impression Counts for Outdoor Advertising},
author={Yipeng Zhang and Yuchen Li and Zhifeng Bao and Songsong Mo and Ping Zhang},
journal={Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery \& Data Mining},
year={2019}
}
• Published 25 July 2019
• Computer Science
• Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining
In this paper we propose and study the problem of optimizing the influence of outdoor advertising (ad) when impression counts are taken into consideration. Given a database U of billboards, each of which has a location and a non-uniform cost, a trajectory database T and a budget B, it aims to find a set of billboards that has the maximum influence under the budget. In line with the advertising consumer behavior studies, we adopt the logistic function to take into account the impression counts…

## Figures and Tables from this paper

Data-driven Targeted Advertising Recommendation System for Outdoor Billboard
• Computer Science
ACM Trans. Intell. Syst. Technol.
• 2022
This article proposes and studies a novel data-driven framework for Targeted Outdoor Advertising Recommendation (TOAR) with a special consideration of user profiles and advertisement topics, and develops two effective approaches, i.e., a master–slave-based sequential optimization method, TOAR-MSS, and a cooperative co-evolution-based optimization method.
Minimizing the Regret of an Influence Provider
• Computer Science
SIGMOD Conference
• 2021
A randomized local search framework with two neighborhood search strategies is proposed, and it is proved that one of them ensures an approximation factor to a dual problem of \problem, which is both NP-hard and NP- hard to approximate within any constant factor.
Geodemographic Influence Maximization
• Computer Science
KDD
• 2020
An efficient deterministic algorithm, Lazy-Sower, is developed, exploiting a novel, tight double-bounding scheme of marginal influence gain as well as the locality proprieties of the problem, to find a set of locations within a budget that achieves maximum expected reach.
Reinforcement Learning Based Advertising Strategy Using Crowdsensing Vehicular Data
IEEE Transactions on Intelligent Transportation Systems
• 2021
This work extracts potential customers’ implicit information by using the vehicular data collected by Mobile CrowdSensing, such as their vehicular trajectories and their preferences, and proposes an advertising strategy based on multi-agent deep reinforcement learning to maximize the commercial profit for the advertiser.
ITAA: An Intelligent Trajectory-driven Outdoor Advertising Deployment Assistant
• Computer Science
Proc. VLDB Endow.
• 2019
An Intelligent Trajectory-driven outdoor Advertising deployment Assistant (ITAA) is demonstrated, which assists users to find an optimal strategy for outdoor advertising (ad) deployment and enhances the interpretability to improve the users understanding of the influence of ads.
A Survey on Location-Driven Influence Maximization
ArXiv
• 2022
A comprehensive review of the existing location-driven IM studies from the per-spective of the following key aspects, and a comprehensive study of the approaches to deal with the location- driven IM problems together with a particular focus on the accelerating techniques.
DARS: Diversity and Distribution-Aware Region Search
• Computer Science
DASFAA
• 2020
This paper introduces a novel problem called the diversity and distribution-aware region search (DARS) problem, which aims to find regions of size $$a \times b$$ where the number of different categories is maximized such that objects of different category are not too scattered from each other and objects of the same category are within reasonable distance.
Towards an Optimal Bus Frequency Scheduling: When the Waiting Time Matters
• Computer Science
IEEE Transactions on Knowledge and Data Engineering
• 2020
This paper studies the bus frequency optimization problem considering the user satisfaction, and for the first time to the best knowledge, studies how to schedule the buses such that the total number of passengers who could receive their bus services within the waiting time threshold can be maximized.
Let Trajectories Speak Out the Traffic Bottlenecks
• Computer Science
ACM Trans. Intell. Syst. Technol.
• 2022
This paper defines this problem as trajectory-driven traffic bottleneck identification as well as proposing two different algorithmic approaches to solve the problem, and shows that this problem is NP-hard and proposes a framework to find the traffic bottlenecks.

## References

SHOWING 1-10 OF 34 REFERENCES
Trajectory-driven Influential Billboard Placement
• Computer Science
KDD
• 2018
This paper presents an enumeration based algorithm with $(1-1/e)$ approximation ratio, and proposes a \bbsel method to further prune billboards with low marginal influence, while achieving the same approximation ratio as \psel.
Finding the optimal location and keywords in obstructed and unobstructed space
• Computer Science
The VLDB Journal
• 2018
This work addresses two instances of the spatial relevance when ranking items: (1) the Euclidean distance and (2) the visibility and presents both approximate and exact solutions for the problem.
The Budgeted Maximum Coverage Problem
• Computer Science
Inf. Process. Lett.
• 1999
Efficient location-aware influence maximization
• Computer Science
SIGMOD Conference
• 2014
Experimental results on real datasets show the proposed method achieves high performance while keeping large influence spread and significantly outperforms state-of-the-art algorithms.
Local-Search based Approximation Algorithms for Mobile Facility Location Problems
• Computer Science
SODA
• 2013
The first local-search based approximation algorithm for MFL is given and it achieves the best-known approximation guarantee for the k-median problem and the main result is (3 + e)-approximation for this problem for any constant e > 0 using local search.
The Shape of Advertising Response Functions Revisited: A Model of Dynamic Probabilistic Thresholds
• 2004
Prior work in marketing has suggested that advertising threshold effects -levels beneath which there is essentially no sales response-are rarely encountered in practice. Because advertising policies
On Facility Location with General Lower Bounds
• Shi Li
• Computer Science
SODA
• 2019
The first constant approximation algorithm for the lower bounded facility location (LBFL) problem with general lower bounds is given, which is introduced and reduced to an intermediate problem called the transportation with configurable supplies and demands (TCSD) problem, which in turn can be reduced to the CFL problem.
MaxFirst for MaxBRkNN
• Computer Science
2011 IEEE 27th International Conference on Data Engineering
• 2011
An efficient solution called MaxFirst is presented to solve the generalized MaxBRkNN problem which finds an optimal region such that setting up a service site in this region guarantees the maximum number of customers who would consider the site as one of their k nearest service locations.
Discrete Choice Methods with Simulation
Discrete Choice Methods with Simulation by Kenneth Train has been available in the second edition since 2009 and contains two additional chapters, one on endogenous regressors and one on the expectation–maximization (EM) algorithm.
Feature Article - Aggregate Advertising Models: The State of the Art
A review of aggregate models developed on a priori grounds brings out similarities and differences among those of Vidale and Wolfe, Nerlove and Arrow, Little, and others and identifies ways in which the models agree or disagree with observed phenomena.