Welcome![Sign In][Sign Up]
Location:
Search - minimum spanning tree clustering

Search list

[matlabMATLAB_MST

Description: 用MATLAB实现最小生成树,可以应用在网络分簇、计算权值等多种应用场合-Using MATLAB to achieve the minimum spanning tree, can be applied to network clustering, calculation of weight and many other applications
Platform: | Size: 25600 | Author: wq | Hits:

[Industry researchMinimum-Spanning-Tree-and-Clustering---04202010.z

Description: clustering algorithm
Platform: | Size: 479232 | Author: zxcv | Hits:

[ADO-ODBCmst

Description: 模式识别中的最小生成树聚类,自己编写,没有用函数-Minimum spanning tree clustering
Platform: | Size: 1024 | Author: liyan | Hits:

[Otherclustering-using-mst

Description: Minimum spanning tree-based clustering
Platform: | Size: 72704 | Author: khaoulajuve | Hits:

[OtherClustering

Description: 1) 使用凝聚型层次聚类算法(即最小生成树算法)对所有数据点进行聚类,最后聚成3类。相异度定义方法可选择single linkage、complete linkage、average linkage或者average group linkage中任意一种。 2) 使用C-Means算法对所有数据点进行聚类。C=3。 任务2(必做): 使用高斯混合模型(GMM)聚类算法对所有数据点进行聚类。C=3。并请给出得到的混合模型参数(包括比例??、均值??和协方差Σ)。 任务3(全做): 1) 参考数据文件第三列的类标签,使用聚类有效性评价的外部方法Normalized Mutual Information指标,分别计算任务1和任务2聚类结果的有效性。 2) 使用聚类有效性评价的内部方法Xie-Beni指标,分别计算任务1和任务2聚类结果的有效性。(The main results are as follows: 1) the condensed hierarchical clustering algorithm (that is, the minimum spanning tree algorithm) is used to cluster all the data points, and finally it is grouped into three categories. Any of the single linkage,complete linkage,average linkage or average group linkage methods can be selected for the definition of dissimilarity. 2) using C-Means algorithm to cluster all data points. C = 3.)
Platform: | Size: 26624 | Author: 小鹏鹏123 | Hits:

CodeBus www.codebus.net