期刊文献+

网格和密度的聚类算法在CRM中的应用 被引量:3

Application of a Clustering Algorithm Based on Density and Grid in CRM
在线阅读 下载PDF
导出
摘要 聚类分析是数据挖掘领域中一种非常有用的技术,它用于从大量数据中寻找隐含的数据分布模式,主要有分割法、层次法、密度法、网格法和模型法等。该文主要讨论数据挖掘中一种基于密度和网格的聚类分析算法及其在客户关系管理中的应用。该算法具有较高的聚类效率而且容易实现,可以发现任意形状的聚类,时间复杂度低,聚类精度高,适用于数据的批量更新。该文还提出增量式聚类技术,它不仅能够利用前期聚类的结果,充分提高聚类分析的效率,而且可以降低维护知识库所带来的巨大开销。实验证明了算法的有效性。 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 Relationship Management (CRM) is gien.
出处 《电子科技大学学报》 EI CAS CSCD 北大核心 2007年第6期1289-1291,1314,共4页 Journal of University of Electronic Science and Technology of China
关键词 聚类分析 客户关系管理 数据挖掘 密度 网格 clustering analysis customer relationship management data mining density grid
  • 相关文献

参考文献10

二级参考文献62

  • 1田启明,王丽珍,尹群.基于网格距离的聚类算法的设计、实现和应用[J].计算机应用,2005,25(2):294-296. 被引量:12
  • 2韩端 汪培庄.应用模糊数学[M].北京:首都经济贸易大学出版社,1989..
  • 3罗承忠.模糊集引论(上册)[M].北京:北京师范大学出版社,1985.135-143.
  • 4WHInmon 王志海 译.数据仓库(第5版)[M].北京:机械工业出版社,2001..
  • 5Abraham Silbersehatz Henry Ekorth S Sudarshan 杨冬青 唐世谓.数据库系统概念(第4版)[M].北京:机械工业出版社,2004..
  • 6Zadeh L A Fuzzy sets. Inf Cont, 1965(8): 338-353.
  • 7Bezdek J C Pattern Recognition with Fuzzy Objective Function Algorithms. New York: Plenum Press, 1981.
  • 8Sandeep Kumar. Classification and Detection of Computer Intrusions[M]. COAST Laboratory Dept. of Computer Sciences Purdue University, 1995.8.
  • 9Dunn J C. A fuzzy relative of the ISODATA process and its use in detecting compact well separated cluster. J Cybernet, 1974(3): 32-57.
  • 10Wu Z, Leathy R. An optimal graph theoretic approach to data clustering: theory and its application to image segmentation. IEEE PAMI, 1993, 15(11): 1101-1113.

共引文献111

同被引文献23

  • 1郭世可,董槐林,龙飞,张海波.一种结合密度聚类和区域生长的图像分割方法[J].计算机研究与发展,2007,44(z3):420-423. 被引量:3
  • 2戴晓军,刘常昱,韩旭,李德毅.数据场在信息表征中的应用[J].复旦学报(自然科学版),2004,43(5):933-937. 被引量:9
  • 3薛方正,方帅,徐心和.多机器人对抗系统仿真中的对手建模[J].系统仿真学报,2005,17(9):2138-2141. 被引量:8
  • 4周明全,吕林涛.网络信息安全技术[M].西安:西安电子科技大学出版社,2004:93-95.郎
  • 5GARCIA-TEODOROA P, DIAZ-VERDEJOA J, MACIA-FERNAN- DEZA G, et al. Anomaly-based network intrusion detection: techniques, systems and challenges[ J]. Computers & Security, 2009, 28 (1/2) : 18 -28.
  • 6AL-MAMORY S O, ZHANG HONGLI. Intrusion detection alarms reduction using root cause analysis and clustering [ J]. Computer Communications, 2009, 32(2) : 419 -430.
  • 7AYDIN M A, ZAIM A H, CEYLAN K G. A hybrid intrusion detection system design for computer network security [ J]. Computers and Electrical Engineering, 2009, 35(3) : 517 - 526.
  • 8Xu Rui, Donald Wunsch. Survey of clustering algorithms [J]. IEEE Trans on Neural Networks,2005,16(3):645-678.
  • 9Lai Jim Z C,Liaw Yi-Ching.Improvement of the k-means clustering filtering algorithm [J]. Pattern Recognition, 2008,41 (12): 3677-3681.
  • 10Liaw Yi-Ching.Improvement of the fast exact pairwise-nearestneighbor algorithm[J].Pattern Recognition,2009,42(5):867-870.

引证文献3

二级引证文献8

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部