Unsupervised feature selection based on self-representation sparse regression and local similarity preserving

被引:15
作者
Shang, Ronghua [1 ]
Chang, Jiangwei [1 ]
Jiao, Licheng [1 ]
Xue, Yu [2 ]
机构
[1] Xidian Univ, Sch Artificial Intelligence, Minist Educ China, Key Lab Intelligent Percept & Image Understanding, Xian 710071, Shaanxi, Peoples R China
[2] Nanjing Univ Informat Sci & Technol, Sch Comp & Software, Nanjing, Jiangsu, Peoples R China
基金
中国国家自然科学基金;
关键词
Unsupervised feature selection; Sparse reconstruction; Similarity preserving; L2; 1; (2)-matrix norm; SUPERVISED FEATURE-SELECTION; MUTUAL INFORMATION; FEATURE-EXTRACTION; CLASSIFICATION; ALGORITHM;
D O I
10.1007/s13042-017-0760-y
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Feature selection, as an indispensable method of data preprocessing, has attracted the attention of researchers. In this paper, we propose a new feature selection model called unsupervised feature selection based on self-representation sparse regression and local similarity preserving, i.e., UFSRL. Specifically, UFSRL is sparse reconstruction of the original data itself, rather than fitting low-dimensional embedding, and the manifold learning exerted on UFSRL model to preserve the local similarity of the data. Moreover, the l(2,1/2)-matrix norm has been imposed on the coefficient matrix, which make the proposed model sparse and robust to noise. In order to solve the proposed model, we design an effective iterative algorithm, and present the analysis of its convergence. Extensive experiments on eight synthetic and real-world data-sets are conducted, and the results of UFSRL compared with six corresponding feature selection algorithms. The experimental results show that UFSRL can effectively identify the feature subset with discriminative while reconstructing the data sparsely, and it is superior to some unsupervised feature selection algorithms in clustering performance.
引用
收藏
页码:757 / 770
页数:14
相关论文
共 56 条
[1]  
[Anonymous], TMM
[2]  
[Anonymous], IEEE T NEURAL NETW L
[3]  
[Anonymous], TPAMI
[4]  
[Anonymous], TIP
[5]  
[Anonymous], 2012, P 18 ACM SIGKDD INT
[6]  
[Anonymous], TKDE
[7]  
[Anonymous], 2007, P 24 INT C MACH LEAR
[8]  
[Anonymous], TPAMI
[9]  
Cai D., 2010, P 16 ACM SIGKDD INT, P333, DOI [10.1145/1835804.1835848, DOI 10.1145/1835804.1835848]
[10]   FAST ALGORITHMS FOR NONCONVEX COMPRESSIVE SENSING: MRI RECONSTRUCTION FROM VERY FEW DATA [J].
Chartrand, Rick .
2009 IEEE INTERNATIONAL SYMPOSIUM ON BIOMEDICAL IMAGING: FROM NANO TO MACRO, VOLS 1 AND 2, 2009, :262-265