.png){kind=icon}
返回
Semi-supervised Gaussian process latent variable model with pairwise constraints
.png){kind=icon}
PRE
AI
DOI：10.1016/j.neucom.2010.01.021.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In machine learning. Gaussian process latent variable model (GP-LVM) has been extensively applied in the field of unsupervised dimensionality reduction. When some supervised information, e.g., pairwise constraints or labels of the data, is available, the traditional GP-LVM cannot directly utilize such supervised information to improve the performance of dimensionality reduction. In this case, it is necessary to modify the traditional GP-LVM to make it capable of handing the supervised or semi-supervised learning tasks. For this purpose, we propose a new semi-supervised GP-LVM framework under the pairwise constraints. Through transferring the pairwise constraints in the observed space to the latent space. the constrained priori information on the latent variables can be obtained. Under this constrained priori, the latent variables are optimized by the maximum a posteriori (MAP) algorithm. The effectiveness of the proposed algorithm is demonstrated with experiments on a variety of data sets. (C) 2010 Elsevier B.V. All rights reserved.
Keyword:
Dimensionality reduction
Gaussian process latent variable model
Pairwise constraints
Semi-supervised learning
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.5
论文数:
2.5W
被引数:
6.5W
机构
引用论文
.png){kind=icon}
Fluorescent Nanostructures from Aromatic Diblock Copolymers via Atom Transfer Radical Polymerization
PREAI
分享收藏Theoretical Foundations for High Performance Order Tracking with the Vold-Kalman Tracking Filter
PREAI
分享收藏
查看更多内容