The incremental algorithm use a tree structure to organize the set of concept nodes, and decrease the time needed to build concept lattice.
本文的渐进式算法利用一种树状结构来对概念格节点进行索引，从而有效地提高了概念格的构造速度。
According to the distance between concept nodes in a concept lattice and the product hierarchies, we can get product-oriented query expansions.
考虑概念格中的不同“概念结点”的距离，获取查询扩展词汇，并结合产品层次，就给出了基于概念格的产品优先的查询扩展。
In Version 6, the concept of node groups is introduced to assist with distinguishing between nodes of different capabilities.
在版本6中，引进了节点组的概念，用来帮助区分具备不同能力的节点。
应用推荐