A dimensionality reduction method of continuous dependent variables based supervised Laplacian eigenmaps

ABSTRACT

Dimensionality reduction is one of the important preprocessing steps in high-dimensional data analysis. In this paper we propose a supervised manifold learning method, it makes use of the information of continuous dependent variables to distinguish intrinsic neighbourhood and extrinsic neighbourhood of data samples, and construct two graphs according to these two kinds of neighbourhoods. Following the idea of Laplacian eigenmaps, we reveal that on the low-dimensional manifold the neighbourhood structure can be preserved or even improved. Our approach has two important characteristics: (i) it uses dependent variables to find an informative low-dimensional projection which is robust to noisy independent variables and (ii) the objective function simultaneously enlarges the distance between dissimilar samples and pushes similar samples close to each other according to the graph constructed with the help of continuous dependent variables. Our experiments demonstrate that the effectiveness of our method is over their traditional rivals.

Keywords:

• Dimensionality reduction
• supervised learning
• continuous dependent variables
• Laplacian graph
• neighbourhood

Disclosure statement

No potential conflict of interest was reported by the author.