Abstract
In this article, we propose and study the problem of trajectory-driven influential billboard placement: given a set of billboards U (each with a location and a cost), a database of trajectories T, and a budget L, we find a set of billboards within the budget to influence the largest number of trajectories. One core challenge is to identify and reduce the overlap of the influence from different billboards to the same trajectories, while keeping the budget constraint into consideration. We show that this problem is NP-hard and present an enumeration based algorithm with (1-1/e) approximation ratio. However, the enumeration would be very costly when |U| is large. By exploiting the locality property of billboards’ influence, we propose a partition-based framework PartSel. PartSel partitions U into a set of small clusters, computes the locally influential billboards for each cluster, and merges them to generate the global solution. Since the local solutions can be obtained much more efficiently than the global one, PartSel would reduce the computation cost greatly; meanwhile it achieves a non-trivial approximation ratio guarantee. Then we propose a LazyProbe method to further prune billboards with low marginal influence, while achieving the same approximation ratio as PartSel. Next, we propose a branch-and-bound method to eliminate unnecessary enumerations in both PartSel and LazyProbe, as well as an aggregated index to speed up the computation of marginal influence. Experiments on real datasets verify the efficiency and effectiveness of our methods.
- Outdoor Advertising Association of America. 2018. Retrieved from http://oaaa.org/StayConnected/NewsArticles/IndustryRevenue/tabid/322/id/4928.Google Scholar
- A. Guttmann. 2018. Retrieved from https://www.statista.com/topics/979/advertising-in-the-us.Google Scholar
- Lamar Advertising Company. 2018. Retrieved from http://apps.lamar.com/demographicrates/content/salesdocuments/nationalratecard.xlsx.Google Scholar
- Ranjan. 2018. Retrieved from http://www.alloutdigital.com/2012/09/what-are-some-advantages-of-digital-billboard-advertising.Google Scholar
- Running Boards Pty Ltd. 2018. Retrieved from http://www.runningboards.com.au/outdoor/relocatable-billboards.Google Scholar
- Christian Borgs, Michael Brautbar, Jennifer Chayes, and Brendan Lucier. 2014. Maximizing social influence in nearly optimal time. In Proceedings of the 25th Annual ACM-SIAM Symposium on Discrete Algorithms. 946--957.Google ScholarCross Ref
- Shuo Chen, Ju Fan, Guoliang Li, Jianhua Feng, Kian-Lee Tan, and Jinhui Tang. 2015. Online topic-aware influence maximization. Proceedings of the VLDB Endowment 8, 6 (2015), 666--677.Google ScholarDigital Library
- Wei Chen, Chi Wang, and Yajun Wang. 2010. Scalable influence maximization for prevalent viral marketing in large-scale social networks. In Proceedings of the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. 1029--1038.Google ScholarDigital Library
- Farhana Murtaza Choudhury, J. Shane Culpepper, Zhifeng Bao, and Timos Sellis. 2018. Finding the optimal location and keywords in obstructed and unobstructed space. The VLDB Journal 27, 4 (2018), 445–470. DOI:https://doi.org/10.1007/s00778-018-0504-yGoogle ScholarDigital Library
- Uriel Feige. 1998. A threshold of ln n for approximating set cover. Journal of the ACM 45, 4 (1998), 634--652.Google ScholarDigital Library
- Long Guo, Dongxiang Zhang, Gao Cong, Wei Wu, and Kian-Lee Tan. 2017. Influence maximization in trajectory databases. IEEE Transactions on Knowledge and Data Engineering 29, 3 (2017), 627--641.Google ScholarDigital Library
- David Kempe, Jon Kleinberg, and Éva Tardos. 2003. Maximizing the spread of influence through a social network. In Proceedings of the 9th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. 137--146.Google ScholarDigital Library
- Samir Khuller, Anna Moss, and Joseph Seffi Naor. 1999. The budgeted maximum coverage problem. Information Processing Letters 70, 1 (1999), 39--45.Google ScholarDigital Library
- Jure Leskovec, Andreas Krause, Carlos Guestrin, Christos Faloutsos, Jeanne VanBriesen, and Natalie Glance. 2007. Cost-effective outbreak detection in networks. In Proceedings of the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. 420--429.Google ScholarDigital Library
- Guoliang Li, Shuo Chen, Jianhua Feng, Kian-lee Tan, and Wen-syan Li. 2014. Efficient location-aware influence maximization. In Proceedings of the 2014 ACM SIGMOD International Conference on Management of Data. ACM, 87--98.Google ScholarDigital Library
- Yuchen Li, Dongxiang Zhang, and Kian-Lee Tan. 2015. Real-time targeted influence maximization for online advertisements. Proceedings of the VLDB Endowment 8, 10 (2015), 1070--1081.Google ScholarDigital Library
- Yuchen Li, Ju Fan, Dongxiang Zhang, and Kian-Lee Tan. 2017. Discovering your selling points: Personalized social influential tags exploration. In Proceedings of the 2017 ACM International Conference on Management of Data. ACM, 619--634.Google ScholarDigital Library
- Yuchen Li, Ju Fan, Yanhao Wang, and Kian-Lee Tan. 2018. Influence maximization on social graphs: A survey. IEEE Transactions on Knowledge and Data Engineering 30, 10 (2018), 1852–1872.Google ScholarCross Ref
- Dongyu Liu, Di Weng, Yuhong Li, Jie Bao, Yu Zheng, Huamin Qu, and Yingcai Wu. 2017. SmartAdP: Visual analytics of large-scale taxi trajectories for selecting billboard locations. IEEE Transactions on Visualization and Computer Graphics 23, 1 (2017), 1--10.Google ScholarDigital Library
- Yubao Liu, Raymond Chi-Wing Wong, Ke Wang, Zhijie Li, Cheng Chen, and Zhitong Chen. 2013. A new approach for maximizing bichromatic reverse nearest neighbor search. Knowledge and Information Systems 36, 1 (Jul, 2013), 23--58.Google ScholarDigital Library
- Fionn Murtagh. 1983. A survey of recent advances in hierarchical clustering algorithms. The Computer Journal 26, 4 (1983), 354--359.Google ScholarCross Ref
- El-Ghazali Talbi. 2009. Metaheuristics: From Design to Implementation. Vol. 74. John Wiley 8 Sons.Google ScholarDigital Library
- Youze Tang, Xiaokui Xiao, and Yanchen Shi. 2014. Influence maximization: Near-optimal time complexity meets practical efficiency. In Proceedings of the 2014 ACM SIGMOD International Conference on Management of Data. ACM, 75--86.Google ScholarDigital Library
- Dorothea Wagner and Frank Wagner. 1993. Between Min Cut and Graph Bisection. Springer, Berlin. 744--750.Google Scholar
- Sheng Wang, Zhifeng Bao, J. Shane Culpepper, Timos Sellis, Mark Sanderson, and Xiaolin Qin. 2017. Answering top-k exemplar trajectory queries. In Proceedings of the 2017 IEEE 33rd International Conference on Data Engineering. IEEE, 597--608.Google ScholarCross Ref
- Sheng Wang, Zhifeng Bao, J. Shane Culpepper, Timos Sellis, and Gao Cong. 2018. Reverse k nearest neighbor search over trajectories. IEEE Transactions on Knowledge and Data Engineering 30, 4 (2018), 757--771.Google ScholarCross Ref
- Sheng Wang, Zhifeng Bao, J. Shane Culpepper, Zizhe Xie, Qizhi Liu, and Xiaolin Qin. 2018. Torch: A search engine for trajectory data. In Proceedings of the International ACM SIGIR Conference on Research and Development in Information Retrieval. ACM.Google ScholarDigital Library
- Raymond Chi-Wing Wong, M. Tamer Özsu, Philip S. Yu, Ada Wai-Chee Fu, and Lian Liu. 2009. Efficient method for maximizing bichromatic reverse nearest neighbor. Proceedings of the VLDB Endowment 2, 1 (2009), 1126--1137.Google ScholarDigital Library
- Zenan Zhou, Wei Wu, Xiaohui Li, Mong Li Lee, and Wynne Hsu. 2011. MaxFirst for MaxBRkNN. In Proceedings of the IEEE 27th International Conference on Data Engineering. IEEE, 828--839.Google ScholarDigital Library
Index Terms
- Towards an Optimal Outdoor Advertising Placement: When a Budget Constraint Meets Moving Trajectories
Recommendations
Trajectory-driven Influential Billboard Placement
KDD '18: Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data MiningIn this paper we propose and study the problem of trajectory-driven influential billboard placement: given a set of billboards $\ur$ (each with a location and a cost), a database of trajectories $\td$ and a budget $\budget$, find a set of billboards ...
Optimizing Impression Counts for Outdoor Advertising
KDD '19: Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data MiningIn 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 ...
Temporally enhanced network-constrained (TENC) R-tree
MobiGIS '16: Proceedings of the 5th ACM SIGSPATIAL International Workshop on Mobile Geographic Information SystemsThis paper describes a new Network-constrained Moving objects indexing structure, which extends the state-of-the-art for this kind of data. The indexing structure we propose is called Temporally Enhanced Network-Constrained R-tree (TENC R-tree), which ...
Comments