...
首页> 外文期刊>IEEE Transactions on Knowledge and Data Engineering >Influence Maximization in Trajectory Databases
【24h】

Influence Maximization in Trajectory Databases

机译:轨迹数据库中的影响最大化

获取原文
获取原文并翻译 | 示例
           

摘要

In this paper, we study a novel problem of influence maximization in trajectory databases that is very useful in precise location-aware advertising. It finds k best trajectories to be attached with a given advertisement and maximizes the expected influence among a large group of audience. We show that the problem is NP-hard and propose both exact and approximate solutions to find the best set of trajectories. In the exact solution, we devise an expansion-based framework that enumerates trajectory combinations in a best-first manner and propose three types of upper bound estimation techniques to facilitate early termination. In addition, we propose a novel trajectory index to reduce the influence calculation cost. To support large k , we propose a greedy solution with an approximation ratio of (1 − 1/e), whose performance is further optimized by a new proposed cluster-based method. We also propose a threshold method that can support any approximation ratio ϵ∈(0,1] . In addition, we extend our problem to support the scenario when there are a group of advertisements. In our experiments, we use real datasets to construct user profiles, motion patterns, and trajectory databases. The experimental results verified the efficiency of our proposed methods.
机译:在本文中,我们研究了轨迹数据库中影响力最大化的新问题,该问题在精确的位置感知广告中非常有用。它找到与给定广告关联的k条最佳轨迹,并在大量受众中最大化预期的影响力。我们表明问题是NP难的,并提出了精确和近似的解决方案以找到最佳的轨迹集。在确切的解决方案中,我们设计了一种基于扩展的框架,该框架以最佳优先方式枚举轨迹组合,并提出了三种类型的上限估计技术以促进早期终止。此外,我们提出了一种新颖的轨迹指标来降低影响计算成本。为了支持较大的k,我们提出了一种近似比率为(1-1 / e)的贪婪解,其性能通过新提出的基于聚类的方法得到了进一步优化。我们还提出了一种阈值方法,该方法可以支持任何近似比率ϵ∈(0,1]。此外,我们将问题扩展到支持一组广告的情况,在我们的实验中,我们使用真实的数据集来构建用户轮廓,运动模式和轨迹数据库,实验结果证明了我们提出的方法的有效性。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号