Influential Slot and Tag Selection in Billboard Advertisement (2401.10601v2)
Abstract: The selection of influential billboard slots remains an important problem in billboard advertisements. Existing studies on this problem have not considered the case of context-specific influence probability. To bridge this gap, in this paper, we introduce the Context Dependent Influential Billboard Slot Selection Problem. First, we show that the problem is NP-hard. We also show that the influence function holds the bi-monotonicity, bi-submodularity, and non-negativity properties. We propose an orthant-wise Stochastic Greedy approach to solve this problem. We show that this method leads to a constant-factor approximation guarantee. Subsequently, we propose an orthant-wise Incremental and Lazy Greedy approach. In a generic sense, this is a method for maximizing a bi-submodular function under the cardinality constraint, which may also be of independent interest. We analyze the performance guarantee of this algorithm as well as time and space complexity. The proposed solution approaches have been implemented with real-world billboard and trajectory datasets. We compare the performance of our method with several baseline methods, and the results are reported. Our proposed orthant-wise stochastic greedy approach leads to significant results when the parameters are set properly with reasonable computational overhead.
- Influential Billboard Slot Selection Using Pruned Submodularity Graph. In Advanced Data Mining and Applications, Weitong Chen, Lina Yao, Taotao Cai, Shirui Pan, Tao Shen, and Xue Li (Eds.). Springer Nature Switzerland, Cham, 216–230.
- Influential Billboard Slot Selection using Spatial Clustering and Pruned Submodularity Graph. arXiv:2305.08949 [cs.DB]
- Suman Banerjee and Bithika Pal. 2022. Budgeted influence and earned benefit maximization with tags in social networks. Social Network Analysis and Mining 12, 1 (2022), 21.
- Budgeted influence maximization with tags in social networks. In Web Information Systems Engineering–WISE 2020: 21st International Conference, Amsterdam, The Netherlands, October 20–24, 2020, Proceedings, Part I 21. Springer, 141–152.
- Influence Maximization in Trajectory Databases. IEEE Transactions on Knowledge and Data Engineering 29, 3 (2017), 627–641. https://doi.org/10.1109/TKDE.2016.2621038
- Finding Seeds and Relevant Tags Jointly: For Targeted Influence Maximization in Social Networks. In Proceedings of the 2018 International Conference on Management of Data, SIGMOD Conference 2018, Houston, TX, USA, June 10-15, 2018, Gautam Das, Christopher M. Jermaine, and Philip A. Bernstein (Eds.). ACM, 1097–1111. https://doi.org/10.1145/3183713.3199670
- The budgeted maximum coverage problem. Inform. Process. Lett. 70, 1 (1999), 39–45. https://doi.org/10.1016/S0020-0190(99)00031-9
- Efficient Location-Aware Influence Maximization. In Proceedings of the 2014 ACM SIGMOD International Conference on Management of Data (Snowbird, Utah, USA) (SIGMOD ’14). Association for Computing Machinery, New York, NY, USA, 87–98. https://doi.org/10.1145/2588555.2588561
- SmartAdP: Visual Analytics of Large-scale Taxi Trajectories for Selecting Billboard Locations. IEEE Transactions on Visualization and Computer Graphics 23, 1 (2017), 1–10. https://doi.org/10.1109/TVCG.2016.2598432
- Top-k competitive location selection over moving objects. Data Science and Engineering 6, 4 (2021), 392–401.
- Tips: mining top-k locations to minimize user-inconvenience for trajectory-aware services. IEEE Transactions on Knowledge and Data Engineering 33, 3 (2019), 1238–1250.
- TAILOR: time-aware facility location recommendation based on massive trajectories. Knowledge and Information Systems 62, 9 (2020), 3783–3810.
- Atharva Tekawade and Suman Banerjee. 2023. Influence Maximization with Tag Revisited: Exploiting the Bi-submodularity of the Tag-Based Influence Function. In International Conference on Advanced Data Mining and Applications. Springer, 772–786.
- Data-Driven Targeted Advertising Recommendation System for Outdoor Billboard. ACM Trans. Intell. Syst. Technol. 13, 2, Article 29 (jan 2022), 23 pages. https://doi.org/10.1145/3495159
- Efficiently Targeted Billboard Advertising Using Crowdsensing Vehicle Trajectory Data. IEEE Transactions on Industrial Informatics 16, 2 (2020), 1058–1066. https://doi.org/10.1109/TII.2019.2891258
- Pinocchio: Probabilistic influence-based location selection over moving objects. IEEE Transactions on Knowledge and Data Engineering 28, 11 (2016), 3068–3082.
- A survey on trajectory data management, analytics, and learning. ACM Computing Surveys (CSUR) 54, 2 (2021), 1–36.
- Reverse k Nearest Neighbor Search over Trajectories (Extended Abstract). In 2018 IEEE 34th International Conference on Data Engineering (ICDE). 1785–1786. https://doi.org/10.1109/ICDE.2018.00250
- Efficient Method for Maximizing Bichromatic Reverse Nearest Neighbor. Proc. VLDB Endow. 2, 1 (aug 2009), 1126–1137. https://doi.org/10.14778/1687627.1687754
- On Computing Top-t Most Influential Spatial Sites. In Proceedings of the 31st International Conference on Very Large Data Bases (Trondheim, Norway) (VLDB ’05). VLDB Endowment, 946–957.
- Modeling User Activity Preference by Leveraging User Spatial Temporal Characteristics in LBSNs. IEEE Transactions on Systems, Man, and Cybernetics: Systems 45, 1 (2015), 129–142.
- Towards an Optimal Outdoor Advertising Placement: When a Budget Constraint Meets Moving Trajectories. ACM Trans. Knowl. Discov. Data 14, 5, Article 51 (jul 2020), 32 pages. https://doi.org/10.1145/3350488
- Optimizing Impression Counts for Outdoor Advertising. In Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining (Anchorage, AK, USA) (KDD ’19). Association for Computing Machinery, New York, NY, USA, 1205–1215. https://doi.org/10.1145/3292500.3330829
- MaxFirst for MaxBRkNN. In 2011 IEEE 27th International Conference on Data Engineering. 828–839. https://doi.org/10.1109/ICDE.2011.5767892