Kernel propagation strategy: A novel out-of-sample propagation projection for subspace learning

4Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.

Abstract

Kernel matrix optimization (KMO) aims at learning appropriate kernel matrices by solving a certain optimization problem rather than using empirical kernel functions. Since KMO is difficult to compute out-of-sample projections for kernel subspace learning, we propose a kernel propagation strategy (KPS) based on data distribution similar principle to effectively extract out-of-sample low-dimensional features for subspace learning with KMO. With KPS, we further present an example algorithm, i.e., kernel propagation canonical correlation analysis (KPCCA), which naturally fuses semi-supervised kernel matrix learning and canonical correlation analysis by means of kernel propagation projections. In KPCCA, the extracted correlation features of out-of-sample data not only incorporate integral data distribution information but also supervised information. Extensive experimental results have demonstrated the superior performance of our proposed method.

Cite

CITATION STYLE

APA

Su, S., Ge, H., & Yuan, Y. H. (2016). Kernel propagation strategy: A novel out-of-sample propagation projection for subspace learning. Journal of Visual Communication and Image Representation, 36, 69–79. https://doi.org/10.1016/j.jvcir.2016.01.007

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