Andrew Ng机器学习week8(Unsupervised Learning)编程习题
来源:互联网 发布:引出数据失败 请检查 编辑:程序博客网 时间:2024/06/03 15:20
Andrew Ng机器学习week8(Unsupervised Learning)编程习题
findClosestCentroids.m
function idx = findClosestCentroids(X, centroids)%FINDCLOSESTCENTROIDS computes the centroid memberships for every example% idx = FINDCLOSESTCENTROIDS (X, centroids) returns the closest centroids% in idx for a dataset X where each row is a single example. idx = m x 1 % vector of centroid assignments (i.e. each entry in range [1..K])%% Set KK = size(centroids, 1);% You need to return the following variables correctly.idx = zeros(size(X,1), 1);% ====================== YOUR CODE HERE ======================% Instructions: Go over every example, find its closest centroid, and store% the index inside idx at the appropriate location.% Concretely, idx(i) should contain the index of the centroid% closest to example i. Hence, it should be a value in the % range 1..K%% Note: You can use a for-loop over the examples to compute this.%for i=1:size(X, 1) for j=1:K distance(j) = norm(X(i,:)-centroids(j,:))^2; end [minr, index] = min(distance); idx(i)=index;end% =============================================================end
computeCentroids.m
function centroids = computeCentroids(X, idx, K)%COMPUTECENTROIDS returns the new centroids by computing the means of the %data points assigned to each centroid.% centroids = COMPUTECENTROIDS(X, idx, K) returns the new centroids by % computing the means of the data points assigned to each centroid. It is% given a dataset X where each row is a single data point, a vector% idx of centroid assignments (i.e. each entry in range [1..K]) for each% example, and K, the number of centroids. You should return a matrix% centroids, where each row of centroids is the mean of the data points% assigned to it.%% Useful variables[m n] = size(X);% You need to return the following variables correctly.centroids = zeros(K, n);% ====================== YOUR CODE HERE ======================% Instructions: Go over every centroid and compute mean of all points that% belong to it. Concretely, the row vector centroids(i, :)% should contain the mean of the data points assigned to% centroid i.%% Note: You can use a for-loop over the centroids to compute this.%index1 = find(idx==1);index2 = find(idx==2);index3 = find(idx==3);X1 = X(index1,:);X2 = X(index2,:);X3 = X(index3,:);centroids(1,:) = mean(X1);centroids(2,:) = mean(X2);centroids(3,:) = mean(X3);% =============================================================end
pca.m
function [U, S] = pca(X)%PCA Run principal component analysis on the dataset X% [U, S, X] = pca(X) computes eigenvectors of the covariance matrix of X% Returns the eigenvectors U, the eigenvalues (on diagonal) in S%% Useful values[m, n] = size(X);% You need to return the following variables correctly.U = zeros(n);S = zeros(n);% ====================== YOUR CODE HERE ======================% Instructions: You should first compute the covariance matrix. Then, you% should use the "svd" function to compute the eigenvectors% and eigenvalues of the covariance matrix. %% Note: When computing the covariance matrix, remember to divide by m (the% number of examples).%Sigma = (1/m)*X'*X;[U, S, V] = svd(Sigma);% =========================================================================end
projectData.m
function Z = projectData(X, U, K)%PROJECTDATA Computes the reduced data representation when projecting only %on to the top k eigenvectors% Z = projectData(X, U, K) computes the projection of % the normalized inputs X into the reduced dimensional space spanned by% the first K columns of U. It returns the projected examples in Z.%% You need to return the following variables correctly.Z = zeros(size(X, 1), K);% ====================== YOUR CODE HERE ======================% Instructions: Compute the projection of the data using only the top K % eigenvectors in U (first K columns). % For the i-th example X(i,:), the projection on to the k-th % eigenvector is given as follows:% x = X(i, :)';% projection_k = x' * U(:, k);%U_reduced = U(:, 1:K);Z = X * U_reduced;% =============================================================end
recoverData.m
function X_rec = recoverData(Z, U, K)%RECOVERDATA Recovers an approximation of the original data when using the %projected data% X_rec = RECOVERDATA(Z, U, K) recovers an approximation the % original data that has been reduced to K dimensions. It returns the% approximate reconstruction in X_rec.%% You need to return the following variables correctly.X_rec = zeros(size(Z, 1), size(U, 1));% ====================== YOUR CODE HERE ======================% Instructions: Compute the approximation of the data by projecting back% onto the original space using the top K eigenvectors in U.%% For the i-th example Z(i,:), the (approximate)% recovered data for dimension j is given as follows:% v = Z(i, :)';% recovered_j = v' * U(j, 1:K)';%% Notice that U(j, 1:K) is a row vector.% U_reduced = U(:, 1:K);X_rec = Z * U_reduced';% =============================================================end
阅读全文
1 0
- Andrew Ng机器学习week8(Unsupervised Learning)编程习题
- Ng机器学习 Week8 Unsupervised Learning
- Andrew Ng机器学习week5(Neural Networks: Learning)编程习题
- NG week8 unsupervised learning
- Stanford 机器学习笔记 Week8 Unsupervised Learning
- Andrew Ng机器学习课程笔记--week8
- Andrew Ng机器学习week2(Linear Regression)编程习题
- Andrew Ng机器学习week3(Regularization)编程习题
- Andrew Ng机器学习week4(Neural Networks: Representation)编程习题
- Andrew Ng机器学习week7(Support Vector Machines)编程习题
- Andrew NG 机器学习 笔记-week8-聚类(Clustering)
- Ng 机器学习week8编程练习
- 【机器学习】Machine Learning by Andrew Ng
- Andrew Ng 《Machine Learning》第一讲——Supervised Learning & Unsupervised Learning 学习笔记
- Andrew Ng机器学习笔记week8 无监督学习(聚类、PCA)
- Andrew Ng机器学习week6(Regularized Linear Regression and Bias/Variance)编程习题
- Andrew Ng机器学习week9(Anomaly Detection and Recommender Systems)编程习题
- 机器学习 Andrew NG
- SPI详解
- 企业大型互联网分布式架构{Java分布式架构 dubbo + springmvc + mybatis + ehcache + redis }
- 二叉树应用——后缀表达式构建表达式树
- 字典树
- Android 点击按压效果selector
- Andrew Ng机器学习week8(Unsupervised Learning)编程习题
- url特殊字符转义及解决方法
- 蓝桥杯-台阶问题
- 17.单词倒排
- 基于canvas的图片保存
- 正则表达式菜鸟教程1开山篇教程
- 蓝桥杯-李白打酒
- 【代码笔记】iOS-performSelector
- I2C详解