4.7 Article

Low-rank adaptive graph emb e dding for unsupervise d feature extraction

Journal

PATTERN RECOGNITION
Volume 113, Issue -, Pages -

Publisher

ELSEVIER SCI LTD
DOI: 10.1016/j.patcog.2020.107758

Keywords

Low-rank regression; Jointly sparse learning; Adaptive graph embedding; Unsupervised feature extraction

Funding

  1. Natural Science Foundation of China [61976145, 62076164, 61802267, Grant61732011]
  2. Shenzhen Municipal Science and Technology Innovation Council [JCYJ20180305124834854, JCYJ20190813100801664]

Ask authors/readers for more resources

The LRAGE method performs subspace learning and adaptive probabilistic neighborhood graph embedding based on reconstruction error minimization. It explores the underlying correlation structure of data and learns more informative projection through low-rank constraint and L2, 1-norm penalty regularization. Comparisons with similar models on synthetic and real-world data sets demonstrate the superiority of LRAGE.
Most of manifold learning based feature extraction methods are two-step methods, which first construct a weighted neighborhood graph and then use the pre-constructed graph to perform subspace learning. As a result, these methods fail to use the underlying correlation structure of data to learn an adaptive graph to preciously characterize the similarity relationship between samples. To address this problem, we propose a novel unsupervised feature extraction method called low-rank adaptive graph embedding (LRAGE), which can perform subspace learning and adaptive probabilistic neighborhood graph embedding simultaneously based on reconstruction error minimization. The proposed LRAGE is imposed with low-rank constraint for the sake of exploring the underlying correlation structure of data and learning more informative projection. Moreover, the L 2 , 1-norm penalty is imposed on the regularization to further enhance the robustness of LRAGE. Since the resulting objective function has no closed-form solutions, an iterative optimization algorithm is elaborately designed. The convergence of the proposed algorithm is proved and the corresponding computational complexity analysis is also presented. In addition, we explore the potential properties of the proposed LRAGE by comparing it with several similar models on both synthetic and real-world data sets. Extensive experiments on five well-known face data sets and three non-face data sets demonstrate the superiority of the proposed LRAGE. (c) 2020 Elsevier Ltd. All rights reserved.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.7
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available