Large-scale targeted marketing by supervised pagerank with seeds

0Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In targeted marketing, the key is to spend the limited resources on as relevant a group of customers as possible to the campaign objective. We consider the business problem of selecting a group of standard/non-premier service customers and new customers to whom promotional means, e.g. issuing discount coupons are directed, with the goal of upgrading them to core premier service users. We develop a solution framework based on utilizing the anonymized interaction of user activities, within which the users are scored by their relevance to the marketing campaign objective. The links between two users are weighted, with the weights learnt in a supervised setting to ensure high relevance to the score prediction task. We modified a seeded variant of the PageRank algorithm to adept to this framework while maintaining convergence property. We demonstrate through real-world data that our framework can significantly improve the prediction relevance over conventional methods with regard to the marketing problem under consideration.

Cite

CITATION STYLE

APA

Qin, Z. (Tony), Zhuo, C., Tan, W., Xie, J., & Ye, J. (2018). Large-scale targeted marketing by supervised pagerank with seeds. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10935 LNAI, pp. 409–424). Springer Verlag. https://doi.org/10.1007/978-3-319-96133-0_31

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free