Integration of self-organizing feature maps and genetic-algorithm-based clustering method for market segmentation

被引:22
作者
Kuo, RJ [1 ]
Chang, K
Chien, SY
机构
[1] Natl Taipei Univ Technol, Dept Ind Engn & Management, Taipei 106, Taiwan
[2] Natl Taipei Univ Technol, Ind Prod Syst Engn & Management, Taipei 106, Taiwan
关键词
market segmentation; clustering analysis; genetic algorithms; self-organizing feature maps;
D O I
10.1207/s15327744joce1401_3
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Clustering analysis has been widely applied in the area of market segmentation. Conventional research usually uses the multivariate analysis method. Recently, due to promising results of computational intelligence techniques in engineering, they are also considered for market segmentation. Among them, genetic algorithms (GAs) are theoretically and empirically found to provide globally near-optimal solutions for various complex optimization problems. Because GA is good at searching, it can cluster the data according to their similarities. In addition, artificial neural networks also have high performance in both engineering and management. Hence, this research proposes a novel 2-stage method, which first uses self-organizing feature maps (SCIMs) to determine the number of clusters and then employs a GA-based clustering method to find the final solution (it is defined as S + G in this research). The results of simulated data via a Monte Carlo study show that the proposed method outperforms the other 2 methods: K means, which uses SOM to determine the number of clusters, and SOM followed by K means, based on both within-cluster variations (SSW) and the number of misclassifications. To further verify the proposed approach, a real-world problem, wireless telecommunications industry market segmentation, is employed. The results also show that the proposed method has the lowest SSW among the 3 methods.
引用
收藏
页码:43 / 60
页数:18
相关论文
共 33 条
[21]   AN EXAMINATION OF PROCEDURES FOR DETERMINING THE NUMBER OF CLUSTERS IN A DATA SET [J].
MILLIGAN, GW ;
COOPER, MC .
PSYCHOMETRIKA, 1985, 50 (02) :159-179
[22]   In search of optimal clusters using genetic algorithms [J].
Murthy, CA ;
Chowdhury, N .
PATTERN RECOGNITION LETTERS, 1996, 17 (08) :825-832
[23]   Viewing the Web as a marketplace: the case of small companies [J].
O'Connor, GC ;
O'Keefe, B .
DECISION SUPPORT SYSTEMS, 1997, 21 (03) :171-183
[24]   CLUSTER-ANALYSIS IN MARKETING-RESEARCH - REVIEW AND SUGGESTIONS FOR APPLICATION [J].
PUNJ, G ;
STEWART, DW .
JOURNAL OF MARKETING RESEARCH, 1983, 20 (02) :134-148
[25]   IMPROVING THE EFFICIENCY OF SAMMONS NON-LINEAR MAPPING BY USING CLUSTERING ARCHETYPES [J].
PYKETT, CE .
ELECTRONICS LETTERS, 1978, 14 (25) :799-800
[26]  
*SPSS INC, 1988, SPSS PC PLUS ADV STA
[27]   A genetic approach to the automatic clustering problem [J].
Tseng, LY ;
Yang, SB .
PATTERN RECOGNITION, 2001, 34 (02) :415-424
[28]   Neural networks in business: a survey of applications (1992-1998) [J].
Vellido, A ;
Lisboa, PJG ;
Vaughan, J .
EXPERT SYSTEMS WITH APPLICATIONS, 1999, 17 (01) :51-70
[29]  
Venugopal V., 1994, Journal of Systems Management, V45, P16
[30]   Metric conjoint segmentation methods: A Monte Carlo comparison [J].
Vriens, M ;
Wedel, M ;
Wilms, T .
JOURNAL OF MARKETING RESEARCH, 1996, 33 (01) :73-85