首页> 外文会议>International Conference on Advanced Cloud and Big Data >Near Optimal Mobile Advertisement User Selection with Interested Area Coverage
【24h】

Near Optimal Mobile Advertisement User Selection with Interested Area Coverage

机译:近最优移动广告用户选择具有感兴趣的面积覆盖范围

获取原文

摘要

Mobile advertisement distribution effects are vitally important for advertisers as well as users. Status quo studies are lacking of efficient distribution especially when user traces and budgets are involved. In achieving efficient and effective mobile advertisement applications, this work advocates the concept of location-centric mobile crowdsourcing network instead of conventional user-centric and platform, where locations are vitally important for advertisement distribution. To this end, this work focuses on the mobile advertisement user selection problem when interested area coverage (IAC) is considered. Unfortunately, developing location-centric needs to deal with the spatio-temporal features in each user, and IAC coverage needs to be effectively counted. Even worse, budget constraint makes this problem intractable. In tackling aforementioned challenges, this work makes following efforts: First, a budget-constrained user selection problem is formulated when location sensitive mobile advertisement applications are considered, which is proved to be NP-hard. Second, the submodularity feature is explored, and a simple but efficient heuristic algorithm is presented with guaranteed approximation ratio (1-1/e). Finally, extensive simulation results show that, our scheme could effectively improve the propagation effects for mobile advertisement with 125%.
机译:移动广告分发效果对广告商以及用户来说都很重要。特征在涉及用户痕迹和预算时,缺乏高效分布的现状。在实现高效且有效的移动广告应用中,这项工作倡导了所在地位的移动众包网络的概念,而不是传统的用户中心和平台,其中位置对广告分布非常重要。为此,当考虑感兴趣的区域覆盖(IAC)时,这项工作侧重于移动广告用户选择问题。不幸的是,开发以所在地质为中心的需要处理每个用户中的时空特征,并且需要有效地计算IAC覆盖率。更糟糕的是,预算约束使得这个问题难以解决。在解决上述挑战时,这项工作进行了努力:首先,当考虑定位敏感移动广告应用程序时,将制定预算约束的用户选择问题,这被证明是NP-HARD。其次,探索了子骨科功能,并且具有保证近似比(1-1 / e)的简单但高效的启发式算法。最后,广泛的仿真结果表明,我们的计划可以有效地提高移动广告的传播效果,125%。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号