Dynamic micro-targeting: fitness-based approach to predicting individual preferences

It is crucial to segment customers intelligently in order to offer more targeted and personalized products and services. Traditionally, customer segmentation is achieved using statistics-based methods that compute a set of statistics from the customer data and group customers into segments by applying clustering algorithms. Recent research proposed a direct grouping-based approach that combines customers into segments by optimally combining transactional data of several customers and building a data mining model of customer behavior for each group. This paper proposes a new micro-targeting method that builds predictive models of customer behavior not on the segments of customers but rather on the customer-product groups. This micro-targeting method is more general than the previously considered direct grouping method. We empirically show that it outperforms the direct grouping and statistics-based segmentation methods across multiple experimental conditions and that it generates predominately small-sized segments, thus providing additional support for the micro-targeting approach to personalization.

[1]  Leo Breiman,et al.  Bagging Predictors , 1996, Machine Learning.

[2]  M. Wedel,et al.  Market Segmentation: Conceptual and Methodological Foundations , 1997 .

[3]  Leo Breiman,et al.  Bagging Predictors , 1996, Machine Learning.

[4]  Alfred Taudes,et al.  A dynamic segmentation approach for targeting and customizing direct marketing campaigns , 2006 .

[5]  Thomas Reutterer,et al.  A Combined Approach for Segment-Specific Analysis of Market Basket Data , 2006 .

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

[7]  Tianyi Jiang,et al.  Improving Personalization Solutions through Optimal Segmentation of Customer Bases , 2006, IEEE Transactions on Knowledge and Data Engineering.

[8]  Leo Breiman,et al.  Classification and Regression Trees , 1984 .

[9]  Cevdet Aykanat,et al.  Hypergraph Models and Algorithms for Data-Pattern-Based Clustering , 2004, Data Mining and Knowledge Discovery.

[10]  Ian H. Witten,et al.  Data mining: practical machine learning tools and techniques with Java implementations , 2002, SGMD.

[11]  Jeffrey S. Simonoff,et al.  Tree Induction Vs Logistic Regression: A Learning Curve Analysis , 2001, J. Mach. Learn. Res..

[12]  Friedrich Leisch,et al.  A toolbox for K-centroids cluster analysis , 2006 .

[13]  Ron Kohavi,et al.  Supervised and Unsupervised Discretization of Continuous Features , 1995, ICML.

[14]  Pat Langley,et al.  Estimating Continuous Distributions in Bayesian Classifiers , 1995, UAI.

[15]  Andrew P. Bradley,et al.  The use of the area under the ROC curve in the evaluation of machine learning algorithms , 1997, Pattern Recognit..

[16]  J. Ross Quinlan,et al.  Simplifying Decision Trees , 1987, Int. J. Man Mach. Stud..

[17]  Tianyi Jiang,et al.  Segmenting Customers from Population to Individuals: Does 1-to-1 Keep Your Customers Forever? , 2006, IEEE Transactions on Knowledge and Data Engineering.

[18]  Gediminas Adomavicius,et al.  Personalization technologies , 2005, Commun. ACM.

[19]  Usama M. Fayyad,et al.  Multi-Interval Discretization of Continuous-Valued Attributes for Classification Learning , 1993, IJCAI.

[20]  Balaji Padmanabhan,et al.  Segmenting customer transactions using a pattern-based clustering approach , 2003, Third IEEE International Conference on Data Mining.

[21]  Sudipto Guha,et al.  ROCK: A Robust Clustering Algorithm for Categorical Attributes , 2000, Inf. Syst..

[22]  Naren Ramakrishnan,et al.  Compression, clustering, and pattern discovery in very high-dimensional discrete-attribute data sets , 2005, IEEE Transactions on Knowledge and Data Engineering.

[23]  Peter J. Rousseeuw,et al.  Finding Groups in Data: An Introduction to Cluster Analysis , 1990 .

[24]  Gediminas Adomavicius,et al.  Incorporating contextual information in recommender systems using a multidimensional approach , 2005, TOIS.

[25]  Jim Novo,et al.  Drilling Down: Turning Customer Data into Profits with a Spreadsheet , 2001 .

[26]  David B. Shmoys,et al.  A Best Possible Heuristic for the k-Center Problem , 1985, Math. Oper. Res..

[27]  Geert Wets,et al.  Using Shopping Baskets to Cluster Supermarket Shoppers , 2001 .

[28]  W. J. DeCoursey,et al.  Introduction: Probability and Statistics , 2003 .

[29]  Alexander Tuzhilin,et al.  Personalization in Context: Does Context Matter When Building Personalized Customer Models? , 2006, Sixth International Conference on Data Mining (ICDM'06).

[30]  Brendan J. Frey,et al.  Mixture Modeling by Affinity Propagation , 2005, NIPS.

[31]  Wendell R. Smith Product Differentiation and Market Segmentation as Alternative Marketing Strategies , 1956 .