Abstract
In practice, many applications require a dimensionality reduction method to deal with the partially labeled problem. In this paper, we propose a semi-supervised dimensionality reduction framework, which can efficiently handle the unlabeled data. Under the framework, several classical methods, such as principal component analysis (PCA), linear discriminant analysis (LDA), maximum margin criterion (MMC), locality preserving projections (LPP) and their corresponding kernel versions can be seen as special cases. For high-dimensional data, we can give a low-dimensional embedding result for both discriminating multi-class sub-manifolds and preserving local manifold structure. Experiments show that our algorithms can significantly improve the accuracy rates of the corresponding supervised and unsupervised approaches.
Original language | English |
---|---|
Pages (from-to) | 2789-2799 |
Number of pages | 11 |
Journal | Pattern Recognition |
Volume | 41 |
Issue number | 9 |
DOIs | |
State | Published - Sep 2008 |
Externally published | Yes |
Keywords
- Dimensionality reduction
- Discriminant analysis
- Manifold analysis
- Semi-supervised learning