局部加权最小二乘回归的重叠子空间聚类算法

doi:10.16451/j.cnki.issn1003-6059.201802002

摘要
图/表
参考文献(23)
相关文章 (2)

全文: PDF (716 KB) HTML (1 KB)
输出: BibTeX | EndNote (RIS)

摘要

针对大多数子空间聚类方法处理非线性数据时聚类效果不理想、不同子空间数据相似性较高及聚类发生错误时无法及时校验的问题,提出局部加权最小二乘回归的重叠子空间聚类算法.利用K近邻思想突出数据的局部信息,取代非线性数据结构,通过高斯加权的方法选择最相似的近邻数据点,得到最优表示系数.然后使用重叠概率模型判断子空间内数据的重叠部分,再次校验聚类结果,提高聚类准确率.在人造数据集和真实数据集上分别进行测试,实验表明,文中算法能够取得较理想的聚类结果.

	服务

	把本文推荐给朋友
	加入我的书架
	加入引用管理器
	E-mail Alert
	RSS
	作者相关文章
	邱云飞
	费博雯
	刘大千

关键词 ：重叠子空间聚类, K近邻, 高斯加权, 重叠概率模型

Abstract：

Most subspace clustering methods can not deal with nonlinear data satisfactorily, and the data in different subspaces possess higher similarity and clustering error can not be verified in time. Aiming at these problems, an overlapping subspace clustering algorithm based on local weighted least squares regression(LWLSR) is proposed. The k-nearest neighbor(KNN) is introduced to highlight the local information of data and replace the nonlinear data structure. The nearest neighbor data points are selected by the Gaussian weighting method to obtain the optimal representation coefficients. Then, an overlapping probability model is employed to determine the overlap of the data in the subspace, and the clustering results are rechecked to improve the clustering accuracy. The experimental results on both artificial datasets and real-world datasets show that the proposed algorithm achieves better clustering results.

Key words： Overlapping Subspace Clustering K-Nearest Neighbor Gaussian Weighting Overlapping Probability Model

收稿日期: 2017-09-11

ZTFLH:

TP 181

基金资助:

国家自然科学基金青年科学基金项目(No.61401185)资助

作者简介: 邱云飞(通讯作者),博士,教授,主要研究方向为数据挖掘、智能数据处理.E-mail:7415575@qq.com.费博雯, 博士研究生,主要研究方向为数据挖掘、智能数据处理.E-mail:feibowen2098@163.com.刘大千, 博士研究生,主要研究方向为图像与视觉信息计算、目标的检测与跟踪.E-mail:liudaqianlntu@163.com.

引用本文:

邱云飞, 费博雯, 刘大千. 局部加权最小二乘回归的重叠子空间聚类算法[J]. 模式识别与人工智能, 2018, 31(2): 114-122. QIU Yunfei, FEI Bowen, LIU Daqian. Overlapping Subspace Clustering Based on Local Weighted Least Squares Regression. , 2018, 31(2): 114-122.

链接本文:

http://manu46.magtech.com.cn/Jweb_prai/CN/10.16451/j.cnki.issn1003-6059.201802002 或 http://manu46.magtech.com.cn/Jweb_prai/CN/Y2018/V31/I2/114

