package?buju;
import?java.util.ArrayList;
import?java.util.List;

/**
?*?Canopy算法?借助canopy算法計算對應的Kmeans中的K值大小
?*?其中對于計算K值來說，?我們這里將T2設置為平均距離
?*?獲取T1內圈的數據向量，k和簇的中心
?*/
public?class?Canopy?{
????private?List?points?=?new?ArrayList（）;?//?進行聚類的點
????private?List>?clusters?=?new?ArrayList>（）;?//?存儲簇
????private?double?T2?=?-1;?//?閾值
????private?double?T1?=?0;
????
????public?Canopy（List?points）?{
????????for?（Point?point?:?points）
????????????//?進行深拷貝
????????????this.points.add（point）;
????}

???
?????//進行聚類，按照Canopy算法進行計算，將所有點進行聚類
?????
????public?void?cluster（）?{
????????//T2?=?getAverageDistance（points）;
????	T2=getAverageDistance（points）;
????	T1=2*T2;
????????while?（points.size（）?!=?0）?{
????????????List?clust

?屬性????????????大小?????日期????時間???名稱
-----------?---------??----------?-----??----

?????文件????????301??2014-08-07?09:46??CanopyExm\.classpath

?????文件????????385??2014-11-20?19:57??CanopyExm\.project

?????文件????????629??2014-08-07?09:46??CanopyExm\.settings\org.eclipse.jdt.core.prefs

?????文件???????6274??2014-11-20?20:06??CanopyExm\bin\buju\Canopy.class

?????文件???????5724??2014-11-20?21:27??CanopyExm\bin\buju\canopy2.class

?????文件????????256??2014-11-20?19:57??CanopyExm\bin\buju\members.class

?????文件????????665??2014-11-20?19:57??CanopyExm\bin\buju\Point.class

?????文件???????7207??2014-11-20?20:06??CanopyExm\src\buju\Canopy.java

?????文件???????6129??2014-11-20?21:27??CanopyExm\src\buju\canopy2.java

?????文件????????360??2014-11-06?17:08??CanopyExm\src\buju\members.java

?????目錄??????????0??2014-11-21?16:52??CanopyExm\bin\buju

?????目錄??????????0??2014-11-21?16:52??CanopyExm\src\buju

?????目錄??????????0??2014-11-21?16:52??CanopyExm\.settings

?????目錄??????????0??2014-11-21?16:52??CanopyExm\bin

?????目錄??????????0??2014-11-21?16:52??CanopyExm\src

?????目錄??????????0??2014-11-21?16:52??CanopyExm

-----------?---------??----------?-----??----

????????????????27930????????????????????16