天天干狠狠干,夜色导航,中文字幕大全

欧美三区_成人在线免费观看视频_欧美极品少妇xxxxⅹ免费视频_a级毛片免费播放_鲁一鲁中文字幕久久_亚洲一级特黄

此算法的主要作用：屏幕上很多的點，把相鄰的點聚到離他最近的點。

k-means algorithm 算法是一個聚類算法，把n個對象根據他們的屬性分為k個分割，k < n。它與處理混合正態分布的最大期望算法很相似，因為他們都試圖找到數據中自然聚類的中心。

php實現算法代碼如下：

<pre name="code" class="php"></pre> <pre name="code" class="php">class Cluster { public $points; public $avgPoint; function calculateAverage($maxX, $maxY) { if (count($this->points)==0) { $this->avgPoint->x = rand(0, $maxX); $this->avgPoint->y = rand(0,$maxY); //we didn't get any clues at all :( lets just randomize and hope for better... return; } foreach($this->points as $p) { $xsum += $p->x; $ysum += $p->y; } $count = count($this->points); $this->avgPoint->x = $xsum / $count; $this->avgPoint->y = $ysum / $count; } } class Point { public $x; public $y; function getDistance($p) { $x1 = $this->x - $p->x; $y1 = $this->y - $p->y; return sqrt($x1*$x1 + $y1*$y1); } } function distributeOverClusters($k, $arr) { foreach($arr as $p) { if ($p->x > $maxX) $maxX = $p->x; if ($p->y > $maxY) $maxY = $p->y; } $clusters = array(); for($i = 0; $i < $k; $i++) { $clusters[] = new Cluster(); $tmpP = new Point(); $tmpP->x=rand(0,$maxX); $tmpP->y=rand(0,$maxY); $clusters[$i]->avgPoint = $tmpP; } #deploy points to closest center. #recalculate centers for ($a = 0; $a < 200; $a++) # run it 200 times { foreach($clusters as $cluster) $cluster->points = array(); //reinitialize foreach($arr as $pnt) { $bestcluster=$clusters[0]; $bestdist = $clusters[0]->avgPoint->getDistance($pnt); foreach($clusters as $cluster) { if ($cluster->avgPoint->getDistance($pnt) < $bestdist) { $bestcluster = $cluster; $bestdist = $cluster->avgPoint->getDistance($pnt); } } $bestcluster->points[] = $pnt;//add the point to the best cluster. } //recalculate the centers. foreach($clusters as $cluster) $cluster->calculateAverage($maxX, $maxY); } return $clusters; } $p = new Point(); $p->x = 2; $p->y = 2; $p2 = new Point(); $p2->x = 3; $p2->y = 2; $p3 = new Point(); $p3->x = 8; $p3->y = 2; $arr[] = $p; $arr[] = $p2; $arr[] = $p3; var_dump(distributeOverClusters(2, $arr));</pre>

參考地址： http://en.wikipedia.org/wiki/K-means_clustering

k-means clustering K平均算法

更多文章、技術交流、商務合作、聯系博主

微信掃碼或搜索：z360901061

微信掃一掃加我為好友

QQ號聯系： 360901061

您的支持是博主寫作最大的動力，如果您喜歡我的文章，感覺我的文章對您有幫助，請用微信掃描下面二維碼支持博主2元、5元、10元、20元等您想捐的金額吧，狠狠點擊下面給點支持吧，站長非常感激您！手機微信長按不能支付解決辦法：請將微信支付二維碼保存到相冊，切換到微信，然后點擊微信右上角掃一掃功能，選擇支付二維碼完成支付。

【本文對您有幫助就好】元

2元

5元

10元

20元

自定義