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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsNotes
- 1.
- 2.
Unfortunately, we are unable to make the dataset public for proprietary reasons.
References
Backstrom, L., Leskovec, J.: Supervised random walks: predicting and recommending links in social networks. In: Proceedings of the Fourth ACM International Conference on Web Search and Data Mining, pp. 635–644. ACM (2011)
Bhuiyan, J.: Lyft is on track to turn a profit, but will need to spend more to add riders and drivers as it expands (2016). https://www.recode.net/2017/1/13/14267926/lyft-growth-revenue-losses-profitability-discounts-incentives
Chen, T., Guestrin, C.: XGBoost: a scalable tree boosting system. In: Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 785–794. ACM (2016)
Chen, Y., Pavlov, D., Canny, J.F.: Large-scale behavioral targeting. In: Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 209–218. ACM (2009)
Forbes Corporate Communications: Investing in customer retention leads to significantly increased market share says new study (2016). https://www.forbes.com/sites/forbespr/2016/09/14/investing-in-customer-retention-leads-to-significantly-increased-market-share-says-new-study
Friedman, J.H.: Greedy function approximation: a gradient boosting machine. Ann. Stat. 29, 1189–1232 (2001)
Galar, M., Fernandez, A., Barrenechea, E., Bustince, H., Herrera, F.: A review on ensembles for the class imbalance problem: bagging-, boosting-, and hybrid-based approaches. IEEE Trans. Syst. Man Cybern. Part C (Appl. Rev.) 42(4), 463–484 (2012)
Goldfarb, A., Tucker, C.: Online display advertising: targeting and obtrusiveness. Mark. Sci. 30(3), 389–404 (2011)
Golub, G.H., Van Loan, C.F.: Matrix Computations, vol. 3. Johns Hopkins University Press, Baltimore (2012)
Haveliwala, T.H.: Topic-sensitive PageRank. In: Proceedings of the 11th International Conference on World Wide Web, pp. 517–526. ACM (2002)
Leskovec, J., Adamic, L.A., Huberman, B.A.: The dynamics of viral marketing. ACM Trans. Web 1(1), 5 (2012)
Li, F.H., Li, C.T., Shan, M.K.: Labeled influence maximization in social networks for target marketing. In: 2011 IEEE Third International Conference on Privacy, Security, Risk and Trust and 2011 IEEE Third International Conference on Social Computing, pp. 560–563, October 2011
Meng, X., Bradley, J., Yavuz, B., Sparks, E., Venkataraman, S., Liu, D., Freeman, J., Tsai, D., Amde, M., Owen, S., et al.: MLlib: machine learning in apache spark. J. Mach. Learn. Res. 17(34), 1–7 (2016)
Page, L., Brin, S., Motwani, R., Winograd, T.: The PageRank citation ranking: bringing order to the web. Technical report, Stanford InfoLab (1999)
Weng, J., Lim, E.-P., Jiang, J., He, Q.: Twitterrank: finding topic-sensitive influential twitterers. In: Proceedings of the Third ACM International Conference on Web Search and Data Mining, pp. 261–270. ACM (2010)
Xie, W., Bindel, D., Demers, A., Gehrke, J.: Edge-weighted personalized PageRank: breaking a decade-old performance barrier. In: Proceedings of the 21st ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 1325–1334. ACM (2015)
Xin, R.S., Gonzalez, J.E., Franklin, M.J., Stoica, I.: GraphX: a resilient distributed graph system on spark. In: First International Workshop on Graph Data Management Experiences and Systems, p. 2. ACM (2013)
Xing, W., Ghorbani, A.: Weighted PageRank algorithm. In: 2004 Proceedings of Second Annual Conference on Communication Networks and Services Research, pp. 305–314. IEEE (2004)
Zhang, Y., Wang, Z., Xia, C.: Identifying key users for targeted marketing by mining online social network. In: 2010 IEEE 24th International Conference on Advanced Information Networking and Applications Workshops, pp. 644–649 (2010)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG, part of Springer Nature
About this paper
Cite this paper
Qin, Z.(., Zhuo, C., Tan, W., Xie, J., Ye, J. (2018). Large-Scale Targeted Marketing by Supervised PageRank with Seeds. In: Perner, P. (eds) Machine Learning and Data Mining in Pattern Recognition. MLDM 2018. Lecture Notes in Computer Science(), vol 10935. Springer, Cham. https://doi.org/10.1007/978-3-319-96133-0_31
Download citation
DOI: https://doi.org/10.1007/978-3-319-96133-0_31
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-96132-3
Online ISBN: 978-3-319-96133-0
eBook Packages: Computer ScienceComputer Science (R0)