Unsupervised feature selection with adaptive residual preserving

被引:13
作者
Teng, Luyao [1 ]
Feng, Zhenye [2 ]
Fang, Xiaozhao [2 ]
Teng, Shaohua [2 ]
Wang, Hua [1 ]
Kang, Peipei [2 ]
Zhang, Yanchun [1 ]
机构
[1] Victoria Univ, VU Res, Inst Sustainable Ind & Liveable Cities, Ballarat Rd, Footscray, Vic 3011, Australia
[2] Guangdong Univ Technol, Sch Comp Sci & Technol, Guangzhou 510006, Guangdong, Peoples R China
基金
中国国家自然科学基金;
关键词
Residual preserving; Unsupervised learning; Feature selection; Unified learning framework; Sparse representation; DIMENSIONALITY REDUCTION; DISCRIMINANT-ANALYSIS; SIGNAL RECOVERY; PROJECTIONS; FRAMEWORK; L1-NORM;
D O I
10.1016/j.neucom.2019.05.097
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Many feature selection approaches are proposed in recent years. Most approaches utilize graph-based methods in studying the structure and relationship among data. However, many data relationships may loss during the graph construction, such as the residual relationships. To better preserve the relationships between data, in this paper, we propose a novel unified learning framework - unsupervised feature selection with adaptive residual preserving (UFSARP). The framework unifies feature selection, data reconstruction, and local residual preserving into one unified process, in which these tasks are completed simultaneously. We use the distance of projected data to learn the similarity matrix and simultaneously impose it on the data representation term to enforce that similar samples have similar reconstruction residuals. The use of such learning way has three-fold advantages: (1) The reconstruction residuals aim to maintain the residual relationships between data samples, namely, similar samples have similar residuals, and this helps to reconstruct the original data better; (2) Imposing the similarity matrix on the data representation term encourages similar samples not only have similar reconstruction residuals but also have similar reconstruction coefficients; (3) The similarity matrix and the reconstruction coefficient can be promoted by each other during the learning process. The experimental results show that the proposed algorithm is superior to other similar researches. (C) 2019 Elsevier B.V. All rights reserved.
引用
收藏
页码:259 / 272
页数:14
相关论文
共 67 条
[1]   Merlin-rapid analysis of dense genetic maps using sparse gene flow trees [J].
Abecasis, GR ;
Cherny, SS ;
Cookson, WO ;
Cardon, LR .
NATURE GENETICS, 2002, 30 (01) :97-101
[2]  
[Anonymous], DIGITAL IMAGE PROCES
[3]  
[Anonymous], IISC LECT NOTES SER
[4]  
[Anonymous], FOUND TRENDS MACH LE
[5]  
[Anonymous], 2011, IJCAI INT JOINT C AR
[6]  
[Anonymous], ARTIF INTELL RES
[7]  
[Anonymous], P IEEE T KNOWL DAT E
[8]  
[Anonymous], IEEE ED ACTIV DEP
[9]  
[Anonymous], KNOWL BASED SYST
[10]  
[Anonymous], 2018, IEEE T NEURAL NETW L