Abstract
Billboard Advertisement has gained popularity due to its significant outrage in return on investment. To make this advertisement approach more effective, the relevant information about the product needs to be reached to the relevant set of people. This can be achieved if the relevant set of tags can be mapped to the correct slots. Formally, we call this problem the Tag Assignment Problem in Billboard Advertisement. Given trajectory, billboard database, and a set of selected billboard slots and tags, this problem asks to output a mapping of selected tags to the selected slots so that the influence is maximized. We model this as a variant of traditional bipartite matching called One-To-Many Bipartite Matching (OMBM). Unlike traditional bipartite matching, a tag can be assigned to only one slot; in the OMBM, a tag can be assigned to multiple slots while the vice versa can not happen. We propose an iterative solution approach that incrementally allocates the tags to the slots. The proposed methodology has been explained with an illustrated example. A complexity analysis of the proposed solution approach has also been conducted. The experimental results on real-world trajectory and billboard datasets prove our claim on the effectiveness and efficiency of the proposed solution.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
Notes
- 1.
- 2.
- 3.
Here, we assume that \(\varDelta \) perfectly divides \(T_2-T_1\).
- 4.
- 5.
- 6.
References
Ali, D., Banerjee, S., Prasad, Y.: Influential billboard slot selection using pruned submodularity graph. In: Chen, W., Yao, L., Cai, T., Pan, S., Shen, T., Li, X. (eds.) ADMA 2022. LNCS, vol. 13725, pp. 216–230. Springer, Cham (2022). https://doi.org/10.1007/978-3-031-22064-7_17
Ali, D., Banerjee, S., Prasad, Y.: Influential billboard slot selection using spatial clustering and pruned submodularity graph. arXiv preprint arXiv:2305.08949 (2023)
Ali, D., Gupta, T., Banerjee, S., Prasad, Y.: Influential slot and tag selection in billboard advertisement. arXiv preprint arXiv:2401.10601 (2024)
Banerjee, S., Pal, B.: Budgeted influence and earned benefit maximization with tags in social networks. Soc. Netw. Anal. Min. 12(1), 21 (2022)
Dutta, A., Asaithambi, A.: One-to-many bipartite matching based coalition formation for multi-robot task allocation. In: 2019 International Conference on Robotics and Automation (ICRA), pp. 2181–2187. IEEE (2019)
Hall, P.: On representatives of subsets. J. Lond. Math. Soc. s1-10(1), 26–30 (1935)
Ke, X., Khan, A., Cong, G.: Finding seeds and relevant tags jointly: for targeted influence maximization in social networks. In: Proceedings of the 2018 International Conference on Management of Data, pp. 1097–1111 (2018)
Kuhn, H.W.: The Hungarian method for the assignment problem. Naval Res. Logist. (NRL) 52(1), 7–21 (2005)
Preis, R.: Linear time 1/2-approximation algorithm for maximum weighted matching in general graphs. In: Meinel, C., Tison, S. (eds.) STACS 1999. LNCS, vol. 1563, pp. 259–269. Springer, Heidelberg (1999). https://doi.org/10.1007/3-540-49116-3_24
Tekawade, A., Banerjee, S.: Influence maximization with tag revisited: exploiting the bi-submodularity of the tag-based influence function. In: Yang, X., et al. (eds.) ADMA 2023. LNCS, vol. 14176, pp. 772–786. Springer, Cham (2023). https://doi.org/10.1007/978-3-031-46661-8_51
Yang, D., Zhang, D., Zheng, V.W., Yu, Z.: Modeling user activity preference by leveraging user spatial temporal characteristics in LBSNs. IEEE Trans. Syst. Man Cybern. Syst. 45(1), 129–142 (2015)
Zhang, P., Bao, Z., Li, Y., Li, G., Zhang, Y., Peng, Z.: Towards an optimal outdoor advertising placement: when a budget constraint meets moving trajectories. ACM Trans. Knowl. Discov. Data (TKDD) 14(5), 1–32 (2020)
Zhang, Y., Li, Y., Bao, Z., Mo, S., Zhang, P.: Optimizing impression counts for outdoor advertising. In: Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Anchorage, Alaska, pp. 4–8 (2019)
Zhang, Y., Li, Y., Bao, Z., Zheng, B., Jagadish, H.: Minimizing the regret of an influence provider. In: Proceedings of the 2021 International Conference on Management of Data, pp. 2115–2127 (2021)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2025 The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Ali, D., Kumar, H., Banerjee, S., Prasad, Y. (2025). An Effective Tag Assignment Approach for Billboard Advertisement. In: Barhamgi, M., Wang, H., Wang, X. (eds) Web Information Systems Engineering – WISE 2024. WISE 2024. Lecture Notes in Computer Science, vol 15436. Springer, Singapore. https://doi.org/10.1007/978-981-96-0579-8_12
Download citation
DOI: https://doi.org/10.1007/978-981-96-0579-8_12
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-96-0578-1
Online ISBN: 978-981-96-0579-8
eBook Packages: Computer ScienceComputer Science (R0)