arXiv:2506.00436cs.LGcs.AI2025-06中稿 · publication in the…

通过双正样本与无标签数据,识别有意向但无忠诚度的潜在客户。

Learning from Double Positive and Unlabeled Data for Potential-Customer Identification

  • 设计双PU学习框架,同时捕捉兴趣与低忠诚度特征。
  • 在有限数据下有效提升潜在客户识别准确率。
  • 适合精准营销场景,尤其适用于客户留存优化。

本研究提出一种基于正样本与无标签数据学习(PU learning)的方法,用于目标市场营销中的潜在客户识别。企业仅能观测到购买产品的客户,决策者希望根据用户对公司忠诚度进行有效营销。忠诚用户即使无广告也会持续关注公司,因此更可能购买产品;而低忠诚用户则可能忽略产品或转向其他公司。因此,聚焦于对产品感兴趣但忠诚度低的个体,可实现更高效的营销。为此,我们提出一个单阶段优化算法,其目标函数隐含两个来自标准PU学习的损失项,称为双PU学习。通过数值实验验证了该方法的有效性,结果表明其能正确识别兼具产品兴趣与低忠诚度的潜在客户。

原文摘要 · Abstract (English)

In this study, we propose a method for identifying potential customers in targeted marketing by applying learning from positive and unlabeled data (PU learning). We consider a scenario in which a company sells a product and can observe only the customers who purchased it. Decision-makers seek to market products effectively based on whether people have loyalty to the company. Individuals with loyalty are those who are likely to remain interested in the company even without additional advertising. Consequently, those loyal customers would likely purchase from the company if they are interested in the product. In contrast, people with lower loyalty may overlook the product or buy similar products from other companies unless they receive marketing attention. Therefore, by focusing marketing efforts on individuals who are interested in the product but do not have strong loyalty, we can achieve more efficient marketing. To achieve this goal, we consider how to learn, from limited data, a classifier that identifies potential customers who (i) have interest in the product and (ii) do not have loyalty to the company. Although our algorithm comprises a single-stage optimization, its objective function implicitly contains two losses derived from standard PU learning settings. For this reason, we refer to our approach as double PU learning. We verify the validity of the proposed algorithm through numerical experiments, confirming that it functions appropriately for the problem at hand.

客户识别PU学习精准营销

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。