ICGST- AIML Journal

AIML Volume 06 - Issue (II) ICGST

Mining Generalized Customer Profiles

Fatma E. Giha1 Y.P. Singh2 H.T. Ewe3
1 Computer Science Department, Computer Man College P.O. Box 10553, Khartoum, Sudan
2 CDAC (Center For Development of Advanced Computing ),Anusandhan Bhawan,C-56/1, Institutional Area ,Sector-62, Noida – 201307, India.
3 Faculty of Information TechnologyMultimedia University Jalan Multimedia, 63100, Cyberjaya, Selangor, Malaysia
 

Abstract:

Modeling the customer behavior becomes a key issue in customer retention, direct marketing and product promotion. Many data mining techniques have been designed to address the problem of capturing the true behavior of customers for various businesses applications, in which the data can be represented in form of demographic and transactional datasets. In this paper, we propose to use association rules mining technique for modeling customer behavior in form of constructing generalized profile association rules.Our proposed scheme based on transactional databases that consist of demographic data (i.e.,personal information), and transactional data where items bought in a customer transaction can come from any level of hierarchy/ taxonomy representation (i.e., computer is-a Hardware). The constructed profiles can be used for segmenting the customers into groups, and identifying the potential ones for targeted marketing and Customer retention. We implement pruning techniques and interestingness measures to select the relevant and interesting rules for profiling process. Experimental results on a synthetic dataset are provided to show the effectiveness of the proposed scheme for generalizedcustomer profiling.

Keywords:Generalized customer profiles,association rules mining, customer modeling

(Full Paper 466KB)

BibTex:

@ARTICLE{P1120615112,

 AUTHOR = {Fatma E. Giha and Y.P. Singh and H.T. Ewe},

TITLE = {Mining Generalized Customer Profiles},

JOURNAL =  {The International Journal of Artificial Intelligence and Machine Learning},

YEAR = {2006},

VOLUME = {6},

ISSUE ={2},

PAGES={71--77}

}

(Full Paper 466KB)