Planning for Marketing Campaigns

In business marketing, corporations and institutions are interested in executing a sequence of marketing actions to affect a group of customers. For example, a financial institution may derive marketing strategies for turning their reluctant customers into active ones and a telecommunications company may plan actions to stop their valuable customers from leaving. These marketing plans are aimed at converting groups of customers from an undesirable class to a desirable one. In this paper, we formulate this group marketing-plan generation problem as a planning problem. We design a novel search algorithm to find a cost-effective and highly probable plan for switching a group of customers from their initial states to some more desirable final states. We explore the tradeoff among time, space and quality of computation in this planning framework. We demonstrate the effectiveness of the methods through empirical results.

[1]  Daniel S. Weld,et al.  Probabilistic Planning with Information Gathering and Contingent Execution , 1994, AIPS.

[2]  Sally Dibb,et al.  The Marketing Planning Workbook , 1996 .

[3]  Charles Elkan,et al.  The Foundations of Cost-Sensitive Learning , 2001, IJCAI.

[4]  Charles X. Ling,et al.  Data Mining for Direct Marketing: Problems and Solutions , 1998, KDD.

[5]  Naoki Abe,et al.  Sequential cost-sensitive decision making with reinforcement learning , 2002, KDD.

[6]  R. L. Keeney,et al.  Decisions with Multiple Objectives: Preferences and Value Trade-Offs , 1977, IEEE Transactions on Systems, Man, and Cybernetics.

[7]  Richard S. Sutton,et al.  Introduction to Reinforcement Learning , 1998 .

[8]  Giuseppe Carenini,et al.  Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence, IJCAI 2001, Seattle, Washington, USA, August 4-10, 2001 , 2001 .

[9]  Catherine Blake,et al.  UCI Repository of machine learning databases , 1998 .

[10]  Qiang Yang,et al.  Mining case bases for action recommendation , 2002, 2002 IEEE International Conference on Data Mining, 2002. Proceedings..

[11]  Richard S. Sutton,et al.  Reinforcement Learning: An Introduction , 1998, IEEE Trans. Neural Networks.

[12]  J. Ross Quinlan,et al.  C4.5: Programs for Machine Learning , 1992 .

[13]  Pedro M. Domingos.  MetaCost: a general method for making classifiers cost-sensitive , 1999, KDD '99.

[14]  Matthew Richardson,et al.  Mining the network value of customers , 2001, KDD '01.