基于局部线性重构与高斯核映射的聚类研究  

Clustering Research Based on Locally Linear Reconstruction and Gaussian Kernel Map

作　　者：马元元[1] 郝海涛 杨延娇[3] 

机构地区：[1]中山职业技术学院信息工程学院,广东中山528404 [2]中山市广播电视大学,广东中山528403 [3]西北师范大学计算机科学与工程学院,兰州730070

出　　处：《控制工程》2017年第7期1493-1500,共8页Control Engineering of China

基　　金：国家自然科学基金(61462057)

摘　　要：针对现有的基于约束的半监督聚类算法获得的聚类结果质量不足的问题,提出一种基于高斯核映射与局部线性重构的主动学习聚类算法。首先利用高斯核映射与局部线性嵌入进行流行学习,将对局部线性重构重要性过低以及非平坦区域的样本作为不重要的样本;然后,为查询选择设立了1个考虑样本所需查询数量的新判断条件;最终,建立must-link并将平坦区域的信息传递至半监督聚类算法。实验结果证明,对于小规模数据与大规模数据,该算法学习的成对约束均可获得较好的聚类结果。Aimed at the problem that the clustering structure by the existing semi-supervised clusteringalgorithm based on constraints is not good, a Gaussian kernel map and locally linear reconstruction learningbased active learning clustering research algorithm is proposed. Firstly, Gaussian kernel map and local linearreconstruction are used for manifold learning, the samples which are not important to local linearreconstruction and not in the flat patch are set as unimportant samples; Then, a new criterion considering thecount of queries by the sample is set; Lastly, must-link is created and used to pass the information in the flatpatch to the clustering algorithm. Experimental results show that the pairwise constraints learned by theproposed algorithm get a better cluster structure for the data set of both small scale and large scale.

关 键 词：高斯核映射 局部线性重构 聚类算法 成对约束 查询选择 

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