吴en达机器学习课后作业源码及笔记.zip资源-CSDN文库

共47个文件

mat：18个

txt：10个

pdf：8个

版权申诉

机器学习

人工智能

14 浏览量 2022-04-06 14:41:32 上传评论收藏 31.42MB ZIP 举报

资源推荐

资源详情

资源评论

收起资源包目录

吴en达机器学习课后作业源码及笔记.zip （47个子文件）

吴en达机器学习课后作业源码及笔记

ex1-linear regression

线性回归.ipynb 161KB

ex1data1.txt 1KB

ex1.pdf 478KB

ex1data2.txt 704B

ex8-anomaly detection and recommendation

data

ex8_movies.mat 218KB

movie_ids.txt 49KB

ex8_movieParams.mat 196KB

ex8data2.mat 91KB

ex8data1.mat 9KB

ex8.pdf 242KB

异常检测和推荐系统.ipynb 163KB

ex7-kmeans and PCA

K-均值算法和主成分分析.ipynb 347KB

data

ex7data1.mat 995B

ex7faces.mat 10.52MB

ex7data2.mat 5KB

bird_small.mat 45KB

bird_small.png 32KB

ex7.pdf 699KB

吴恩达作业常用函数检索.md 25KB

ex4-NN back propagation

ex4.pdf 348KB

ex4weights.mat 78KB

ex4data1.mat 7.16MB

神经网络反向传播.ipynb 97KB

ex2-logistic regression

ex2data2.txt 2KB

ex2data1.txt 4KB

逻辑回归.ipynb 194KB

ex2.pdf 228KB

ex5-bias vs variance

ex5data1.mat 1KB

偏差vs方差.ipynb 118KB

ex5.pdf 183KB

ex3-neural network

多分类和神经网络.ipynb 93KB

ex3.pdf 287KB

ex3data1.mat 7.16MB

ex3weights.mat 78KB

吴恩达作业常用函数检索.docx 1.87MB

ex6-SVM

data

spamSample2.txt 253B

vocab.txt 22KB

ex6data1.mat 981B

ex6data2.mat 7KB

emailSample2.txt 1KB

ex6data3.mat 6KB

spamTest.mat 110KB

emailSample1.txt 403B

spamTrain.mat 419KB

spamSample1.txt 697B

ex6.pdf 328KB

支持向量机.ipynb 272KB

Programming Exercise 7:

K-means Clustering and Principal Component

Analysis

Machine Learning

Introduction

In this exercise, you will implement the K-means clustering algorithm and

apply it to compress an image. In the second part, you will use principal

component analysis to ﬁnd a low-dimensional representation of face images.

Before starting on the programming exercise, we strongly recommend watch-

ing the video lectures and completing the review questions for the associated

topics.

To get started with the exercise, you will need to download the starter

code and unzip its contents to the directory where you wish to complete the

exercise. If needed, use the cd command in Octave/MATLAB to change to

this directory before starting this exercise.

You can also ﬁnd instructions for installing Octave/MATLAB in the “En-

vironment Setup Instructions” of the course website.

Files included in this exercise

ex7.m - Octave/MATLAB script for the ﬁrst exercise on K-means

ex7 pca.m - Octave/MATLAB script for the second exercise on PCA

ex7data1.mat - Example Dataset for PCA

ex7data2.mat - Example Dataset for K-means

ex7faces.mat - Faces Dataset

bird small.png - Example Image

displayData.m - Displays 2D data stored in a matrix

drawLine.m - Draws a line over an exsiting ﬁgure

plotDataPoints.m - Initialization for K-means centroids

plotProgresskMeans.m - Plots each step of K-means as it proceeds

runkMeans.m - Runs the K-means algorithm

submit.m - Submission script that sends your solutions to our servers

[?] pca.m - Perform principal component analysis

[?] projectData.m - Projects a data set into a lower dimensional space

