資源簡介
實現SC譜聚類算法，該算法首先根據給定的樣本數據集定義一個描述成對數據點相似度的親合矩陣,并且計算矩陣的特征值和特征向量，然后選擇合適 的特征向量聚類不同的數據點
代碼片段和文件信息
function?[y]=kmeans_C（mkrep）
%%%%%%%%%%%%%%%%
%????????????????????????????????????????????????????????
%?kMeansCluster?-?Simple?k?means?clustering?algorithm??????????????????????????????????????????????????????????????
%?Author:?Kardi?Teknomo?Ph.D.??????????????????????????????????????????????????????????????????
%????????????????????????????????????????????????????????????????????????????????????????????????????????????????????
%?Purpose:?classify?the?objects?in?data?matrix?based?on?the?attributes????
%?Criteria:?minimize?Euclidean?distance?between?centroids?and?object?points????????????????????
%?For?more?explanation?of?the?algorithm?see?http://people.revoledu.com/kardi/tutorial/kMean/index.html????
%?Output:?matrix?data?plus?an?additional?column?represent?the?group?of?each ?屬性????????????大小?????日期????時間???名稱
-----------?---------??----------?-----??----
?????文件?????????558??2012-04-04?21:40??sc.m
?????文件????????8416??2012-04-04?21:40??kmeans_c.m
評論
共有 條評論