首页> 外文会议>International conference on very large data bases >Show Me the Money: Dynamic Recommendations for Revenue Maximization
【24h】

Show Me the Money: Dynamic Recommendations for Revenue Maximization

机译:告诉我钱:最大化收入的动态建议

获取原文

摘要

Recommender Systems (RS) play a vital role in applications such as e-commerce and on-demand content streaming. Research on RS has mainly focused on the customer perspective, i.e., accurate prediction of user preferences and maximization of user utilities. As a result, most existing techniques are not explicitly built for revenue maximization, the primary business goal of enterprises. In this work, we explore and exploit a novel connection between RS and the profitability of a business. As recommendations can be seen as an information channel between a business and its customers, it is interesting and important to investigate how to make strategic dynamic recommendations leading to maximum possible revenue. To this end, we propose a novel revenue model that takes into account a variety of factors including prices, valuations, saturation effects, and competition amongst products. Under this model, we study the problem of finding revenue-maximizing recommendation strategies over a finite time horizon. We show that this problem is NP-hard, but approximation guarantees can be obtained for a slightly relaxed version, by establishing an elegant connection to matroid theory. Given the prohibitively high complexity of the approximation algorithm, we also design intelligent heuristics for the original problem. Finally, we conduct extensive experiments on two real and synthetic datasets and demonstrate the efficiency, scalability, and effectiveness our algorithms, and that they significantly outperform several intuitive baselines.
机译:推荐系统(RS)在电子商务和点播内容流等应用程序中起着至关重要的作用。 RS的研究主要集中在客户的角度,即准确预测用户偏好和最大化用户效用。结果,大多数现有技术并未明确建立以实现收入最大化(企业的主要业务目标)。在这项工作中,我们探索并开发了RS与企业盈利能力之间的新型联系。由于建议可以看作是企业与其客户之间的信息渠道,因此研究如何提出战略性动态建议以实现最大的收益是非常有趣且重要的。为此,我们提出了一种新颖的收入模型,该模型考虑了各种因素,包括价格,估值,饱和效应以及产品之间的竞争。在这种模型下,我们研究了在有限的时间范围内寻找收益最大化的推荐策略的问题。我们证明了这个问题是NP难的,但是通过建立与拟阵理论的优雅联系,可以为稍微放松的版本获得近似保证。鉴于逼近算法的复杂度过高,我们还针对原始问题设计了智能启发式算法。最后,我们在两个真实的和合成的数据集上进行了广泛的实验,并证明了我们算法的效率,可扩展性和有效性,并且它们明显优于几个直观的基准。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号