K

所屬分類其他
開發工具:matlab
文件大小:18KB
下載次數:0
上傳日期:2019-06-18 16:49:40
上 傳 者LeBr0n
說明:  k均值聚類算法(k-means clustering algorithm)是一種迭代求解的聚類分析算法,其步驟是隨機選取K個對象作為初始的聚類中心,然后計算每個對象與各個種子聚類中心之間的距離,把每個對象分配給距離它最近的聚類中心。聚類中心以及分配給它們的對象就代表一個聚類。每分配一個樣本,聚類的聚類中心會根據聚類中現有的對象被重新計算。這個過程將不斷重復直到滿足某個終止條件。終止條件可以是沒有(或最小數目)對象被重新分配給不同的聚類,沒有(或最小數目)聚類中心再發生變化,誤差平方和局部最小。
(K-means clustering algorithm is an iterative clustering analysis algorithm. Its step is to randomly select K objects as the initial clustering center, then calculate the distance between each object and each seed clustering center, and assign each object to the nearest clustering center. Cluster centers and objects assigned to them represent a cluster. For each sample allocated, the clustering center of the cluster is recalculated according to the existing objects in the cluster. This process will be repeated until a termination condition is met. The termination condition may be that no (or minimum number) objects are reassigned to different clusters, no (or minimum number) cluster centers change again, and the sum of squares of errors is local minimum.)

文件列表:[舉報垃圾]
K, 0 , 2019-06-18
K\FCM_iris.m, 2309 , 2019-06-18
K\irisdata.mat, 2210 , 2014-05-03
K\kmeans.m, 2815 , 2019-06-18
K\K均值.xlsx, 9730 , 2019-06-18
K\模糊K均值.xlsx, 9815 , 2019-06-18

近期下載者

相關文件

評論我要評論

收藏者

英超视频