首页> 外文会议>International Conference on Machine Learning and Cybernetics >An effective and efficient grid-based data clustering algorithm using intuitive neighbor relationship for data mining
【24h】

An effective and efficient grid-based data clustering algorithm using intuitive neighbor relationship for data mining

机译:一种使用直观邻居的数据挖掘有效且基于网格的数据聚类算法

获取原文

摘要

This paper presents a new data clustering technique. It is a new grid-based clustering scheme by intuitive neighbor relationship for enhancing data clustering performance. Compared to other algorithms, this improved grid-based clustering algorithm substantially decreases repetitive clustering checks of neighboring grids and greatly improve the efficiency of data processing. Our simulations demonstrate that the proposed data clustering technique delivers better performance, in terms of clustering correctness rate and noise filtering rate, than perform other well-known existing algorithms, GOD-CS, CLIQUE and TING. To our best knowledge, the proposed data clustering technique may be the rapid method in the world currently.
机译:本文提出了一种新的数据聚类技术。它是一种通过直观邻居关系的基于网格的聚类方案,用于增强数据聚类性能。与其他算法相比,这种改进的基于网格的聚类算法显着降低了相邻网格的重复聚类检查,并大大提高了数据处理的效率。我们的模拟表明,在集群正确性率和噪声滤波速率方面,所提出的数据聚类技术比执行其他众所周知的现有算法,GOD-CS,Clique和Ting,可提供更好的性能。为了我们的最佳知识,所提出的数据聚类技术目前可能是世界上的快速方法。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号