Global structure-guided neighborhood preserving embedding for dimensionality reduction

被引:0
作者
Can Gao
Yong Li
Jie Zhou
Witold Pedrycz
Zhihui Lai
Jun Wan
Jianglin Lu
机构
[1] Shenzhen University,College of Computer Science and Software Engineering
[2] Guangdong Key Laboratory of Intelligent Information Processing,SZU Branch
[3] Shenzhen Institute of Artificial Intelligence and Robotics for Society,Department of Electrical and Computer Engineering
[4] University of Alberta,Systems Research Institute
[5] Polish Academy of Sciences,undefined
来源
International Journal of Machine Learning and Cybernetics | 2022年 / 13卷
关键词
Dimensionality reduction; Neighborhood preserving embedding; Global structure; Principal component analysis; Structured sparsity;
D O I
暂无
中图分类号
学科分类号
摘要
Graph embedding is one of the most efficient dimensionality reduction methods in machine learning and pattern recognition. Many local or global graph embedding methods have been proposed and impressive results have been achieved. However, little attention has been paid to the methods that integrate both local and global structural information without constructing complex graphs. In this paper, we propose a simple and effective global structure guided neighborhood preserving embedding method for dimensionality reduction called GSGNPE. Specifically, instead of constructing global graph, principal component analysis (PCA) projection matrix is first introduced to extract the global structural information of the original data, and then the induced global information is integrated with local neighborhood preserving structure to generate a discriminant projection. Moreover, the L2,1\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$L_{2,1}$$\end{document}-norm regularization is employed in our method to enhance the robustness to occlusion. Finally, we propose an iterative optimization algorithm to solve the proposed problem, and its convergence is also theoretically analyzed. Extensive experiments on four face and six non-face benchmark data sets demonstrate the competitive performance of our proposed method in comparison with the state-of-the-art methods.
引用
收藏
页码:2013 / 2032
页数:19
相关论文
共 111 条
[1]  
Li Y(2020)A novel feature learning framework for high-dimensional data classification Int J Mach Learn Cybern 26 226-238
[2]  
Chai Y(2018)Large-scale multimodality attribute reduction with multi-kernel fuzzy rough sets IEEE Trans Fuzzy Syst 298 447-467
[3]  
Yin H(2015)Concept learning via granular computing: a cognitive viewpoint Inf Sci 102 107204-770
[4]  
Hu Q(2020)Image decomposition based matrix regression with applications to robust face recognition Pattern Recognit 10 757-1505
[5]  
Zhang L(2019)Unsupervised feature selection based on self-representation sparse regression and local similarity preserving Int J Mach Learn Cybern 24 1491-302
[6]  
Zhou Y(2012)Maximum ambiguity-based sample selection in fuzzy decision tree induction IEEE Trans Knowl Data Eng 378 282-1291
[7]  
Li J(2017)On rule acquisition in incomplete multi-scale decision tables Inf Sci 11 1277-2515
[8]  
Mei C(2020)Object-based feature extraction for hyperspectral data using firefly algorithm Int J Mach Learn Cybern 29 2502-31
[9]  
Xu W(2018)Robust latent subspace learning for image classification IEEE Trans Neural Netw Learn Syst 2 26-171
[10]  
Qian J(2016)Learning from uncertainty for big data: future analytical challenges and strategies IEEE Syst Man Cybern Mag 213 162-411