Abstract

Dimensionality reduction is among the keys in many fields, most of the traditional method can be categorized as local or global ones. In this paper, we consider the dimension reduction problem with prior information is available, namely, semi-supervised dimension reduction. A new dimension reduction method that can explore both the labeled and unlabeled information in the dataset is proposed. The labeled data points are used to maximize the separability between different classes and the unlabeled data points are used to estimate the intrinsic geometric structure of the data. Specifically, we aim to learn a discriminant function which is as smooth as possible on the data manifold. The target optimization problem involved can be solved efficiently with eigenvalue decomposition. Experimental results on several datasets demonstrate the effectiveness of our method.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.