Local Learning Projections
Abstract
This paper presents a Local Learning Projection (LLP) approach for linear dimensionality reduction. We first point out that the well known Principal Component Analysis (PCA) essentially seeks the pro jection that has the minimal global estimation error. Then we propose a dimensionality reduction algorithm that leads to the pro jection with the minimal local estimation error, and elucidate its advantages for classification tasks. We also indicate that LLP keeps the local information in the sense that the pro jection value of each point can be well estimated based on its neighbors and their pro jection values. Experimental results are provided to validate the effiectiveness of the proposed algorithm.
Cite
Text
Wu et al. "Local Learning Projections." International Conference on Machine Learning, 2007. doi:10.1145/1273496.1273627Markdown
[Wu et al. "Local Learning Projections." International Conference on Machine Learning, 2007.](https://mlanthology.org/icml/2007/wu2007icml-local/) doi:10.1145/1273496.1273627BibTeX
@inproceedings{wu2007icml-local,
title = {{Local Learning Projections}},
author = {Wu, Mingrui and Yu, Kai and Yu, Shipeng and Schölkopf, Bernhard},
booktitle = {International Conference on Machine Learning},
year = {2007},
pages = {1039-1046},
doi = {10.1145/1273496.1273627},
url = {https://mlanthology.org/icml/2007/wu2007icml-local/}
}