Chevron Left
返回到 Machine Learning: Clustering & Retrieval

学生对 华盛顿大学 提供的 Machine Learning: Clustering & Retrieval 的评价和反馈

4.6
2,301 个评分

课程概述

Case Studies: Finding Similar Documents A reader is interested in a specific news article and you want to find similar articles to recommend. What is the right notion of similarity? Moreover, what if there are millions of other documents? Each time you want to a retrieve a new document, do you need to search through all other documents? How do you group similar documents together? How do you discover new, emerging topics that the documents cover? In this third case study, finding similar documents, you will examine similarity-based algorithms for retrieval. In this course, you will also examine structured representations for describing the documents in the corpus, including clustering and mixed membership models, such as latent Dirichlet allocation (LDA). You will implement expectation maximization (EM) to learn the document clusterings, and see how to scale the methods using MapReduce. Learning Outcomes: By the end of this course, you will be able to: -Create a document retrieval system using k-nearest neighbors. -Identify various similarity metrics for text data. -Reduce computations in k-nearest neighbor search by using KD-trees. -Produce approximate nearest neighbors using locality sensitive hashing. -Compare and contrast supervised and unsupervised learning tasks. -Cluster documents by topic using k-means. -Describe how to parallelize k-means using MapReduce. -Examine probabilistic clustering approaches using mixtures models. -Fit a mixture of Gaussian model using expectation maximization (EM). -Perform mixed membership modeling using latent Dirichlet allocation (LDA). -Describe the steps of a Gibbs sampler and how to use its output to draw inferences. -Compare and contrast initialization techniques for non-convex optimization objectives. -Implement these techniques in Python....

热门审阅

JM

Jan 16, 2017

Excellent course, well thought out lectures and problem sets. The programming assignments offer an appropriate amount of guidance that allows the students to work through the material on their own.

BK

Aug 24, 2016

excellent material! It would be nice, however, to mention some reading material, books or articles, for those interested in the details and the theories behind the concepts presented in the course.

筛选依据:

151 - Machine Learning: Clustering & Retrieval 的 175 个评论(共 381 个)

创建者 Daniel R

Aug 16, 2016

创建者 Yifei L

Jul 30, 2016

创建者 Victor C

Jun 24, 2017

创建者 Guillermo O d A

Jun 4, 2022

创建者 Francisco R M

Mar 19, 2021

创建者 Moayyad Y

Dec 4, 2016

创建者 Lawrence G

Sep 2, 2016

创建者 Divyang S

Sep 13, 2020

创建者 Yong D K

May 7, 2018

创建者 Sameer M

Sep 19, 2017

创建者 陈佳艺

May 17, 2017

创建者 Joseph P

Jan 16, 2017

创建者 Manoj K

Nov 26, 2018

创建者 Siwei Y

Jan 17, 2017

创建者 Oleg B

Dec 3, 2016

创建者 Niu K

Jan 3, 2019

创建者 Vladimir V

Jun 27, 2017

创建者 Kishore P V

Oct 5, 2016

创建者 Jaswant J

Mar 31, 2017

创建者 Yang X

Nov 14, 2017

创建者 Sean L

Oct 4, 2016

创建者 Banka C G

Aug 10, 2019

创建者 Yufeng X

Jul 9, 2019

创建者 Anmol g

Dec 16, 2016

创建者 seokwon y

Jul 26, 2018