约束概念格的代数性质及其知识表示的完备性  

Algebraic Properties of Constrained Concept Lattice and Its Completeness of Knowledge Representation

作　　者：张继福[1] 张素兰[1] 蒋义勇[1] 

机构地区：[1]太原科技大学计算机科学与技术学院,太原030024

出　　处：《模式识别与人工智能》2010年第3期289-299,共11页Pattern Recognition and Artificial Intelligence

基　　金：国家自然科学基金项目(No.60573075;60773014);山西省回国留学人员科研项目(No.2009-77)资助

摘　　要：约束概念格是一种依据用户对数据集的兴趣、认识等作为背景知识而构造的概念格结构.文中利用约束概念格结点之间的上下确界运算,构造约束概念格的代数系统,证明约束概念格的若干代数性质,以及知识表示的完备性,从而为约束概念格的应用奠定理论基础.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.

关 键 词：数据挖掘 约束概念格 代数性质 知识表示 完备性 

分 类 号：TP311.13[自动化与计算机技术—计算机软件与理论]