Computer Science ›› 2020, Vol. 47 ›› Issue (7): 66-70.doi: 10.11896/jsjkx.190600155

• Database & Big Data & Data Science • Previous Articles     Next Articles

Subspace Clustering Method Based on Block Diagonal Representation and Neighbor Constraint

GAO Fang-yuan1, WANG Xiu-mei2   

  1. 1 School of Mathematics and System Science,Beihang University,Beijing 102206,China
    2 School of Electronic Engineering,Xidian University,Xi’an 710071,China
  • Received:2019-06-26 Online:2020-07-15 Published:2020-07-16
  • About author:GAO Fang-yuan,born in 2000,underduate student.His current research interests include clustering analysis and image processing.
    WANG Xiu-mei,born in 1978,professor.Her main research interests include statistical machine learning and image processing.
  • Supported by:
    This work was supported by the National Natural Science Foundation of China(61972305,61871308,61772402),College Students’ Innovative Entrepreneurial Training Plan Program and Natural Science Basic Research Plan in Shaanxi Province of China(2019JM-090)

Abstract: Clustering is an important tool for machine learning and data mining,and subspace clustering is a popular method in high-dimensional data analysis.Spectral clustering based subspace clustering method learns the self-representation coefficient matrix of data in subspace,and then the spectral clustering is carried out on the coefficient matrix.It is found that the subspace-based clustering cannot deal with nonlinear problem and neglect the local geometric structure of the data.To this end,this paper proposes a new subspace clustering method which first projects the data to a high-dimensional linear space by a nonlinear mapping function and applies a Laplacian-based manifold regularization constraint on the subspace clustering model to preserve the local structure of the data at the same time.Three kinds of Laplacian matrix are used to establish the different nonlinear subspace clustering models based on manifold regularization and block diagonal constraints.Experimental results on different data sets show the effectiveness of the proposed methods.

Key words: Subspace clustering, Block diagonal constraint, Nonlinear mapping, Manifold regularization

CLC Number: 

  • TP391
