doi: 10.4304/jsw.9.6.1359-1366
A New Customer Segmentation Framework Based on Biclustering Analysis
2NIT, ZheJiang University, Hanzhou, P.R.China
3Industrial Center, Shenzhen Polytechnic, Shenzhen , Guangdong, China
Abstract—The paper presents a novel approach for customer segmentation which is the basic issue for an effective CRM ( Customer Relationship Management ). Firstly, the chi-square statistical analysis is applied to choose set of attributes and K-means algorithm is employed to quantize the value of each attribute. Then DBSCAN algorithm based on density is introduced to classify the customers into three groups (the first, the second and the third class). Finally biclustering based on improved Apriori algorithm is used in the three groups to obtain more detailed information. Experimental results on the dataset of an airline company show that the biclustering could segment the customers more accurately and meticulously. Compared with the traditional customer segmentation method, the framework described is more efficient on the dataset.
Index Terms—Customer segmentation, biclustering, Kmeans, Chi-square statistics, DBSCAN, Apriori
Cite: Xiaohui Hu, Haolan Zhang , Xiaosheng Wu, Jianlin Chen, Yu Xiao, Yun Xue , Tiechen Li, Hongya Zhao, "A New Customer Segmentation Framework Based on Biclustering Analysis," Journal of Software vol. 9, no. 6, pp. 1359-1366, 2014.
General Information
ISSN: 1796-217X (Online)
Abbreviated Title: J. Softw.
Frequency: Quarterly
APC: 500USD
DOI: 10.17706/JSW
Editor-in-Chief: Prof. Antanas Verikas
Executive Editor: Ms. Cecilia Xie
Abstracting/ Indexing: DBLP, EBSCO,
CNKI, Google Scholar, ProQuest,
INSPEC(IET), ULRICH's Periodicals
Directory, WorldCat, etcE-mail: jsweditorialoffice@gmail.com
-
Jun 12, 2024 News!
Vol 19, No 2 has been published with online version [Click]
-
Jan 04, 2024 News!
JSW will adopt Article-by-Article Work Flow
-
Apr 01, 2024 News!
Vol 14, No 4- Vol 14, No 12 has been indexed by IET-(Inspec) [Click]
-
Apr 01, 2024 News!
Papers published in JSW Vol 18, No 1- Vol 18, No 6 have been indexed by DBLP [Click]
-
Mar 01, 2024 News!
Vol 19, No 1 has been published with online version [Click]