人工智能课件AI2014S_Chap07MixtureModelsandEM幻灯片.pptxVIP

人工智能课件AI2014S_Chap07MixtureModelsandEM幻灯片.pptx

  1. 1、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。。
  2. 2、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载
  3. 3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
  4. 4、该文档为VIP文档,如果想要下载,成为VIP会员后,下载免费。
  5. 5、成为VIP后,下载本文档将扣除1次下载权益。下载后,不支持退款、换文档。如有疑问请联系我们
  6. 6、成为VIP后,您将拥有八大权益,权益包括:VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
  7. 7、VIP文档为合作方或网友上传,每下载1次, 网站将根据用户上传文档的质量评分、类型等,对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档
查看更多
Artificial Intelligence Mixture Models and EMDonghui WangAI Institute@ZJU2014.4ContentsK-means clusteringMixtures of GaussiansAn alternative view of EMThe EM algorithm in generalReferences:Bishop. “Pattern Recognition and Machine Learning”, Chapter 9. 2006.K-means clusteringK-means clusteringSuppose we have a data set {x1, x2, …, xN} in D-dimensional space and these data points have an intrinsic structure of K clusters.We use μk as a prototype associated with the kth cluster.Goal: find an assignment of data points to clusters such that some objective function.K-means clusteringResponsibilitiesPrototypes (expected value )DataK-means algorithm (batch version):Pick number of clusters kRandomly scatter k “cluster centers” in data spaceRepeat:Assign each data point to its closest cluster centerMove each cluster center to the mean of the points assigned to itExample: 5 data points and 3 clustersDistortion measure (responsibilities):K-means clusteringThe procedure of k-means algorithm:K-means clusteringThe convergence of J:K-means clusteringThe nearest prototype to xnOnline k-means algorithm (sequential k-means):K-medoids algorithm:Chooses input data points as centers;Works with an arbitrary matrix of distances between data points instead of Euclidean distance.E.g. Manhattan distance or Minkowski distanceThe applications of K-means algorithmImage segmentation:The applications of K-means algorithmImage clustering and 3D objects clustering:The applications of K-means algorithmNews video clustering and video key frame extraction:The limitation of K-means clusteringThe K-means algorithm often convergence to a local minimum.The limitation of K-means clusteringThe K-means algorithm adopts the hard assignment and doesn’t consider the data density and probabilistic distribution.The limitation of K-means clusteringThe K-means algorithm adopts the hard assignment and doesn’t consider the data density and probabilistic distribution.Mixtures of GaussiansGaussian mixture distributionDe

您可能关注的文档

文档评论(0)

开心农场 + 关注
实名认证
文档贡献者

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

1亿VIP精品文档

相关文档