摘要

Latent variable model (LVM) is a kind of efficient nonlinear dimensionality reduction algorithm through establishing smooth kernel mappings from the latent space to the data space. However, this kind of mappings cannot keep the points close in the latent space even they are close in data space. A LVM is proposed based on locality preserving projection (LPP) which can preserve the locality structure of dataset. The objective function of LPP is considered as a prior of the variables in the Gaussian process latent variable model (GP-LVM). The proposed locality preserving GP-LVM is built with the constrained term of the objective function. Compared with the traditional LPP and GP-LVM, experimental results show that the proposed method performs better in preserving local structure on common data sets.

全文