亚洲欧美第一页_禁久久精品乱码_粉嫩av一区二区三区免费野_久草精品视频

蟲蟲首頁| 資源下載| 資源專輯| 精品軟件
登錄| 注冊

您現在的位置是:蟲蟲下載站 > 資源下載 > 并行計算 > How the K-mean Cluster work Step 1. Begin with a decision the value of k = number of clusters S

How the K-mean Cluster work Step 1. Begin with a decision the value of k = number of clusters S

  • 資源大小:3 K
  • 上傳時間: 2013-12-21
  • 上傳用戶:forchwei
  • 資源積分:2 下載積分
  • 標      簽: the decision clusters Cluster

資 源 簡 介

How the K-mean Cluster work Step 1. Begin with a decision the value of k = number of clusters Step 2. Put any initial partition that classifies the data into k clusters. You may assign the training samples randomly, or systematically as the following: Take the first k training sample as single-element clusters Assign each of the remaining (N-k) training sample to the cluster with the nearest centroid. After each assignment, recomputed the centroid of the gaining cluster. Step 3 . Take each sample in sequence and compute its distance from the centroid of each of the clusters. If a sample is not currently in the cluster with the closest centroid, switch this sample to that cluster and update the centroid of the cluster gaining the new sample and the cluster losing the sample. Step 4 . Repeat step 3 until convergence is achieved, that is until a pass through the training sample causes no new assignments.

相 關 資 源

主站蜘蛛池模板: 五莲县| 南华县| 台江县| 阳朔县| 靖边县| 昭觉县| 且末县| 五家渠市| 上饶市| 临沂市| 偃师市| 涟源市| 措美县| 五莲县| 英德市| 高淳县| 波密县| 神木县| 无极县| 娄底市| 杭州市| 崇明县| 漳浦县| 乌兰浩特市| 长顺县| 鄂托克旗| 乌兰察布市| 高唐县| 应城市| 新闻| 永和县| 崇左市| 迭部县| 兴安县| 凤庆县| 沂南县| 天气| 武威市| 临漳县| 牡丹江市| 大方县|