[1] TSAI C F, HUANG S C. An Effective and Efficient Grid-Based Data Clustering Algorithm Using Intuitive Neighbor Relationship for Data Mining // Proc of the International Conference on Machine Learning and Cybernetics. Washington, USA: IEEE, 2015: 478-483.
[2] PENG X, TANG H J, ZHANG L, et al. A Unified Framework for Representation-Based Subspace Clustering of Out-of-Sample and Large-Scale Data. IEEE Transactions on Neural Networks and Lear-ning Systems, 2016, 27(12): 2499-2512.
[3] SHARMA V K, BALA A. Clustering for High Dimensional Data // Proc of the 1st International Conference on Networks and Soft Computing. Washington, USA: IEEE, 2014: 365-369.
[4] HU H, LIN Z C, FENG J J, et al. Smooth Representation Clus-tering // Proc of the IEEE International Conference on Computer Vision and Pattern Recognition. Washington, USA: IEEE, 2014: 3834-3841.
[5] 刘展杰,陈晓云.局部子空间聚类.自动化学报, 2016, 42(8): 1238-1247.
(LIU Z J, CHEN X Y. Local Subspace Clustering. Acta Automatica Sinica, 2016, 42(8): 1238-1247.)
[6] 王卫卫,李小平,冯象初,等.稀疏子空间聚类综述.自动化学报, 2015, 41(8): 1373-1384.
(WANG W W, LI X P, FENG X C, et al. A Survey on Sparse Subspace Clustering. Acta Automatica Sinica, 2015, 41(8): 1373-1384.)
[7] ELHAMIFAR E, VIDAL R. Sparse Subspace Clustering: Algorithm, Theory, and Applications. IEEE Transactions on Pattern Analysis and Machine Intelligence, 2013, 35(11): 2765-2781.
[8] LU C Y, MIN H, ZHAO Z Q, et al. Robust and Efficient Subspace Segmentation via Least Squares Regression // Proc of the 12th European Conference on Computer Vision. Berlin, Germany: Springer, 2012: 347-360.
[9] LIU G C, LIN Z C, YU Y. Robust Subspace Segmentation by Low-Rank Representation // Proc of the 27th International Conference on Machine Leaning. New York, USA: ACM, 2010: 663-670.
[10] 傅文进,吴小俊.基于l₂范数的加权低秩子空间聚类.软件学报, 2017. DOI: 10.13328/j.cnki.jos.005235.
(FU W J, WU X J. Weighted Low Rank Subspace Clustering Based on l₂ Norm. Journal of Software, 2017. DOI: 10.13328/j.cnki.jos.005235.)
[11] 张涛,唐振民,吕建勇.一种基于低秩表示的子空间聚类改进算法.电子与信息学报, 2016, 38(11): 2811-2818.
(ZHANG T, TANG Z M, LÜ J Y. Improved Algorithm Based on Low Rank Representation for Subspace Clustering. Journal of Electronics & Information Technology, 2016, 38(11): 2811-2818.)
[12] XU J, XU K, CHEN K, et al.Reweighted Sparse Subspace Clus-tering. Computer Vision and Image Understanding, 2015, 138: 25-37.
[13] PATEL V M, VAN NGUYEN H, VIDAL R, et al. Latent Space Sparse and Low-Rank Subspace Clustering. IEEE Journal of Selected Topics in Signal Processing, 2015, 9(4): 691-701.
[14] 李辉,陈晓云.基于最小二乘回归的分块加权子空间聚类.模式识别与人工智能, 2016, 29(12): 1114-1121.
(LI H, CHEN X Y. Weighted Block Subspace Clustering Based on Least Square Regression. Pattern Recognition and Artificial Intelligence, 2016, 29(12): 1114-1121.)
[15] BAADEL S, THABTAH F, LU J. Overlapping Clustering: A Review // Proc of the IEEE Conference on SAI Computing Confe-rence. Washington, USA: IEEE, 2016: 233-237.
[16] BANERJEE A, KRUMPELMAN C, GHOSH J, et al. Model-Based Overlapping Clustering // Proc of the 11th ACM SIGKDD International Conference on Knowledge Discovery in Data Mining. New York, USA: ACM, 2005: 532-537.
[17] TANG Y Y, YUAN H L, LI L Q. Manifold-Based Sparse Representation for Hyperspectral Image Classification. IEEE Transaction on Geoscience and Remote Sensing, 2014, 52(12): 7606-7618.
[18] SHI J B, MALIK J. Normalized Cuts and Image Segmentation. IEEE
Transaction on Pattern Analysis and Machine Intelligence, 2000, 22(8): 888-905.
[19] FU Q, BANERJEE A. Multiplicative Mixture Models for Overla-pping Clustering // Proc of the 8th IEEE International Conference on Data Mining. Washington, USA: IEEE, 2008: 791-796.
[20] 邱云飞,费博雯,刘大千.基于概率模型的重叠子空间聚类算法.模式识别与人工智能, 2017, 30(7): 609-621.
(QIU Y F, FEI B W, LIU D Q. Overlapping Subspace Clustering Based on Probabilistic Model. Pattern Recognition and Artificial Intelligence, 2017, 30(7): 609-621.)
[21] CAI D, HE X F, WU X Y, et al. Non-negative Matrix Factorization on Manifold // Proc of the 8th IEEE International Conference on Data Mining. Washington, USA: IEEE, 2008: 63-72.
[22] 邓赵红,张丹丹,蒋亦樟,等.基于划分自适应融合的多视角模糊聚类算法.控制与决策, 2016, 31(4): 593-600.
(DENG Z H, ZHANG D D, JIANG Y Z, et al. Multi-view Fuzzy Clustering Algorithm Based on Partition Adaptive-Fusion. Control and Decision, 2016, 31(4): 593-600.)
[23] AGGARWAL C C, WOLF J L, YU P S, et al. Fast Algorithms for Projected Clustering // Proc of the ACM SIGKDD International Conference on Management of Data. New York, USA: ACM, 1999: 61-72.