网格和密度的聚类算法在CRM中的应用.pdfVIP

第36 卷 第6 期 电 子 科 技 大 学 学 报 Vol.36 No.6 2007 年12 月 Journal of University of Electronic Science and Technology of China Dec. 2007 网格和密度的聚类算法在CRM 中的应用 朵春红，王翠茹 (华北电力大学计算机学院 河北 保定 071003) 【摘要】聚类分析是数据挖掘领域中一种非常有用的技术，它用于从大量数据中寻找隐含的数据分布模式，主要有分割 法、层次法、密度法、网格法和模型法等。该文主要讨论数据挖掘中一种基于密度和网格的聚类分析算法及其在客户关系管 理中的应用。该算法具有较高的聚类效率而且容易实现，可以发现任意形状的聚类，时间复杂度低，聚类精度高，适用于数 据的批量更新。该文还提出增量式聚类技术，它不仅能够利用前期聚类的结果，充分提高聚类分析的效率，而且可以降低维 护知识库所带来的巨大开销。实验证明了算法的有效性。 关 键 词 聚类分析; 客户关系管理; 数据挖掘; 密度; 网格 中图分类号 TP311.13 文献标识码 A Application of a Clustering Algorithm Based on Density and Grid in CRM DUO Chun-hong ，WANG Cui-ru (Institute of Computer, North China Electric Power University Baoding Hebei 071003) Abstract Clustering analysis is a very useful tool in the domain of data mining for searching distributing mode from a great deal of data. Its main algorithms are partition-based algorithm, hierarchy-based algorithm, density-based algorithm, grid-based algorithm, and model-based algorithm. The paper mainly discusses a clustering algorithm based on density and grid in data mining, which has high clustering efficiency and low time complexity. It is efficient and effective for multi-density and uniformity density data sets with noise and suitable for batch update. After that an incremental clustering technique is presented. This technique not only makes best use of the former clustering results and improves the efficiency of clustering analysis, but also brings to the reduction of enormous expenditure on knowledge base maintenance. At last an application of the algorithm in Customer Relations