Chevron Left
返回到 Machine Learning: Clustering & Retrieval

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

2,307 个评分


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....



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.


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.


101 - Machine Learning: Clustering & Retrieval 的 125 个评论(共 381 个)

创建者 Cristian A G F

Dec 30, 2020

创建者 Prasant K S

Dec 20, 2016

创建者 João S

Aug 7, 2016

创建者 Geoff B

Jul 14, 2016

创建者 Susree S M

Nov 14, 2018

创建者 Viktor K

May 14, 2021

创建者 Gaston F

Oct 10, 2016

创建者 Sayan B

Dec 5, 2019

创建者 Suresh K P

Dec 21, 2017

创建者 Gillian P

Jul 23, 2017

创建者 Neemesh J

Oct 28, 2019

创建者 Etienne V

Feb 19, 2017

创建者 Aakash S

Jun 18, 2019

创建者 Renato R S

Aug 27, 2016

创建者 Noor A K

Jul 4, 2020

创建者 Yugandhar D

Oct 29, 2018

创建者 Sathiraju E

Mar 3, 2019

创建者 Moises V

Oct 30, 2016

创建者 Yi W

Sep 27, 2016

创建者 Priyanshu R S

Nov 27, 2020

创建者 austin

Aug 9, 2017

创建者 Val V

Apr 8, 2021

创建者 B P S

May 27, 2020

创建者 Venkateshwaralu S

Aug 7, 2016

创建者 Jifu Z

Jul 22, 2016