[?] recoverData.m - Recovers the original data from the projection

[?] findClosestCentroids.m - Find closest centroids (used in K-means)

[?] computeCentroids.m - Compute centroid means (used in K-means)

[?] kMeansInitCentroids.m - Initialization for K-means centroids

? indicates ﬁles you will need to complete

Throughout the ﬁrst part of the exercise, you will be using the script

ex7.m, for the second part you will use ex7 pca.m. These scripts set up the

dataset for the problems and make calls to functions that you will write.

You are only required to modify functions in other ﬁles, by following the

instructions in this assignment.

Where to get help

The exercises in this course use Octave

or MATLAB, a high-level program-

ming language well-suited for numerical computations. If you do not have

Octave or MATLAB installed, please refer to the installation instructions in

the “Environment Setup Instructions” of the course website.

At the Octave/MATLAB command line, typing help followed by a func-

tion name displays documentation for a built-in function. For example, help

plot will bring up help information for plotting. Further documentation for

Octave functions can be found at the Octave documentation pages. MAT-

LAB documentation can be found at the MATLAB documentation pages.

We also strongly encourage using the online Discussions to discuss ex-

ercises with other students. However, do not look at any source code written

by others or share your source code with others.

1 K-means Clustering

In this this exercise, you will implement the K-means algorithm and use it

for image compression. You will ﬁrst start on an example 2D dataset that

Octave is a free alternative to MATLAB. For the programming exercises, you are free

to use either Octave or MATLAB.

will help you gain an intuition of how the K-means algorithm works. After

that, you wil use the K-means algorithm for image compression by reducing

the number of colors that occur in an image to only those that are most

common in that image. You will be using ex7.m for this part of the exercise.

1.1 Implementing K-means

The K-means algorithm is a method to automatically cluster similar data

examples together. Concretely, you are given a training set {x

(1)

, ..., x

(m)

}

(where x

(i)

∈ R

), and want to group the data into a few cohesive “clusters”.

The intuition behind K-means is an iterative procedure that starts by guess-

ing the initial centroids, and then reﬁnes this guess by repeatedly assigning

examples to their closest centroids and then recomputing the centroids based

on the assignments.

The K-means algorithm is as follows:

% Initialize centroids

centroids = kMeansInitCentroids(X, K);

for iter = 1:iterations

% Cluster assignment step: Assign each data point to the

% closest centroid. idx(i) corresponds to cˆ(i), the index

% of the centroid assigned to example i

idx = findClosestCentroids(X, centroids);

% Move centroid step: Compute means based on centroid

% assignments

centroids = computeMeans(X, idx, K);

end

The inner-loop of the algorithm repeatedly carries out two steps: (i) As-

signing each training example x

(i)

to its closest centroid, and (ii) Recomput-

ing the mean of each centroid using the points assigned to it. The K-means

algorithm will always converge to some ﬁnal set of means for the centroids.

Note that the converged solution may not always be ideal and depends on the

initial setting of the centroids. Therefore, in practice the K-means algorithm

is usually run a few times with diﬀerent random initializations. One way to

choose between these diﬀerent solutions from diﬀerent random initializations

is to choose the one with the lowest cost function value (distortion).

You will implement the two phases of the K-means algorithm separately

in the next sections.

1.1.1 Finding closest centroids

In the “cluster assignment” phase of the K-means algorithm, the algorithm

assigns every training example x

(i)

to its closest centroid, given the current

positions of centroids. Speciﬁcally, for every example i we set

(i)

:= j that minimizes ||x

(i)

− µ

where c

(i)

is the index of the centroid that is closest to x

(i)

, and µ

is the

position (value) of the j’th centroid. Note that c

(i)

corresponds to idx(i) in

the starter code.

Your task is to complete the code in findClosestCentroids.m. This

function takes the data matrix X and the locations of all centroids inside

centroids and should output a one-dimensional array idx that holds the

