区域影响力约束下的有影响力的广告牌槽位选择
Influential Billboard Slot Selection under Zonal Influence Constraint
AI总结:
本文提出在区域影响力约束下选择广告牌槽位以最大化影响力,采用贪心法和带边界估计的分支定界框架,实验证明其更有效且计算开销合理。
摘要:
给定广告牌和轨迹数据库,在广告牌广告的背景下,寻找有限数量的广告牌槽位以最大化影响力是一个重要问题。现有文献大多关注有影响力的槽位选择问题,而未考虑任何特定的区域影响力约束。为弥补这一空白,本文引入并研究了区域影响力约束下的有影响力的广告牌槽位选择问题。我们提出了一种简单的贪心方法来解决该问题。尽管该方法易于理解且实现简单,但由于边际增益计算次数过多,该方法不可扩展。我们设计了一个分支定界框架,包含两种边界估计技术,将问题划分为不同区域,并整合各区域的解决方案以获得整体解决方案。我们使用真实的广告牌和轨迹数据集实现了这两种解决方案方法,并报告了多项实验结果。我们将所提出的解决方案方法与几种基线方法进行了性能比较。结果表明,与基线方法相比,所提出的方法在合理的计算开销下能产生更有效的解决方案。
英文摘要:
Given billboard and trajectory database, finding a limited number of billboard slots for maximizing the influence is an important problem in the context of billboard advertisement. Most of the existing literature focused on the influential slot selection problem without considering any specific zonal influence constraint. To bridge this gap in this paper, we introduce and study the Influential Billboard Slot Selection Problem Under Zonal Influence Constraint. We propose a simple greedy approach to solve this problem. Though this method is easy to understand and simple to implement due to the excessive number of marginal gain computations, this method is not scalable. We design a branch and bound framework with two bound estimation techniques that divide the problem into different zones and integrate the zone-specific solutions to obtain a solution for the whole. We implement both the solution methodologies with real-world billboard and trajectory datasets and several experiments have been reported. We compare the performance of the proposed solution approaches with several baseline methods. The results show that the proposed approaches lead to more effective solutions with reasonable computational overhead than the baseline methods.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。