This article discussed two data mining algorithms: the classification tree and clustering.
本文讨论了两种数据挖掘算法：分类树和群集。
This paper introduces a newly generalized and dynamic structure for the similarity retrieval of high dimensional feature vectors called the recursive clustering index tree.
文章提出了一种新的适用于高维特征矢量相似检索动态聚类索引树结构。
The initial clustering structure is constructed by using the minimum spanning tree method.
然后使用最小生成树方法得到聚类的初始结构；
The results of phylogenetic tree and Bayesian clustering analysis were supported by analysis of molecular variance and principal components analysis.
分子方差分析和主成分分析支持了系统树和贝叶斯聚类分析的结果。
Moreover, this thesis compares FCA with clustering analysis, and analyzes the similarities and differences of classification based on concept lattice and decision tree.
另外，本文在相关章节对形式概念分析和聚类分析进行比较以及分析总结了基于概念格的分类和决策树分类法的异同。
In the algorithm of mesh simplification based on vertex clustering, a vertex tree is built to represent the data structure of the models by octonary subdivision.
在基于顶点聚类的网格简化算法中，通常对网格模型进行八叉剖分来建立一棵顶点树以表示整个网格模型的数据结构；
Methods: Analyzing polymorphics of commercial medicinal materials "Qian-Hu" at different regions by RAPD technique and constructing a clustering tree diagram.
方法：采用RAPD技术对不同产地的商品药材前胡进行多态性分析，并构建聚类树型图。
Therefore, this article applies suffix tree algorithm to the meta search engines, and designs a meta search engine systems with a clustering algorithm.
因此，本文将后缀树算法应用到元搜索引擎中，设计了一个带聚类的元搜索引擎系统。
To improve the clustering efficiency, a simple but reasonable measure for base cluster selection is presented to exclude some generalized suffix tree nodes which contribute less to the clustering.
为了进一步提高聚类效率，给出了一种简单有效的用于基类选择的测度，用来排除一些无意义的广义后缀树节点。
To improve the clustering efficiency, a simple but reasonable measure for base cluster selection is presented to exclude some generalized suffix tree nodes which contribute less to the clustering.
为了进一步提高聚类效率，给出了一种简单有效的用于基类选择的测度，用来排除一些无意义的广义后缀树节点。
应用推荐