首页> 外文会议>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 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号