k-means是一種經(jīng)典的聚類算法，這是用java實(shí)現(xiàn)k-means的源碼，其中包括了測試數(shù)據(jù)文件
上傳時(shí)間： 2014-01-11
上傳用戶：lizhizheng88
模式識別中K均值算法的示例程序，可對一組數(shù)據(jù)分類并圖形輸出分類結(jié)果。
上傳時(shí)間： 2013-12-23
上傳用戶：yph853211
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.
標(biāo)簽： the decision clusters Cluster
上傳時(shí)間： 2013-12-21
上傳用戶：gxmm
主要是KNN（the k-nearest neighbor algorithm ）,LVQ1（learning vector quantization 1）, DSM（decision surface mapping）算法。 and a simple clustering algorithm.
標(biāo)簽： quantization k-nearest algorithm decision
上傳時(shí)間： 2016-02-07
上傳用戶：zhyiroy
這是一個(gè)關(guān)于K均值的聚類算法希望對大家有用
上傳時(shí)間： 2016-02-15
上傳用戶：ma1301115706
The line echo canceller (LEC) is designed to provide the maximum attainable transparent voice quality for de-echoing of a PSTN or POTS connection in voice-over-LAN systems with internal delays, or on a codec end of a telecom switch,基于TI 54X/55X平臺
標(biāo)簽： transparent attainable canceller designed
上傳時(shí)間： 2014-01-17
上傳用戶：qoovoop
選擇第k小的元素，c語言 partition 要好好看看 理解函數(shù)意思
標(biāo)簽： 元素
上傳時(shí)間： 2016-02-19
上傳用戶：ukuk
K-MEANS算法程序(MATLAB環(huán)境)
標(biāo)簽： K-MEANS MATLAB 算法 程序
上傳時(shí)間： 2014-07-11
上傳用戶：JasonC
Linux Server Hacks, Volume Two By Brian K. Jones, William von Hagen ............................................... Publisher: O Reilly Pub Date: December 2005 Print ISBN-10: 0-596-10082-5 Print ISBN-13: 978-0-59-610082-7 Pages: 478
標(biāo)簽： K. William Server Volume
上傳時(shí)間： 2016-02-26
上傳用戶：ZJX5201314
加權(quán)k均值算法，或者稱為加權(quán)C均值聚類算法
上傳時(shí)間： 2016-02-26
上傳用戶：TF2015
蟲蟲下載站版權(quán)所有 京ICP備2021023401號-1
