relate.levels(vegclust)
relate.levels()所属R语言包：vegclust
Relates two clustering level results.
有关两个聚类水平的成果。
译者：生物统计家园网 机器人LoveR
描述----------Description----------
Analyzes how lower level clusters are assigned into upper level ones. The analysis is made for several number of clusters.
分析如何降低的水平簇被分配到上层的。该分析是由数的聚类数。
用法----------Usage----------
relate.levels(lower, upper, verbose=FALSE, ...)
参数----------Arguments----------
参数：lower
A list of objects of type vegclust that represent classifications at a fine level of resolution.
一个的对象类型vegclust列表代表的分类，在精细的分辨率。
参数：upper
A list of objects of type vegclust that represent classifications at an broad level of resolution.
一个的对象类型vegclust列表代表的分类，在广泛的层面上解决。
参数：verbose
A flag used to ask for extra screen output.
一个标志，用于要求额外的屏幕输出。
参数：...
Additional parameters for function defuzzify.
其他参数功能defuzzify。
Details
详细信息----------Details----------
For each pair of vegclust objects in upper and lower, the function makes calls to vegclass in order to assign the centroids of the object of lower into classes of the object of upper. The assignment result is then defuzzified (by calling function defuzzify) and several quantities are calculated (see 'value' section).
对于每一个对vegclustupper和lower，函数调用vegclass以分配的对象的质心lower到类中的对象对象upper。然后分配结果的解模糊（调用函数defuzzify）和几个数量计算（见“值”一节）。
值----------Value----------
A list with several data frames (see below). In each of them, the rows are items of upper and columns are items of lower. The names of rows and columns are the number of clusters of each vegclust object. <table summary="R valueblock"> <tr valign="top"><td>inter</td> <td> The number of low level clusters that are not clearly assigned into any cluster (with the options supplied to defuzzify). </td></tr> <tr valign="top"><td>noise</td> <td> The number of low level clusters that are assigned to the Noise class (for upper objects using Noise clustering). </td></tr> <tr valign="top"><td>miss</td> <td> The number of upper level clusters (mobile or fixed) that do not have any member among the lower level clusters. </td></tr> <tr valign="top"><td>missmob</td> <td> The number of upper level mobile clusters that do not have any member among the lower level clusters. </td></tr> <tr valign="top"><td>missfix</td> <td> The number of upper level fixed clusters that do not have any member among the lower level clusters. </td></tr> </table>
与多个数据框的列表（见下文）。在他们每个人，行的项目upper和列项目lower。的行和列的名称是每个vegclust对象的簇的数目。 <table summary="R valueblock"> <tr valign="top"> <TD> inter</ TD> <TD>低的水平聚类，都没有明确指定任何聚类的数量（与选项提供给defuzzify）。 </ TD> </ TR> <tr valign="top"> <TD> noise</ TD> <TD>的数字聚类，被分配到的噪声级低的水平（upper对象使用噪声聚类）。 </ TD> </ TR> <tr valign="top"> <TD> miss</ TD> <TD>上层聚类（移动或固定）的数量之间没有任何成员较低的水平簇。 </ TD> </ TR> <tr valign="top"> <TD>missmob</ TD> <TD>没有任何成员之间的较低级聚类上水平移动聚类的数量。 </ TD> </ TR> <tr valign="top"> <TD>missfix</ TD> <TD>上层没有固定的聚类，在较低的水平聚类中的任何成员的数量。 </ TD> </ TR> </ TABLE>
（作者）----------Author(s)----------
Miquel De C谩ceres, Forest Science Center of Catalonia
参见----------See Also----------
vegclust, vegclass, defuzzify
vegclust，vegclass，defuzzify
实例----------Examples----------
# Loads data [数据加载]
data(wetland)
# This equals the chord transformation (see also 'normalize' option in \code{\link{decostand}} from the vegan package)[这等于和弦转换（参见标准化选项\ {\的链接{decostand}}从素食包的代码）]
wetland.chord = as.data.frame(sweep(as.matrix(wetland), 1, sqrt(rowSums(as.matrix(wetland)^2)), "/"))
# Create noise clustering from hierarchical clustering at different number of cluster[产生噪音聚类，数字聚类在不同的层次聚类]
wetland.hc = hclust(dist(wetland.chord),method="ward")
wetland.nc1 = hier.vegclust(wetland.chord, wetland.hc, cmin=2, cmax=6, m = 1.2, dnoise=0.75, method="NC")
wetland.nc2 = hier.vegclust(wetland.chord, wetland.hc, cmin=2, cmax=4, m = 1.2, dnoise=0.85, method="NC")
#Studies the assignment of levels[研究水平分配]
relate.levels(wetland.nc1, wetland.nc2, method="cut")
转载请注明:出自 生物统计家园网(http://www.biostatistic.net)。
注：
注1：为了方便大家学习，本文档为生物统计家园网机器人LoveR翻译而成，仅供个人R语言学习参考使用，生物统计家园保留版权。
注2：由于是机器人自动翻译，难免有不准确之处，使用时仔细对照中、英文内容进行反复理解，可以帮助R语言的学习。
注3：如遇到不准确之处，请在本贴的后面进行回帖，我们会逐渐进行修订。
|
发表于 2012-10-1 15:16:43
