arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2601.14737cs.DB
收藏

基于轨迹的多产品影响最大化在Billboard广告中的应用

Trajectory-Driven Multi-Product Influence Maximization in Billboard Advertising

Indian Institute of Technology Jammu(詹穆印度理工学院);Gandhi Institute for Technological Advancement(甘地技术进步学院)

Dildar Ali, Suman Banerjee, Rajibul Islam

AI总结:

本文研究了基于轨迹的多产品影响最大化问题,提出两种变种的解决方法,包括多子模覆盖问题和不相交插槽变种的近似算法。

摘要:

Billboard广告作为一种有效的户外广告技术已经出现,其目标是选择有限数量的插槽并在其中播放广告内容,希望被许多人看到,并且有效地,其中许多人会被影响向品牌。给定一个轨迹和一个billboard数据库以及一个正整数k,我们如何选择k个具有高度影响力的插槽以最大化影响?在本文中,我们研究了一个该问题的变种,其中一家商业公司希望推广多个产品,并且每个产品都有一定的影响需求。我们研究了该问题的两个变种。在第一个变种中,我们的目标是选择k个插槽,使得每个产品的相应影响需求得到满足。在另一个变种中,我们给定ℓ个整数k₁,k₂,…,kₗ,目标是寻找ℓ组插槽S₁,S₂,…,Sₗ,使得对于所有i∈[ℓ],|S_i|≤k_i,并且对于所有i≠j,S_i∩S_j=∅,并且每个产品的影响力需求得到满足。我们将第一个变种的问题建模为一个多子模覆盖问题,将第二个变种作为其一般化。为了解决共同插槽变种,我们将问题建模为一个多子模覆盖问题,并设计基于连续贪心框架和随机取整的双标准近似算法。对于不相交插槽变种,我们提出了一种基于采样的近似方法以及一个高效的对偶贪心算法,该算法自然地强制不相交性。对真实世界轨迹和billboard数据集的大量实验突显了所提出解决方案方法的有效性和效率。

英文摘要:

Billboard Advertising has emerged as an effective out-of-home advertising technique, where the goal is to select a limited number of slots and play advertisement content there, with the hope that it 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. To solve the common-slot variant, we formulate the problem as a multi-submodular cover problem and design a bi-criteria approximation algorithm based on the continuous greedy framework and randomized rounding. For the disjoint-slot variant, we proposed a sampling-based approximation approach along with an efficient primal-dual greedy algorithm that enforces disjointness naturally. Extensive experiments with real-world trajectory and billboard datasets highlight the effectiveness and efficiency of the proposed solution approaches.

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

↑