.png){kind=icon}
Return
A unified framework for semi-supervised dimensionality reduction
.png){kind=icon}
PRE
AI
DOI：10.1016/j.patcog.2008.01.001.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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. (c) 2008 Elsevier Ltd. All rights reserved.
Keywords:
dimensionality reduction
discriminant analysis
manifold analysis
semi-supervised learning
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7.6
Papers:
1.3W
Citations:
4.5W
Organization
Cited Papers
ShareSaveShareSaveShareSaveShareSaveShareSaveShareSaveNonlinear Fisher discriminant analysis using a minimum squared error cost function and the orthogonal least squares algorithm.png)
NEURAL NETWORKS
OAAI
NEURAL NETWORKSIF6.3
OAAIShareSave
View more