首页> 外文期刊>International Journal of Computers & Applications >Affinity propagation clustering algorithm based on large-scale data-set
【24h】

Affinity propagation clustering algorithm based on large-scale data-set

机译:基于大规模数据集的相似性传播聚类算法

获取原文
获取原文并翻译 | 示例
       

摘要

Affinity Propagation (AP) algorithm is not effective in processing large-scale data-sets, so the paper purposed an affinity propagation clustering algorithm based on large scale data-set, called LD-AP. First, we use the idea of grid clustering to divide large data-sets into small datasets and running AP in them to ensure the center of clustering. Then, we introduced the structure similarity matrix to calculate the distance of the cluster center. At last, we used Density peak Clustering Algorithm (DP) algorithm to cluster the cluster again. The experimental results show that the improved algorithm is better than the original algorithm in the clustering effect and computation speed.
机译:亲和力传播(AP)算法在处理大规模数据集时效果不佳,因此本文提出了一种基于大规模数据集的亲和力传播聚类算法,称为LD-AP。首先,我们使用网格聚类的想法将大型数据集划分为小型数据集,并在其中运行AP以确保聚类的中心。然后,我们引入结构相似度矩阵来计算聚类中心的距离。最后,我们使用密度峰值聚类算法(DP)再次对聚类进行聚类。实验结果表明,改进算法在聚类效果和计算速度上均优于原始算法。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号