[Coursera机器学习]K-means Clustering and Principal Component Analysis WEEK8编程作业

最新推荐文章于 2022-02-14 23:41:13 发布

亚尔诺炽焰

最新推荐文章于 2022-02-14 23:41:13 发布

阅读量2.3k

点赞数 2

分类专栏： Machine Learning 机器学习文章标签：机器学习

本文链接：https://blog.csdn.net/wangjianyu0115/article/details/54767807

版权

本文详细介绍了K-means聚类算法的实现，包括找到最近质心和计算质心均值的过程。同时，深入探讨了PCA主成分分析，从数据预处理、主成分计算到数据降维和重构的步骤。通过随机初始化和PCA，可以有效地理解和应用这些机器学习概念。

摘要由CSDN通过智能技术生成

1.1.1 Finding closest centroids

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.

% Traverse all points of X
for i = 1:length(X)
    min = Inf;
    % Traverse all points of K, judge which cluster the point belong to
    for j = 1:K
        dist = norm(X(i,:) - centroids(j,:))^2;
        if dist < min
            min = dist;
            idx(i) = j;
        end
    end
end

1.1.2 Computing centroid means

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.

for i = 1:K
    count = 0;
    for j = 1:m
        if idx(j) == i
            count = count + 1;
            centroids(i,:) = centroids(i,:) + X(j,:);
        end
    end
    centroids(