约束概念格是一种依据用户对数据集的兴趣、认识等作为背景知识而构造的概念格结构.文中利用约束概念格结点之间的上下确界运算,构造约束概念格的代数系统,证明约束概念格的若干代数性质,以及知识表示的完备性,从而为约束概念格的应用奠定理论基础.
The constrained concept lattice is one type of concept lattice. It is constructed according to the background knowledge of users" interest and knowledge on dataset. In this paper, the algebraic system of the constrained concept lattice is presented by defining operations of supremum and infimum among the constrained concept lattice nodes, and its algebra properties and completeness of knowledge representation are proved, thus the theoretical basis is established for the application of the constrained concept lattice.