arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2510.09050cs.DScs.DB
收藏

多产品影响力最大化在广告牌广告中的应用

Multi-product Influence Maximization in Billboard Advertisement

Indian Institute of Technology Jammu(印度技术研究所斋浦尔分校);Gandhi Institute for Technological Advancement(甘地技术进步研究所)

Dildar Ali, Rajibul Islam, Suman Banerjee

AI总结:

针对广告牌广告中的多产品影响力最大化问题,提出两种变体模型,分别采用双准则近似算法和基于采样的近似算法,实验验证了其有效性和效率。

摘要:

广告牌广告已成为一种有效的户外广告技术,其目标是选择有限数量的广告位并播放广告内容,希望这些内容能被许多人看到,并有效地使其中相当数量的人受到品牌影响。给定一条轨迹、一个广告牌数据库和一个正整数$k$,我们如何选择$k$个高影响力的广告位以最大化影响力?在本文中,我们研究了该问题的一个变体,其中一家商业公司希望推广多种产品,并且每种产品都有影响力需求。我们研究了该问题的两个变体。在第一个变体中,我们的目标是选择$k$个广告位,使得每种产品的相应影响力需求得到满足。在问题的另一个变体中,给定$\n\ell$个整数$k_1,k_2, \ldots, k_{\ell}$,目标是寻找$\ell$组广告位$S_1, S_2, \ldots, S_{\ell}$,使得对于所有$i \in [\ell]$,$|S_{i}| \leq k_i$,并且对于所有$i \neq j$,$S_i \cap S_j=\emptyset$,且每种产品的影响力需求得到满足。我们将第一个变体建模为多子模覆盖问题,将第二个变体建模为其推广。为解决第一个变体,我们采用了双准则近似算法;对于另一个变体,我们提出了一种基于采样的近似算法。使用真实世界轨迹和广告牌数据集进行的大量实验突出了所提出解决方案的有效性和效率。

英文摘要:

Billboard Advertisement has emerged as an effective out-of-home advertisement technique where the goal is to select a limited number of slots and play advertisement content over there with the hope that this will be observed by many people, and effectively, a significant number of them will be influenced towards the brand. Given a trajectory and a billboard database and a positive integer $k$, how can we select $k$ highly influential slots to maximize influence? In this paper, we study a variant of this problem where a commercial house wants to make a promotion of multiple products, and there is an influence demand for each product. We have studied two variants of the problem. In the first variant, our goal is to select $k$ slots such that the respective influence demand of each product is satisfied. In the other variant of the problem, we are given with $\ell$ integers $k_1,k_2, \ldots, k_{\ell}$, the goal here is to search for $\ell$ many set of slots $S_1, S_2, \ldots, S_{\ell}$ such that for all $i \in [\ell]$, $|S_{i}| \leq k_i$ and for all $i \neq j$, $S_i \cap S_j=\emptyset$ and the influence demand of each of the products gets satisfied. We model the first variant of the problem as a multi-submodular cover problem and the second variant as its generalization. For solving the first variant, we adopt the bi-criteria approximation algorithm, and for the other variant, we propose a sampling-based approximation algorithm. Extensive experiments with real-world trajectory and billboard datasets highlight the effectiveness and efficiency of the proposed solution approach.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