[1] MAC Q J.Some methods for classification and analysis of multivariate observations[C]//Proceedings of Berkeley Symposium on Mathematical Statistics and Probability.1967:281-297.
[2] NG A Y,JORDAN M I,WEISS Y.On spectral clustering:analysis and an algorithm[C]//Proceedings of the International Conference on Neural Information Processing Systems.Cambridge:MIT Press,2001:849-856.
[3] VIDAL R.Subspace clustering[J].IEEE Signal ProcessingMagazine,2011,28(2):52-68.
[4] FISCHLER M,BOLLES R R.Random sample consensus:a para-digm for model fitting with applications to image analysis and automated cartography[J].Journal of ACM,1981,24(6):381-395.
[5] MA Y,DERKSEN H,HONG W,et al.Segmentation of multivariate mixed data via lossy coding and compression[J].IEEE Transactions on Pattern Analysis and Machine Intelligence,2007,29(9):1546-1562.
[6] LU L,VIDAL R.Combined central and subspace clustering for computer vision applications[C]//Proceedings of International Conference on Machine Learning.New York:ACM Press,2006:593-600.
[7] VIDAL R,MA Y,SASTRY S.Generalized principal component analysis[J].IEEE Transactions on Pattern Analysis and Machine Intelligence,2005,27(12):1-15.
[8] ELHAMIFAR E,VIDAL R.Sparse subspace clustering[C]//Proceedings of IEEE Conference on Computer Vision and Pattern Recognition.New York:IEEE Press,2009:2790-2797.
[9] LIU G,LIN Z,YAN S,et al.Robust recovery of subspace structures by low-rank representation[J].IEEE Transactions on Pattern Analysis and Machine Intelligence,2013,35(1):171-184.
[10] GAO X,ZHANG K,TAO D,et al.Image super-resolution with sparse neighbor embedding[J].IEEE Transactions on Image Processing,2012,21(7):3194-3205.
[11] LU C,FENG J,LIN Z,et al.Subspace clustering by block diagonal representation[J].IEEE Transactions on Pattern Analysis and Machine Intelligence,2019,41(2):487-501.
[12] SHI J,MALIK J.Normalized cuts and image segmentation[J].IEEE Transactions on Pattern Analysis and Machine Intelligence,2000,22(8):888-905.
[13] ZELNIK-MANOR L,PERONA P.Self-tuning spectral cluste-ring[C]//Proceedings of the International Conference on Neural Information Processing Systems.Cambridge:MIT Press,2004:1601-1608.
[14] LIU X Y,LI J W,YU H,et al.Adaptive spectral clustering based on shared nearest neighbors[J].Journal of Chinese Computer Systems,2011,32:1876-1880.
[15] TOLIC'D,ANTULOV-FANTULIN N,KOPRIVA I.A nonli-near orthogonal non-negative matrix factorization approach to subspace clustering[J].Pattern Recognition,2018,82:40-55.
[16] SORENSEN D C,ANTOULAS A C.The sylvester equation and approximate balanced reduction[J].Linear Algebra and its Applications,2002,351/352:671-700.
[17] https://archive.ics.uci.edu/ml/datasets.html.
[18] LEE K C,HO J,KRIEGMAN D J.Acquiring linear subspaces for face recognition under variable lighting[J].IEEE Transactions on Pattern Recognition and Machine Intelligence,2005,27(5):684-698.
[19] LECUN Y,BOTTOU L,BENGIO Y,et al.Gradient-basedlearning applied to document recognition[J].Proceeding of IEEE,1998,86(11):2278-2324.
[20] WANG F,ZHAO B,ZHANG C.Linear time maximum margin clustering[J].IEEE Transactions on Neural Networks,2010,21(2):319-332.
[1] XING Yu-hua, LI Ming-xing. Robust Low Rank Subspace Clustering Algorithm Based on Projection [J]. Computer Science, 2020, 47(6): 92-97.
[2] LIU Shu-jun, WEI Lai. Block Integration Based Image Clustering Algorithm [J]. Computer Science, 2020, 47(6): 170-175.
[3] HUANG Meng-ting, ZHANG Ling, JIANG Wen-chao. Multi-type Relational Data Co-clustering Approach Based on Manifold Regularization [J]. Computer Science, 2019, 46(6): 64-68.
[4] ZHANG Heng-wei, HE Jia-jing, HAN Ji-hong and WANG Jin-dong. Fuzzy Soft Subspace Clustering Method Based on Intelligent Optimization Algorithm [J]. Computer Science, 2016, 43(3): 256-261.
[5] CHEN Li-ping and GUO Gong-de. Subspace Clustering Based on Sequential Feature [J]. Computer Science, 2016, 43(3): 72-74.
[6] XU Xue-yan,WANG Su-nan and WU Chun-ming. Network Traffic Classification Method Research Based on Subspace Clustering Algorithm [J]. Computer Science, 2014, 41(Z11): 301-306.
[7] JIANG Wei,CHEN Yao and YANG Bing-ru. Manifold Regularized-based Nonsmooth Nonnegative Matrix Factorization [J]. Computer Science, 2014, 41(3): 272-275.
[8] WANG Li-juan,HAO Zhi-feng,CAI Rui-chu and WEN Wen. Multiple Local Adaptive Soft Subspace Clustering Ensemble Based on Multimodal Perturbation [J]. Computer Science, 2014, 41(2): 240-244.
[9] XU Hai-rui,ZHANG Wen-sheng,WU Shuang. Document Classification Algorithm Based on Manifold Regularization [J]. Computer Science, 2012, 39(3): 196-199.
[10] SUN Yu-Fen ,LU Yan-Sheng (Computer Department of Huazhong University of Science and Technology, Wuhan 430074). [J]. Computer Science, 2007, 34(4): 199-203.
[11] . [J]. Computer Science, 2006, 33(11): 14-17.
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
[1] LEI Li-hui and WANG Jing. Parallelization of LTL Model Checking Based on Possibility Measure[J]. Computer Science, 2018, 45(4): 71 -75 .
[2] SUN Qi, JIN Yan, HE Kun and XU Ling-xuan. Hybrid Evolutionary Algorithm for Solving Mixed Capacitated General Routing Problem[J]. Computer Science, 2018, 45(4): 76 -82 .
[3] ZHANG Jia-nan and XIAO Ming-yu. Approximation Algorithm for Weighted Mixed Domination Problem[J]. Computer Science, 2018, 45(4): 83 -88 .
[4] WU Jian-hui, HUANG Zhong-xiang, LI Wu, WU Jian-hui, PENG Xin and ZHANG Sheng. Robustness Optimization of Sequence Decision in Urban Road Construction[J]. Computer Science, 2018, 45(4): 89 -93 .
[5] SHI Wen-jun, WU Ji-gang and LUO Yu-chun. Fast and Efficient Scheduling Algorithms for Mobile Cloud Offloading[J]. Computer Science, 2018, 45(4): 94 -99 .
[6] ZHOU Yan-ping and YE Qiao-lin. L1-norm Distance Based Least Squares Twin Support Vector Machine[J]. Computer Science, 2018, 45(4): 100 -105 .
[7] LIU Bo-yi, TANG Xiang-yan and CHENG Jie-ren. Recognition Method for Corn Borer Based on Templates Matching in Muliple Growth Periods[J]. Computer Science, 2018, 45(4): 106 -111 .
[8] GENG Hai-jun, SHI Xin-gang, WANG Zhi-liang, YIN Xia and YIN Shao-ping. Energy-efficient Intra-domain Routing Algorithm Based on Directed Acyclic Graph[J]. Computer Science, 2018, 45(4): 112 -116 .
[9] CUI Qiong, LI Jian-hua, WANG Hong and NAN Ming-li. Resilience Analysis Model of Networked Command Information System Based on Node Repairability[J]. Computer Science, 2018, 45(4): 117 -121 .
[10] WANG Zhen-chao, HOU Huan-huan and LIAN Rui. Path Optimization Scheme for Restraining Degree of Disorder in CMT[J]. Computer Science, 2018, 45(4): 122 -125 .