Neighbourhood preserving based semi-supervised dimensionality reduction
Authors:
- 25 September 2008
- journal article
- Published by Institution of Engineering and Technology (IET) in Electronics Letters
- Vol. 44 (20) , 1190-1192
Abstract
A semi-supervised linear dimensionality reduction method based on side information and neighbourhood preserving is proposed. In this problem, only must-link constraints (pairs of instances belong to the same class) and cannot-link constraints (pairs of instances belong to different classes) are given. The proposed neighbourhood preserving based semi-supervised dimensionality reduction algorithm can not only preserve the must-link and cannot-link constraints but can preserve the local structure of the input data in the low dimensional embedding subspace. Experimental results on several datasets demonstrate the effectiveness of the method.Keywords
This publication has 5 references indexed in Scilit:
- The CMU pose, illumination, and expression databaseIEEE Transactions on Pattern Analysis and Machine Intelligence, 2003
- Laplacian Eigenmaps for Dimensionality Reduction and Data RepresentationNeural Computation, 2003
- From few to many: illumination cone models for face recognition under variable lighting and poseIEEE Transactions on Pattern Analysis and Machine Intelligence, 2001
- Nonlinear Dimensionality Reduction by Locally Linear EmbeddingScience, 2000
- Eigenfaces vs. Fisherfaces: recognition using class specific linear projectionIEEE Transactions on Pattern Analysis and Machine Intelligence, 1997