Learning from Double Positive and Unlabeled Data for Potential-Customer Identification
Masahiro Kato, Yuki Ikeda, Kentaro Baba, Takashi Imai, Ryo Inokuchi

TL;DR
This paper introduces a novel double PU learning method to identify potential customers by focusing on interested individuals without strong loyalty, enhancing targeted marketing efficiency.
Contribution
It proposes a new double PU learning algorithm that combines two loss functions for better potential customer identification from limited data.
Findings
The algorithm effectively distinguishes interested but non-loyal customers.
Numerical experiments confirm the method's validity and practical applicability.
Abstract
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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsImbalanced Data Classification Techniques · Advanced Statistical Methods and Models · Data Mining Algorithms and Applications
