基于区间值数据动态聚类算法的客户市场细分  

CLIENT MARKET SEGMENTATION BASED ON THE DYNAMIC CLUSTERING ALGORITHM OF INTERVAL DATA

作　　者：蒋宁[1] 吴春旭[1] 

机构地区：[1]中国科学技术大学管理学院,安徽合肥230026

出　　处：《计算机应用与软件》2007年第12期116-118,共3页Computer Applications and Software

摘　　要：K均值算法(K-means)目前较为成功地应用于客户市场细分,但随着市场规模的扩大,面临着对于初始类个数敏感,易陷入局部极小值的严重问题,制约了聚类效果。提出基于区间值数据,以自适应欧氏距离作为度量的动态聚类方法,将客户的多维属性和基因算法结合提高类初始化质量,自适应地调整聚类数,并通过实验测试表现出较好的性能。Although being successfully applied to the field of client market segmentation currently, as a result of the enlargement of market scale, the algorithm of K-means is confronting the challenges from clustering initialization number as well as local minimum, and thus, the clustering effect is restricted, By combing the multidimensional property of client with genetic algorithm,A dynamic clustering algorithm based on interval data taking adaptive Euclidean distance as measurement is presented. The algorithm can improve the quality of clustering initialization and adjust the number of clustering adaptively ,which has been proved to be effective by tests.

关 键 词：市场细分 动态聚类 数据挖掘 K均值 

分 类 号：TP391.41[自动化与计算机技术—计算机应用技术]