首页> 外文期刊>Automation, Control and Intelligent Systems >A Novel Approach Canberra Measure Minimal Spanning Tree Using Fuzzy C-Means Based on Gaussian Function for Image Data Mining
【24h】

A Novel Approach Canberra Measure Minimal Spanning Tree Using Fuzzy C-Means Based on Gaussian Function for Image Data Mining

机译:基于高斯函数的模糊C-均值测量堪培拉最小生成树的新方法

获取原文
       

摘要

Clustering analysis has been an emerging research issue in data mining due to its variety of applications. In recently, mathematical algorithm supported automatic segmentation system plays an important role in clustering of images. The fuzzy c-means clustering is a method of cluster analysis which aims to partition n data points into k-clusters. The conventional FCM-based algorithm considers no spatial content information, which means it sensitive to noise. Unsupervised techniques need to be employed, which can be based on minimal spanning tree generated by comparing spatial neighbourhood information, the MST based clustering algorithms have been widely used due to their ability to detect clusters with irregular boundaries. We propose an automatic fuzzy c-means initialization algorithm based on Canberra distance minimal spanning tree for the purpose of segmentation of medical images, where vertices and edges are labelled with multi-dimensional vectors. A Canberra distance measure based, construct the minimal spanning tree clustering algorithm. An efficient method for calculating membership and updating prototypes by minimizing the new objective function of Gaussian based fuzzy c-means. The algorithm uses a new cluster validation criterion based on the geometric property of data partition of the dataset in order to find the proper number of cluster at each level. In this algorithm to apply medical images to reduce the inhomogeneity and allow the labelling of a pixel to be influenced by the labels in its immediate neighbourhood and reduces the time complexity and better clustering results than the existing traditional minimal spanning tree algorithm. The performance of proposed algorithm has been shown with random data set, partition coefficient and validation function are used to evaluate the validity of clustering and then new cluster separation approach to optimal number of clustering. Also this paper compares the results of proposed method with the results of existing basic fuzzy c-means.
机译:聚类分析由于其各种应用而已成为数据挖掘中一个新兴的研究问题。最近,数学算法支持的自动分割系统在图像聚类中起着重要作用。模糊c均值聚类是一种聚类分析方法,旨在将n个数据点划分为k个聚类。常规的基于FCM的算法不考虑空间内容信息,这意味着它对噪声敏感。需要采用无监督技术,该技术可以基于通过比较空间邻域信息而生成的最小生成树,基于MST的聚类算法由于能够检测具有不规则边界的聚类而被广泛使用。为了医学图像的分割,我们提出了一种基于堪培拉距离最小生成树的自动模糊c均值初始化算法,其中顶点和边缘被多维矢量标记。基于堪培拉距离测度,构造最小生成树聚类算法。一种通过最小化基于高斯的模糊c均值的新目标函数来计算成员资格和更新原型的有效方法。该算法基于数据集数据分区的几何特性使用新的聚类验证标准,以便在每个级别上找到适当的聚类数量。与现有的传统最小生成树算法相比,在该算法中应用医学图像以减少不均匀性并允许像素的标记受到其紧邻像素的影响,并减少了时间复杂度和更好的聚类结果。利用随机数据集证明了所提算法的性能,利用分配系数和验证函数对聚类的有效性进行了评估,然后采用新的聚类分离方法对聚类进行了优化。此外,本文还将提出的方法的结果与现有的基本模糊c均值的结果进行了比较。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号