Abstract: Through analyzes the process of incrementally updating，the authors use tree structure of concept lattice to organize the set of concepts in concept lattice.Based on the tree structure，attribute-priority incremental formation algorithm is developed.Also demonstrates by an example that in the process of incrementally updating，the organization of concepts in tree structure can help to identify the node type and greatly reduce the search space of parents and children of new born concept node.Then it can obtain the concept lattice much faster.

摘要： 通过对概念格渐进式构造过程的分析，采用树结构对概念格节点进行组织，研究了利用这种树状组织的渐进式生成属性优先的概念格的构造算法。并结合实例说明了概念格的树结构组织在属性优先的渐进式生成概念格时，能有效地缩小产生子格节点的搜索范围和新增格节点的父节点和子节点的搜索范围，从而能快速生成概念格。