REDUS: Finding Reducible Subspaces in High Dimensional Data.

Area of Science:

• Data Science
• Machine Learning
• High-Dimensional Data Analysis

Background:

• Traditional methods like feature selection and dimensionality reduction focus on global patterns in high-dimensional data.
• Emerging applications require identifying local latent patterns within feature subspaces, which global methods may miss.

Purpose of the Study:

• To investigate the identification of strong linear and nonlinear correlations within feature subspaces of high-dimensional data.
• To formalize this problem as identifying reducible subspaces.

Main Methods:

• The study presents an algorithm named REDUS for finding reducible subspaces.
• Key components include identifying the overall reducible subspace and then individual reducible subspaces.

Main Results:

• Experimental evaluations demonstrate the effectiveness of the REDUS algorithm.
• The algorithm successfully uncovers hidden correlations in feature subspaces.

Conclusions:

• The REDUS algorithm provides an effective solution for finding local latent patterns in high-dimensional data.
• Identifying reducible subspaces is crucial for analyzing complex datasets where global patterns are insufficient.