首页> 外文会议>8th World Multi-Conference on Systemics, Cybernetics and Informatics(SCI 2004) vol.5: Computer Science and Engineering >Method for Shape Independent Clustering in case of Numerical Clustering together with Condensed Clustering
【24h】

Method for Shape Independent Clustering in case of Numerical Clustering together with Condensed Clustering

机译:数值聚类与压缩聚类一起的形状无关聚类方法

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

摘要

A new method which allows to identify any shape of cluster patterns in case of numerical clustering is proposed. The method is based on the iterative clustering construction utilizing a nearest neighbor distance between clusters to merge. The method differs from other techniques of which the cluster density is determined based on calculating the variance factors. The cluster density proposed here is, on the other hand, determined with a total distance within cluster that derived from a total distance of merged cluster and the distance between merged clusters in the previous stage of cluster construction. Thus, the whole density for each stage can be determined by a calculated average of a total density within cluster of each cluster, and then split by referring the maximum furthest distance between clusters at that stage. Beside this, this paper also proposes a technique for finding a global optimum of cluster construction. Experimental results show how effective the proposed clustering method is for a complicated shape of the cluster structure.
机译:提出了一种新的方法,该方法允许在数字聚类的情况下识别任何形状的聚类模式。该方法基于利用群集之间的最近邻居距离合并的迭代群集构造。该方法不同于其他技术,在其他技术中,基于计算方差因子确定群集密度。另一方面,这里提出的簇密度是由簇内的总距离确定的,该总距离由合并簇的总距离和在簇构建的前一阶段中合并簇之间的距离得出。因此,每个阶段的整体密度可以通过计算每个集群的集群内总密度的平均值来确定,然后通过参考该阶段集群之间的最远距离进行划分。除此之外,本文还提出了一种用于寻找全局最优集群构建的技术。实验结果表明,提出的聚类方法对于复杂形状的簇结构的有效性。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号