Week8_3Program_K-Means Clustering and PCA编程解析

Week8_3Program_K-Means Clustering and PCA编程解析 1. ex7 流程分析 1.1 plotData 按照ex7.m中的流程走一遍python 2. 编程分析 2.1 Find closest centroids 0 / 30 计算公式: ||x(i)−μj||2 | | x ( i ) − μ j | | 2 X=(300x2) K=3 centroids
相关文章
相关标签/搜索