期刊文献+

基于网格的共享近邻聚类算法 被引量:7

Grid-based shared nearest neighbor clustering algorithm
下载PDF
导出
摘要 提出了一种基于网格的共享近邻聚类算法(Grid-based shared NearestNeighbor algorithm,GNN)。该算法主要利用网格技术去除数据集中的部分孤立点或噪声,使用密度阈值处理技术来处理网格的密度阈值,使用中心点技术提高聚类效率。GNN算法仅对数据集进行一遍扫描,且能处理任意形状和大小的聚类。实验表明,GNN有较好的可扩展性,其精度和效率明显地好于共享近邻SNN算法。 A grid-based shared nearest neighbor clustering algorithm(GNN) was presented. The GNN removed some outliers or noises in the dataset by grid technique and disposed of density threshold of grid by density threshold method. The GNN clustered by the method of shared nearest neighbor and improved the efficiency by the use of the grid center, Scanning the dataset only once, the GNN can discover clusters of arbitrary shapes. The experiment results show that it can discover outliers or noises effectively and get good cluster quality.
出处 《计算机应用》 CSCD 北大核心 2006年第7期1673-1675,共3页 journal of Computer Applications
基金 河南省自然科学基金资助项目(021105110)
关键词 基于网格 共享近邻 中心点 grid-based shared nearest neighbor center
  • 相关文献

参考文献11

  • 1KAUFMAN L, ROUSSEEUW PJ. Finding Groups in Data: An Introduction to Cluster Analysis[ M]. New York: John Wiley & Sons, 1990.
  • 2ESTER M, KRIEGEL HP, SANDER J, et al. A density-based algorithm for discovering clusters in large spatial databases[A]. Proceedings of the 2nd International Conference on Knowledge Discovery and Data Mining[C].1996, 8. 226 -231.
  • 3ANKERST M, BREUNIG M, KRIEGEL HP, et al. OPTICS: Ordering points to identify the clustering structure[ A]. Proceedings of ACM SIGMOD International Conference on Management of Data(SIGMOD'99) [ C]. Philadelphia, PA, 1999. 49 -60.
  • 4WANG W, YANG J, MUNTZ R. STING: A statistical information grid approach to spatial data mining[ A]. Proceedings of the 23rd International Conference on Very Large Databases [ C]. AThens,Greece, 1997. 186-195.
  • 5SHEIKHOLESLAMI G, CHATTERJEE S, ZHANG A. WaveCluster: A multi-resolution clustering approach for very large spatial databases[A]. Proceedings of 1998 International Conference on Very Large Data Bases[ C]. New York, 1998. 428 - 439.
  • 6AGRAWAL R, GEHRKE J, GUNOPULOS D, et al. Automatic subspace clustering of high dimensional data for data mining applications[ A]. ACM SIGMOD International Conference on Management of Data[C]. Seattle, WA, 1998. 94-105.
  • 7FISHER D. Improving inference through conceptual clustering[A].Proceedings of 1987 AAAI Conference[C]. Seattle, WA, 1987.461 - 465.
  • 8KARYPIS G, HAN E-H, KUMAR V. Chameleon: A Hierarchical Clustering Algorithm Using Dynamic Modelin[J]. IEEE Computer,1999, 32(8):68-75.
  • 9赵艳厂,宋梅,谢帆,宋俊德.用于不同密度聚类的多阶段等密度线算法[J].北京邮电大学学报,2003,26(2):42-47. 被引量:14
  • 10ERTOZ L, STEINBACH M, KUMAR V. Finding Clusters of Different Sizes, Shapes, and Densities in Noisy, High Dimensional Data[ A]. SIAM International Conference on Data Mining[ C].2003.42 - 47.

二级参考文献3

  • 1Zhao Yanchang, Song Junde. AGRID: an efficient algorithm for clustering large high-dimensional datasets[A]. Proc the 7th Pacific-Asia Conf on Knowledge Discovery and Data Mining (PAKDD-03)[C]. Seoul ,Korea : 2003.
  • 2Ester M, Kriegel H P, Sander J, et al. A density-based algorithm for discovering clusters in large spatial databases with noise[A]. Proc the 2nd Int Conf On Knowledge Discovery and Data Mining[C].Portland, Oregon : 1996. 226-- 231.
  • 3赵艳厂,谢帆,宋俊德.一种新的聚类算法:等密度线算法[J].北京邮电大学学报,2002,25(2):8-13. 被引量:14

共引文献13

同被引文献34

引证文献7

二级引证文献13

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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