日韩性视频-久久久蜜桃-www中文字幕-在线中文字幕av-亚洲欧美一区二区三区四区-撸久久-香蕉视频一区-久久无码精品丰满人妻-国产高潮av-激情福利社-日韩av网址大全-国产精品久久999-日本五十路在线-性欧美在线-久久99精品波多结衣一区-男女午夜免费视频-黑人极品ⅴideos精品欧美棵-人人妻人人澡人人爽精品欧美一区-日韩一区在线看-欧美a级在线免费观看

歡迎訪問 生活随笔!

生活随笔

當前位置: 首頁 > 编程资源 > 编程问答 >内容正文

编程问答

Machine Learning week 7 quiz: Unsupervised Learning

發布時間:2025/3/21 编程问答 11 豆豆
生活随笔 收集整理的這篇文章主要介紹了 Machine Learning week 7 quiz: Unsupervised Learning 小編覺得挺不錯的,現在分享給大家,幫大家做個參考.

Unsupervised Learning

5?試題

1.?

For which of the following tasks might K-means clustering be a suitable algorithm? Select all that apply.

Given historical weather records, predict if tomorrow's weather will be sunny or rainy.

Given many emails, you want to determine if they are Spam or Non-Spam emails.

Given a set of news articles from many different news websites, find out what are the main topics covered.

From the user usage patterns on a website, figure out what different groups of users exist.

2.?

Suppose we have three cluster centroids?μ1=[12],?μ2=[?30]?and?μ3=[42]. Furthermore, we have a training example?x(i)=[?12]. After a cluster assignment step, what will?c(i)?be?

c(i)=3

c(i)=1

c(i)=2

c(i)?is not assigned

3.?

K-means is an iterative algorithm, and two of the following steps are repeatedly carried out in its inner-loop. Which two?

The cluster assignment step, where the parameters?c(i)?are updated.

Move the cluster centroids, where the centroids?μk?are updated.

Move each cluster centroid?μk, by setting it to be equal to the closest training example?x(i)

The cluster centroid assignment step, where each cluster centroid?μi?is assigned (by setting?c(i)) to the closest training example?x(i).

4.?

Suppose you have an unlabeled dataset?{x(1),,x(m)}. You run K-means with 50 different random

initializations, and obtain 50 different clusterings of the

data. What is the recommended way for choosing which one of

these 50 clusterings to use?

Plot the data and the cluster centroids, and pick the clustering that gives the most "coherent" cluster centroids.

Use the elbow method.

Manually examine the clusterings, and pick the best one.

Compute the distortion function?J(c(1),,c(m),μ1,,μk), and pick the one that minimizes this.

5.?

Which of the following statements are true? Select all that apply.

Once an example has been assigned to a particular centroid, it will never be reassigned to another different centroid

K-Means will always give the same results regardless of the initialization of the centroids.

A good way to initialize K-means is to select K (distinct) examples from the training set and set the cluster centroids equal to these selected examples.

On every iteration of K-means, the cost function?J(c(1),,c(m),μ1,,μk)?(the distortion function) should either stay the same or decrease; in particular, it should not increase.

總結

以上是生活随笔為你收集整理的Machine Learning week 7 quiz: Unsupervised Learning的全部內容,希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯,歡迎將生活随笔推薦給好友。