计算机科学 ›› 2016, Vol. 43 ›› Issue (3): 72-74.doi: 10.11896/j.issn.1002-137X.2016.03.014

• 第十五届中国机器学习会议 • 上一篇    下一篇

一种基于顺序特性的子空间聚类方法

陈丽萍,郭躬德   

  1. 福建师范大学数学与计算机科学学院 福州350007,福建师范大学数学与计算机科学学院 福州350007
  • 出版日期:2018-12-01 发布日期:2018-12-01
  • 基金资助:
    本文受国家自然科学基金:面向软件行为鉴别的事件序列挖掘方法研究(61175123)资助

Subspace Clustering Based on Sequential Feature

CHEN Li-ping and GUO Gong-de   

  • Online:2018-12-01 Published:2018-12-01

摘要: 受到Tierney的序列稀疏子空间聚类方法的启发,提出了一种新的基于顺序特性的子空间聚类方法。该方法先通过提升小波变换处理得到信号的低频信息;然后通过强调相邻样本之间的连续性来设置特殊的惩罚项,并根据噪声的大小自动调节惩罚因子;最后过滤系数矩阵中一些小的干扰系数。在人工合成和实际应用的数据集上的实验结果表明,与当前最具代表性的几种稀疏子空间聚类方法相比,所提方法具有较好的实验效果。

关键词: 稀疏子空间聚类,顺序特性,惩罚因子

Abstract: Inspired by Tierney’s subspace clustering of the sequence data,a novel subspace clustering method based on sequential character was proposed.In the beginning,the lifting wavelet transform is applied to extract low-frequency information of the signal,and then a stronger special penalty term is applied to emphasize the similarity between adjacent samples,in which the penalty factor is automatically adjusted according to the noise.The proposed method performs better compared with the most characteristic sparse subspace clustering methods in experiment carried out on a synthetic data set and some data sets from real-world applications.

Key words: Sparse subspace clustering,Sequence feature,Penalty factor

[1] Tierney S,Gao J B,Guo Y.Subspace clustering for sequentialdata[C]∥2014 IEEE Conference on Computer Vision and Pattern Recognition.2014:1019-1026
[2] Vidal R.A tutorial on subspace clustering[J].Signal Processing Magazine,IEEE,2011,28(2):52-68
[3] Elhamifar E,Vidal R.Sparse subspace clustering:algorithm,theory,and applications[J].Pattern Analysis and Machine Intelligence,IEEE TR,2013,35(11):2765-2781
[4] Feng Jia-shi,Lin Zhou-chen,Xu Huan.Robust Subspace Seg-mentation with Block-diagonal Prior[C]∥Computer Vision and Pattern Recognition.2014
[5] Bako L.Subspace clustering through parametric representationand sparse optimization[J].Signal Processing Letters,IEEE,2014,21(3):356-360
[6] Guo Y,Gao J,Li F.Spatial subspace clustering for hyperspectral data segmentation[C]∥Conference of The Society of Digital Information and Wireless Communications.2013
[7] Chen Li-fei,Guo Gong-de,Jiang Qing-shan.Adaptive Algo-rithm for Soft Subspace Clustering[J].Journal of Software,2010,21(10):2513-2522(in Chinese) 陈黎飞,郭躬德,姜青山.自适应的软子空间聚类算法[J].软件学报,2010,21(10):2513-2522
[8] Liu G,Lin Z,Yu Y.Robust subspace segmentation by low-rank representationby low-rank representation[C]∥International Conference on Machine Learning.2010:663-670
[9] Liu J,Chen Y,Zhang Y,et al.Enhancing Low-Rank subspaceclustering by manifold regularization[J].IEEE Transactions on Image Processing,2014,23(9):4022-4030
[10] Sweldens W.The lifting scheme:a construction of second Generation of wavelets[J].SIAM Journal on Mathematical Analysis,1998,29(2):511-546
[11] Shi J,Malik J.Normalized cuts and image segmentation[J].IEEE Transactions on Pattern Analysis and Machine Intelligence,2000,22(8):888-905
[12] Boyd S,Parikh N,Chu E,et al.Distributed optimization and statistical learning via the alternating direction method of multip-liers[J].Foundations and Trends in Machine Learning,2010,3(1):1-122
[13] Georghiades,Athinodoros S,Belhumeur,et al.From few tomany:Illumination cone models for face recognition under varia-ble lighting and pose[J].IEEE Transactions on Pattern Analysis and Machine Intelligence,2001,3(6):643-660

No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!