1) dendrogram
['dendrəɡræm]
谱系图
1.
A new program arithmetic of building cluster dendrogram was studied.
研究了一种新的聚类谱系图生成的程序算法,这种方法只需要计算一次距离矩阵,利用设计的排序数组,就可以实现谱系图中关键的输出位置计算。
2.
The cluster analysis is one of the most commonly_used multivariable statistical methods whose results are often expressed with the dendrograms.
聚类分析是最常用的多元统计方法之一 ,其结果常用谱系图来表示 。
3.
In this paper, an algorithm and a program are given for setting binary tree of the dendrogram on cluster analysis through studying the link table, and methods are presented for drawing the dendrogram and making other researches on cluster analysis by traversing the binary tree.
通过分析聚类分析联结表，给出了建立聚类分析谱系图二叉树的算法和源程序，提出了通过遍历谱系图二叉树绘制聚类分析谱系图及进行聚类分析中其它研究的方法。
3) hierarchical graph
谱系图
1.
Making use of the properties and the character of classification at each level on the hierarchical graph, the multi branched tree of the hierarchical graph is set up.
利用这些性质和模糊聚类谱系图逐层分类的特征,建立起模糊聚类谱系图的多叉树。
4) spectra pedigree
酶谱谱系图
5) relation spectrum
关系谱图
6) spectral coefficient map
谱系数图
1.
Graphic transformation between spectral coefficient map and K-map based on coding of 0-1;
基于0-1编码空间的谱系数图与K图的图形互换
2.
Graphical method of detecting special logic functions based on spectral coefficient map;
基于谱系数图检测特殊逻辑函数的图形方法
补充资料：图的减缩图(或称图子式)
图的减缩图(或称图子式)
minor of a graph
图的减缩图(或称图子式)【.皿以ofa脚户;MHHoPrpa中a」【补注】设G是一个图(graph)(可以有环及多重边).G的一个减缩图(nullor)是从G中接连进行下述运算而得的任何一个图: i)删去一条边; 五)收缩一条边; 说)去掉一个孤立顶点. NRobe由on与P.D.Se脚aour的图减缩定理(脚Ph nl的。r theon习11)如下所述:已知有限图的无穷序列G，，GZ，…，则存在指标i
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条