Journal of Shandong University(Engineering Science) ›› 2021, Vol. 51 ›› Issue (2): 65-73.doi: 10.6040/j.issn.1672-3961.0.2020.182

Previous Articles    

Active learning of pairwise constraints in block diagonal subspace clustering

XIE Ziqi, WANG Lihong*, LI Man   

  1. School of Computer and Control Engineering, Yantai University, Yantai 264005, Shandong, China
  • Published:2021-04-16

Abstract: Focusing on the poor performance of subspace clustering by block diagonal representation(BDR)on high-dimensional data with overlapped subspaces, an active learning strategy was designed to obtain partial pairwise information among a few data points. A pairwise constrained block diagonal representation algorithm(CBDR)was proposed to improve the performance of the BDR algorithm. The objective function and solution process of the CBDR were given. The experimental results on the test datasets showed that the CBDR algorithm reduced the clustering error by more than 5% with less than 5‰ constraint information in terms of clustering error and normalized mutual information, which significantly outperformed the compared algorithms, i.e., BDR, SBDR(structured block diagonal representation)with random selection of pairwise constraints.

Key words: subspace clustering, active learning, pairwise constraints, block diagonal representation, constrained clustering

CLC Number: 

  • TP181
[1] ELHAMIFAR E, VIDAL R. Sparse subspace clustering: algorithm, theory, and applications[J]. IEEE Transactions on Pattern Analysis & Machine Intelligence, 2012, 35(11):2765-2781.
[2] LIU G, LIN Z, YAN S, et al. Robust recovery of subspace structures by low-rank representation[J]. IEEE Transactions on Pattern Analysis & Machine Intelligence, 2013, 35(1):171-184.
[3] LU C, FENG J, LIN Z, et al. Subspace clustering by block diagonal representation[J]. IEEE Transactions on Pattern Analysis & Machine Intelligence, 2019, 41(2):487-501.
[4] YANG Y, ZHANG X. Subspace clustering algorithm based on Laplacian rank constraint[C] //Proceedings of 2019 IEEE 3rd Information Technology, Networking, Electronic and Automation Control Conference. Chengdu, China: IEEE, 2019:1556-1559.
[5] VIDAL R, MA Y, SASTRY S. Generalized principal component analysis[M]. New York, USA: Springer, 2016.
[6] WANG L, HUANG J, YI M, et al. Block diagonal representation learning for robust subspace clustering[J]. Information Sciences, 2020, 526:54-67.
[7] ZHANG Zhao, REN Jiahuan, LI Sheng, et al. Robust subspace discovery by block-diagonal adaptive locality-constrained representation[C] //Proceedings of ACM International Conference on Multimedia(MM'19). Nice, France: ACM, 2019.
[8] 郑建炜, 李卓蓉, 王万良, 等. 联合Laplacian正则项和特征自适应的数据聚类算法[J]. 软件学报, 2019, 30(12):3846-3861. ZHENG Jianwei, LI Zhuorong, WANG Wanliang, et al. Clustering with joint Laplacian regularization and adaptive feature learning[J]. Journal of Software, 2019, 30(12):3846-3861.
[9] HE R, ZHANG Y, SUN Z, et al. Robust subspace clustering with complex noise[J]. IEEE Transactions on Image Processing, 2015, 24(11):4001-4013.
[10] 鲁全茂. 面向高维数据的聚类算法研究[D]. 北京:中国科学院大学, 2018. LU Quanmao. Research on clustering algorithms for high-dimensional data[D]. Beijing:University of Chinese Academy of Sciences, 2018.
[11] ABDOLALI M, RAHMATI M. Neither global nor local: a hierarchical robust subspace clustering for image data[J]. Information Sciences, 2020, 514:333-353.
[12] LIU Maoshan, WANG Yan, SUN Jun, et al. Structured block diagonal representation for subspace clustering[J]. Applied Intelligence, 2020.
[13] ZHANG Zhao, ZHANG Yan, LIU Guangcan, et al. Joint label prediction based semi-supervised adaptive concept factorization for robust data representation[J]. IEEE Transactions on Knowledge and Data Engineering, 2020, 32(5):952-970.
[14] YIN M, XIE S, WU Z, et al. Subspace clustering via learning an adaptive low-rank graph[J]. IEEE Transactions on Image Processing, 2018, 27(8):3716-3728.
[15] WANG Weiwei, YANG Chunyu, CHEN Huazhu, et al. Unified discriminative and coherent semi-supervised subspace clustering[J]. IEEE Transactions on Image Processing, 2018, 27(5):2461-2470.
[16] LIU Y, LIU K, ZHANG C, et al. Entropy-based active sparse subspace clustering[J]. Multimedia Tools and Applications, 2018, 77:22281-22297.
[17] WANG J, WANG X, TIAN F, et al. Constrained low-rank representation for robust subspace clustering[J]. IEEE Transactions on Cybernetics, 2017, 47(12):4534-4546.
[18] WAGSTAFF K, CARDIE C, ROGERS S, et al. Constrained k-means clustering with background knowledge[C] //Proceedings of the Eighteenth International Conference on Machine Learning. MA, USA: Morgan Kaufmann Publishers Inc, 2001:577-584.
[19] LUXBURG U V. A tutorial on spectral clustering[J]. Statistics & Computing, 2007, 17(4):395-416.
[20] NIE F, WANG H, CAI X, et al. Robust matrix completion via joint schatten p-norm and lp-norm minimization[C] //Proceedings of IEEE International Conference on Data Mining Series. Brussels, Belgium: IEEE, 2012:566-574.
[1] Delei CHEN,Cheng WANG,Jianwei CHEN,Yiyin WU. GRU-based collaborative filtering recommendation algorithm with active learning [J]. Journal of Shandong University(Engineering Science), 2020, 50(1): 21-27,48.
[2] DING Yan, LI Yong-zhong*. Research on intrusion detection algorithm based on PCA and semisupervised clustering [J]. JOURNAL OF SHANDONG UNIVERSITY (ENGINEERING SCIENCE), 2012, 42(5): 41-46.
[3] XIE Huo-sheng, LIU Min. An ensemble co-training algorithm based on active learning [J]. JOURNAL OF SHANDONG UNIVERSITY (ENGINEERING SCIENCE), 2012, 42(3): 1-5.
[4] ZHANG You-xin, WANG Li-hong. Two-stage semi-supervised clustering algorithm based on affinity propagation [J]. JOURNAL OF SHANDONG UNIVERSITY (ENGINEERING SCIENCE), 2012, 42(2): 18-22.
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!