期刊文献+

基于相对密度的聚类算法研究与应用 被引量:2

Research and Application of Cluster Analysis Algorithm Based on Relative Density
下载PDF
导出
摘要 针对经典的基于密度的聚类分析算法DBSCAN存在的聚类质量对参数敏感,不能处理多密度数据集等问题,提出基于相对密度的聚类分析算法RDCMD,该算法以某点密度与其领域密度的比值表示该点的相对密度,由于不同点的领域信息是不同的,所以相对密度是动态变化的,从而可以适应多密度数据集中点的密度变化。因此,RDCMD算法可以处理多密度数据集,同时能够自动识别噪声。 According to the abuse and problem in traditional Density-based Spatial Clustering of Appli- cations with Noise (DBSCAN), such as clustering quality is sensitive to parameters; multi-den- sity data set cannot be processed, etc., gives Relative Density-based Cluster analysis algorithm (RDCMD). This algorithm uses the ratio of the density at a given point and field density to in- dicate the relative density of that point, due to different point has different field information, and the relative density has the dynamic variation which can adapt to the density change in multi-density data sets. Therefore, RDCMD algorithm can deal with multidimensional data sets, and automatically identify noise as well.
作者 赵双柱
出处 《现代计算机》 2013年第9期3-7,20,共6页 Modern Computer
关键词 DBSCAN RDCMD 数据密度聚类 聚类质量 时间复杂度 参数对比 DBSCAN RDCMD Data Density Clustering Clustering Quality Time Complexity Parameters Comparison
  • 相关文献

参考文献7

  • 1熊建斌,李振坤,刘怡俊.半监督聚类算法研究现状.
  • 2Martin Ester, Hans-Peter Kriegel, JSrgSander, et al. A Den- sity-Based Algorithm for Discovering Clusters in Large Spa- tial Databases with Noise[C]. In Proceedings of 2nd Interna- tional Conference on Knowledge Discovery and Data Mining (KDD "96), 1996:226-231.
  • 3Mihael Ankerst, Markus M. Breunig, Hans-Peter Kriegel, et al. OPTICS: Ordering Points to Identify the Clustering Struc- ture. Proceedings of the ACM SIGMOD'99 International Conference on Management of Data, 1999, 28 (2): 49-60.
  • 4Alexander Hinneburg, Daniel A. Keim. An Efficient Approach to Clustering in Muhimedia Databases with Noise[J]. AAAI Press. 1998, 5865(e): 58-65.
  • 5陈燕俐,洪龙,金达文,朱梧槚.一种简单有效的基于密度的聚类分析算法[J].南京邮电学院学报(自然科学版),2005,25(4):24-29. 被引量:8
  • 6George Karypis, Eui-Hong Han, Vipin Kumar. Cha,neleon: A Hierarchical Clustering Algorithm Using Dynamic Modeling [J]. 1EEE Computer Society.1999, 32(8): 68-75.
  • 7Lian Duana, Lida Xu, Feng Guo, et al. A I.oeal-Density Based Spatial Clustering Algorithm with Noise[J]. Information Sys- tems,2007,32:978-986.

二级参考文献7

  • 1周水庚,周傲英,金文,范晔,钱卫宁.FDBSCAN:一种快速 DBSCAN算法(英文)[J].软件学报,2000,11(6):735-744. 被引量:42
  • 2NG R T,HAN J.Efficient and effective clustering methods for spatial datamining[A].In:Proc of the 20th VLDB Conf[C].Santiago: MorganKaufmann,1994.144~155.
  • 3ANKERST M, BREUNIG M.KRIEGEL H -P,et al.OPTICS: Ordering points to identify the clustering structure[A].In Proc 1999 ACM-SIGMOD Int Conf Management of Data[C]. Philadelphia, PA, June 1999.49~60.
  • 4HAN Jiawei,KAMBER M. Data Mining,Concepts and Techniques[M]. CA:Morgan Kaufmann Publishers, 2000.
  • 5JAIN A K,MURTY M N,FLYNN P J.Data Clustering:A Survey[J].ACM Comput Surv, 1999,31:264~323.
  • 6ESTER M,KRIEGEL H -P,SANDER J,et al.A Density-Based Algorithm for Discovering Clusterin Large Spatial Databases[A].In Proc 1996 Int Conf(KDD'96)[C].1996.226~231.
  • 7DATE C J. An Introduction to Database Systems,7th ed[M].MA:Addision-Wesley,2000.

共引文献7

同被引文献15

引证文献2

二级引证文献3

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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