...
首页> 外文期刊>Journal of Computers >CUDAP: A Novel Clustering Algorithm for Uncertain Data Based on Approximate Backbone
【24h】

CUDAP: A Novel Clustering Algorithm for Uncertain Data Based on Approximate Backbone

机译:CUDAP:一种基于近似主干的不确定数据聚类新算法

获取原文
           

摘要

Clustering for uncertain data is an interesting research topic in data mining. Researchers prefer to define uncertain data clustering problem by using combinatorial optimization model. Heuristic clustering algorithm is an efficient way to deal with this kind of clustering problem, but initialization sensitivity is one of inevitable drawbacks. In this paper, we propose a novel clustering algorithm named CUDAP (Clustering algorithm for Uncertain Data based on Approximate backbone). In CUDAP, we (1) make M times random sampling on the original uncertain data set D~(m) to generate M sampled data sets DS ={ Ds _(1), Ds _(2),…, Ds_(M) }; (2) capture the M local optimal clustering results P ={ C _(1), C _(2),…, C_(M) } from DS by running UK-Medoids algorithm on each sample data set Ds_(i) , i =1,… M ; (3) design a greedy search algorithm to find out the approximate backbone( APB ) from P ; (4) run UK-Medoids again on the original uncertain data set D~(m) ~( )guided by new initialization which was generated from APB . Experimental results on synthetic and real world data sets demonstrate the superiority of the proposed approach in terms of clustering quality measures.
机译:不确定数据的聚类是数据挖掘中一个有趣的研究主题。研究人员更喜欢通过组合优化模型来定义不确定的数据聚类问题。启发式聚类算法是解决这种聚类问题的有效方法,但是初始化敏感性是不可避免的缺点之一。在本文中,我们提出了一种新的聚类算法,称为CUDAP(基于近似主干的不确定数据聚类算法)。在CUDAP中,我们(1)对原始不确定数据集D〜(m)进行M次随机采样,以生成M个采样数据集DS = {Ds _(1),Ds _(2),…,Ds_(M) }; (2)通过在每个样本数据集Ds_(i)上运行UK-Medoids算法,从DS捕获M个局部最优聚类结果P = {C _(1),C _(2),…,C_(M)}, i = 1,…M; (3)设计贪婪搜索算法,从P中找出近似主干(APB)。 (4)在由APB生成的新初始化指导下,在原始不确定数据集D〜(m)〜()上再次运行UK-Medoids。综合和真实数据集的实验结果证明了该方法在聚类质量度量方面的优越性。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号