Sparse unsupervised dimensionality reduction algorithms

3Citations
Citations of this article
13Readers
Mendeley users who have this article in their library.

Abstract

Principal component analysis (PCA) and its dual-principal coordinate analysis (PCO)-are widely applied to unsupervised dimensionality reduction. In this paper, we show that PCA and PCO can be carried out under regression frameworks. Thus, it is convenient to incorporate sparse techniques into the regression frameworks. In particular, we propose a sparse PCA model and a sparse PCO model. The former is to find sparse principal components, while the latter directly calculates sparse principal coordinates in a low-dimensional space. Our models can be solved by simple and efficient iterative procedures. Finally, we discuss the relationship of our models with other existing sparse PCA methods and illustrate empirical comparisons for these sparse unsupervised dimensionality reduction methods. The experimental results are encouraging. © 2010 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Dou, W., Dai, G., Xu, C., & Zhang, Z. (2010). Sparse unsupervised dimensionality reduction algorithms. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6321 LNAI, pp. 361–376). https://doi.org/10.1007/978-3-642-15880-3_29

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free