Scaled robust linear embedding with adaptive neighbors preserving

Yunlong Gao, Qinting Wu, Xinjing Wang, Tingting Lin, Jinyan Pan, Chao Cao, Guifang Shao, Qingyuan Zhu, Feiping Nie

Research output: Contribution to journalArticlepeer-review

Abstract

Manifold learning studies the invariability of geometry in continuous deformation. In recent years, feature space learning methods usually extract and preserve the essential structure of manifold data by preserving the affinity relationship between sample points in the embedded space, namely, the invariant property. However, in this paper, we find that only considering the affinity relationship cannot effectively extract and preserve the essential structure of data in the embedded space. Additionally, to solve the out-of-samples problem, manifold learning uses linear embedding instead of nonlinear embedding to preserve the manifold structure of data. However, linear embedding assumes that manifold data are global linear manifolds, thus the coupling of different local regions and the diversity in the spatial scales of different regions will further distort the original data and impair the efficiency of linear embedding for preserving the essential structure of data. To solve this problem, this paper proposes scaled robust linear embedding with adaptive neighbors preserving (SLE), which introduces the adaptive weighting based on local statistical characteristics to achieve flexible embedding for manifold data, where the adaptive weights can be regarded as the elastic deformation coefficients of local manifold structures of data. Due to the adaptive elastic deformation, SLE can reduces the gap between nonlinear embedding and linear embedding, thus improving the ability of linear embedding to preserve the essential structure of data. Moreover, SLE integrates the learning of elastic deformation coefficients, similarity learning, and subspace learning into a unified framework, therefore, the combination optimality of these three variables is guaranteed. An efficient alternative optimization algorithm is proposed to solve the challenging optimization problem, the theoretical analysis of its computational complexity and convergence is also performed in this paper. Eventually, SLE has been extensively experimented on both artificial and real-world datasets and compared with current state-of-the-art algorithms. The experimental results indicate that SLE has a strong ability in uncovering and preserving the essential structure of data in linear embedding space.

Original languageEnglish
Article number111625
JournalPattern Recognition
Volume165
DOIs
StatePublished - Sep 2025

Keywords

  • Dimension reduction
  • Feature extraction
  • Graph learning
  • Linear embedding
  • Manifold learning

Fingerprint

Dive into the research topics of 'Scaled robust linear embedding with adaptive neighbors preserving'. Together they form a unique fingerprint.

Cite this