5 April 2021 in IEEE Access
Dimensionality reduction is a hot research topic in pattern recognition. Traditional dimensionality reduction methods can be separated into linear dimensionality reduction methods and nonlinear dimensionality reduction methods. Linear dimensionality reduction methods usually utilize Euclidean distances to explore global geometric structures, and nonlinear dimensionality reduction methods can preserve local manifold structures in learned low-dimensional subspaces. However, redundant information and noises of the raw high-dimensional data restrict the classification performance of these methods. To solve the problem, we propose a novel orthogonal dimensionality reduction method based on twin eigen decomposition called orthogonal locality and globality preserving projections (OLGPP). Orthogonality, as a commonly used criterion in pattern recognition, is insensitive to the redundant information and the noises. OLGPP not only combines the advantages of global Euclidean structures and local manifold structures, but also is insensitive to the redundant information and noises of the raw high-dimensional data by embedding the orthogonality criterion. Additionally, the objective function based on twin eigen decomposition can be solved sequentially to obtain analytical solutions. On four well-known datasets, we design extensive experiments to evaluate the performance of OLGPP. From the experimental results, OLGPP has the optimal experimental results, and its average recognition rates are about 10% higher than the classic local dimensionality reduction method (i.e., locality preserving projection), which proves OLGPP is an effective dimensionality reduction method.
21 November 2025 in Neural Networks
23 March 2025 in Digital Signal Processing
15 May 2025 in Intelligent Data Analysis: An International Journal
Subspace clustering (SC) approximates high-dimensional data as a combination of low-dimensional subspaces, which is suitable for high-dimensional data analysis across various domains including image segmentation and face recognition. Existing SC methods typically obtain the global structure representation solely through the self-representation of the samples, thereby neglecting the intrinsic local connections among the samples. Moreover, due to their inherent framework design, obtaining additional a priori information in unsupervised scenarios presents a significant challenge. To address these limitations, this paper proposes a new method, named Sample-Dependent Subspace Clustering with Elastic Structure Consistency Constraints (SDSC). Firstly, we introduce a new Elastic Structure Consistency Constraints (ESCC) strategy to measure global and local structures elastically. Benefiting from this strategy, SDSC can flexibly explore the structural information within the samples to obtain a comprehensive data representation. By employing the joint regularization term, SDSC can learn effective cluster assignment information directly from the constrained structured data representation, and the cluster assignment information and representation coefficient matrix are smoothly integrated into a unified framework and learn in a mutually reinforcing manner. This learning approach contributes to comprehensive and high-quality clustering results, enhancing the robustness and utility of SDSC. Extensive experiments on several real-world benchmarks and synthetic datasets demonstrate the feasibility and effectiveness of SDSC.