基于核距离的直觉模糊c均值聚类算法  

Intuitionistic Fuzzy c-means Clustering Algorithm Based on Kernelled Distance

作　　者：余晓东[1] 雷英杰[1] 宋亚飞[1] 岳韶华[1] 申晓勇[1] 

机构地区：[1]空军工程大学防空反导学院,陕西西安710051

出　　处：《电子学报》2016年第10期2530-2534,共5页Acta Electronica Sinica

基　　金：国家自然科学基金(No.61272011;No.61309022);陕西省自然科学青年基金(No.2013JQ8031)

摘　　要：针对现有直觉模糊c均值聚类算法无法发现非凸聚类结构的缺陷,提出了一种基于核化距离的直觉模糊c均值聚类算法.算法在定义了基于核的直觉模糊欧式距离基础上,通过把聚类样本映射到高维特征空间,使原来没有显现的特征突现出来,从而能够更好地聚类.实验选择一组人工数据集及一组UCI数据集测试了本文算法,并将其与五种经典的聚类算法进行了比较.实验结果充分表明了该算法的有效性及优越性.The intuitionistic fuzzy c-means clustering algorithm cannot discover the non-convex cluster structure. To alleviate this problem,an intuitionistic fuzzy c-means clustering algorithm based on kernelled distance is proposed. By defining the intuitionistic fuzzy Euclid distance,we map the sample to a high-dimension feature space. So the former features can be reflected thoroughly,which is helpful for clustering. Experiments executed on one artificial data sets and one UCI data sets demonstrate the performance of the proposed method. Compared with the five classical cluster algorithms,our method is of obvious effectiveness and superiority.

关 键 词：直觉模糊集 直觉模糊聚类 核方法 无监督学习 

分 类 号：TP182[自动化与计算机技术—控制理论与控制工程] TP391[自动化与计算机技术—控制科学与工程]