首页> 外文会议>International Conference on Information Technology Interfaces >Improved Bisector pruning for uncertain data mining
【24h】

Improved Bisector pruning for uncertain data mining

机译:改善了对不确定数据挖掘的平分序

获取原文

摘要

Uncertain data mining is well studied and very challenging task. This paper is concentrated on clustering uncertain objects with location uncertainty. Uncertain locations are described by probability density function (PDF). Number of uncertain objects can be very large and obtaining quality result within reasonable time is a challenging task. Basic clustering method is UK-means, in which all expected distances (ED) from objects to clusters are calculated. Thus UK-means is inefficient. To avoid ED calculations various pruning methods are proposed. The pruning methods are significantly more effective than UK-means method. In this paper, Improved Bisector pruning method is proposed as an improvement of clustering process.
机译:不确定的数据挖掘是很好的研究和非常具有挑战性的任务。本文集中在聚类不确定物体上,具有位置不确定性。不确定的位置由概率密度函数(PDF)描述。不确定对象的数量可以非常大,并且在合理的时间内获得质量结果是一个具有挑战性的任务。基本群集方法是UK-Clys,其中计算了从对象到群集的所有预期距离(ED)。因此,英国均值效率低下。为避免进行计算,提出了各种修剪方法。修剪方法比英国均值更有效。本文提出了改进的分料修剪方法作为聚类过程的改进。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号