An Effective Tag Assignment Approach for Billboard Advertisement
<|reference_start|>An Effective Tag Assignment Approach for Billboard Advertisement: 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.<|reference_end|>
@article{ali2024an,
    title={An Effective Tag Assignment Approach for Billboard Advertisement},
    author={Dildar Ali, Harishchandra Kumar, Suman Banerjee, Yamuna Prasad},
    journal={arXiv preprint arXiv:2409.02455},
    year={2024},
    archivePrefix={arXiv},
    eprint={2409.02455},
    primaryClass={cs.DS cs.IR}
}