网站大量收购独家精品文档,联系QQ:2885784924

Machine Learning II (advanced machine learning)(PDF)l11资料.ppt

Machine Learning II (advanced machine learning)(PDF)l11资料.ppt

  1. 1、本文档共36页,可阅读全部内容。
  2. 2、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。
  3. 3、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载
  4. 4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
查看更多
Machine Learning II (advanced machine learning)(PDF)l11资料

Dimensionality Reduction with PCA * gaelvaroquaux@ Linear: Principal Components Fit multivariate Gaussian Compute eigenvectors of Covariance Project onto eigenvectors with largest eigenvalues * Other examples of unsupervised learning * Mean face (after alignment) Slide credit: Santiago Serrano Eigenfaces * Slide credit: Santiago Serrano Non-Linear Techniques Isomap Local Linear Embedding * Isomap, Science, M. Balasubmaranian and E. Schwartz Scape (Drago Anguelov et al) * * * I gave each pixel the mean intensity or mean color of its cluster --- this is basically just vector quantizing the image intensities/colors. Notice that there is no requirement that clusters be spatially localized and they’re not. * here c(x) is a vector of filter outputs. A natural thing to do is to square the outputs of a range of different filters at different scales and orientations, smooth the result, and rack these into a vector. * This is figure 14.18 CS 221: Artificial Intelligence Lecture 6: Advanced Machine Learning Sebastian Thrun and Peter Norvig Slide credit: Mark Pollefeys, Dan Klein, Chris Manning * Outline Clustering K-Means EM Spectral Clustering Dimensionality Reduction * The unsupervised learning problem * Many data points, no labels Unsupervised Learning? Google Street View * K-Means * Many data points, no labels K-Means Choose a fixed number of clusters Choose cluster centers and point-cluster allocations to minimize error can’t do this by exhaustive search, because there are too many possible allocations. Algorithm fix cluster centers; allocate points to closest cluster fix allocation; compute best cluster centers x could be any set of features for which we can compute a distance (careful about scaling) * From Marc Pollefeys COMP 256 2003 * K-Means * K-Means * From Marc Pollefeys COMP 256 2003 * K-means clustering using intensity alone and color alone Image Clusters on intensity Clusters on color * From Marc Pollefeys COMP 256 2003 Results of K-Means Clustering: *

文档评论(0)

seunk + 关注
实名认证
内容提供者

该用户很懒,什么也没介绍

1亿VIP精品文档

相关文档