index (a value in {1, ..., K}, where K is total number of centroids) of the

closest centroid to every training example.

You can implement this using a loop over every training example and

every centroid.

Once you have completed the code in findClosestCentroids.m, the

script ex7.m will run your code and you should see the output [1 3 2]

corresponding to the centroid assignments for the ﬁrst 3 examples.

You should now submit your solutions.

1.1.2 Computing centroid means

Given assignments of every point to a centroid, the second phase of the

algorithm recomputes, for each centroid, the mean of the points that were

assigned to it. Speciﬁcally, for every centroid k we set

i∈C

(i)

where C

is the set of examples that are assigned to centroid k. Concretely,

if two examples say x

(3)

and x

(5)

are assigned to centroid k = 2, then you

should update µ

(3)

+ x

(5)

You should now complete the code in computeCentroids.m. You can

implement this function using a loop over the centroids. You can also use a

loop over the examples; but if you can use a vectorized implementation that

does not use such a loop, your code may run faster.

Once you have completed the code in computeCentroids.m, the script

ex7.m will run your code and output the centroids after the ﬁrst step of K-

means.

You should now submit your solutions.

1.2 K-means on example dataset

−1 0 1 2 3 4 5 6 7 8 9

Iteration number 10

Figure 1: The expected output.

After you have completed the two functions (findClosestCentroids and

computeCentroids), the next step in ex7.m will run the K-means algorithm

on a toy 2D dataset to help you understand how K-means works. Your

functions are called from inside the runKmeans.m script. We encourage you

to take a look at the function to understand how it works. Notice that the

code calls the two functions you implemented in a loop.

When you run the next step, the K-means code will produce a visualiza-

tion that steps you through the progress of the algorithm at each iteration.

Press enter multiple times to see how each step of the K-means algorithm

changes the centroids and cluster assignments. At the end, your ﬁgure should

look as the one displayed in Figure 1.

评论收藏

内容反馈

版权申诉

制冷技术咨询与服务

粉丝: 1777
资源: 1万+

吴en达机器学习课后作业源码及笔记.zip

[企业政府]网奇企业网站管理系统CWMS 2.0 英文版_cwms2.0_en.zip源码ASP.NET网站源码打包下载

en-decrypt_encryption_源码.zip

IISsexpress-amd64-en-US.zip

基于python神经网络实现将上古卷轴OL翻译为中文源码+使用说明.zip

en.stm32cubef1.zip

refman-5.6-en.man-gpl.zip

html学习笔记.zip

enfcm_加强模糊聚类图像分割算法EnFCM_Enfcm_图像聚类_EnFCM算法_源码.zip

WinRAR.4.00.x32.en.exe.zip

navicat091_lite_en.zip

cna-mac-k9-installer-6-3-4-en.zip

en.stsw-link009_v2.0.2.zip

en.stsw-link004.zip

EN_13757_4__2019_05_13757_EN13757-4_EN13757_源码.zip

EN_13757_2__2018_04_13757_EN13757-2_EN13757_源码.zip

navicat120_premium_en.dmg.download.zip

en.stm32cubeg4.zip

塔罗科公司.zip

VMware-converter-en-6.2.0-8466193.exe.zip

Origin绘制相关性热图插件(Correlation Plot)

（免费）Chrome浏览器插件axure-chrome-extension

noc指导教师资格认证题库

vep视频快速加密提取器

2011-2022年北大数字普惠金融指数数据（包括省市县）.zip

最新版YS9082HC主控开卡工具 YS9082HC-MPToolV8.00.00.18.826-HCS1A25E2023062

糖尿病数据集diabetes.csv（免费）

IEEE 802.11be（WiFi7） 协议原文pdf文档

Mann -kendall突变检验的MATLAB代码

全国统计用区划代码和城乡划分代码(2023版)

最新资源

IEEE 802.11be（WiFi7）协议原文pdf文档