A Framework for Segmenting Customers Based on Probability Density of Transaction Data

Segmenting customers based on transaction data contributes to better understanding and characterizing customers, and has drawn a great deal of attention in literature of various fields. Data mining literature has provided various clustering algorithms for customer segmentation, and distance measure plays an important role in many approaches. However, most distance measures are based on co-occurrence of items, and pay few attention to the sales volume or quantities of items in transactions. In this paper, the probability density of items is employed to gather the description information of transactions and calculate the distance between transactions. Based on distinguishing the difference between similarity measures for transactions and customers, set distance is employed to evaluate the similarity between customers. The whole process is introduced as a framework to reach the target of segmenting customers.

[1]  Ali Amiri.  Customer-oriented catalog segmentation: Effective solution approaches , 2006, Decis. Support Syst..

[2]  Ming-Syan Chen,et al.  Clustering item data sets with association-taxonomy similarity , 2003, Third IEEE International Conference on Data Mining.

[3]  Das Amrita,et al.  Mining Association Rules between Sets of Items in Large Databases , 2013 .

[4]  Yen-Liang Chen,et al.  Market basket analysis in a multiple store environment , 2005, Decis. Support Syst..

[5]  Heikki Mannila,et al.  Context-Based Similarity Measures for Categorical Databases , 2000, PKDD.

[6]  Ke Wang,et al.  Clustering transactions using large items , 1999, CIKM '99.

[7]  Fang-Ming Hsu,et al.  Segmenting customers by transaction data with concept hierarchy , 2012, Expert Syst. Appl..

[8]  Rong Ge,et al.  A microeconomic data mining problem: customer-oriented catalog segmentation , 2004, KDD.

[9]  Ping Yu Hsu,et al.  Clustering Transactions with an Unbalanced Hierarchical Product Structure , 2007, DaWaK.

[10]  Narayan C. Debnath,et al.  Clustering Customer Transactions: A Rough Set Based Approach , 2009, CAINE.

[11]  Ramakrishnan Srikant,et al.  Mining sequential patterns , 1995, Proceedings of the Eleventh International Conference on Data Engineering.

[12]  Jon M. Kleinberg,et al.  A Microeconomic View of Data Mining , 1998, Data Mining and Knowledge Discovery.

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

[14]  Philip S. Yu,et al.  Finding Localized Associations in Market Basket Data , 2002, IEEE Trans. Knowl. Data Eng..

[15]  哲也 古川.  Measuring the Distances between Label Sets under Various Conditions , 2011 .

[16]  Heikki Mannila,et al.  Distance measures for point sets and their computation , 1997, Acta Informatica.

[17]  Li Xiu,et al.  Application of data mining techniques in customer relationship management: A literature review and classification , 2009, Expert Syst. Appl..

[18]  AgrawalRakesh,et al.  Mining association rules between sets of items in large databases , 1993 .

[19]  Yue-Shi Lee,et al.  An efficient data mining approach for discovering interesting knowledge from customer transactions , 2006, Expert Syst. Appl..