机器学习的几何观点-LAMDA.PPTVIP

  • 5
  • 0
  • 约7.51千字
  • 约 47页
  • 2018-02-02 发布于天津
  • 举报
机器学习的几何观点-LAMDA

Unlabeled Data to Estimate Geometry Measured (labeled) points: discriminant structure Unmeasured (unlabeled) points: geometrical structure Compute nearest neighbor graph G * Unlabeled Data to Estimate Geometry Measured (labeled) points: discriminant structure Unmeasured (unlabeled) points: geometrical structure Compute nearest neighbor graph G * Laplacian Regularized Least Square (Belkin and Niyogi, 2006) Linear objective function Solution * Active Learning How to find the most representative points on the manifold? * Objective: Guide the selection of the subset of data points that giv

文档评论(0)

1亿VIP精品文档

相关文档