概念格的分层及逐层建格法  

Hierarchic Construction of Concept Lattice

作　　者：谢润[1] 李海霞[1] 马骏[1] 宋振明[1] 

机构地区：[1]西南交通大学理学院

出　　处：《西南交通大学学报》2005年第6期837-841,共5页Journal of Southwest Jiaotong University

摘　　要：给出了分层概念格重要性质:同层概念不可比和每个概念至少被1个上层的概念覆盖.得到了概念格上的对象映射和属性映射的一般计算公式和在对象化简过程中格结构不变的定理.由上述性质和定理,给出建格算法.此方法以概念格分层为基础,逐层建格.因为在建每层格的节点的过程中同时进行筛选,所以不会生成冗余重复的格节点.Two important properties of hierarchical concept lattice were presented： the concepts in a same layer are incomparable and a concept is overlayed by at least one concept on the upper layer. The general formula for the object and atribute mapping was derived, and a theorem, which describes the structural invariability of objects during their construction, was obtained. A new algorithm was proposed to construct the concept lattice occording to the properties and theorem. The proposed algorithm constructs the lattice lay by lay based on the hierarchical structure of concept lattice. No abundant concept is created, because filtration is carried out during construction of concepts.

关 键 词：概念格 算法 节点 对象 属性 映射 数据挖掘 

分 类 号：O153.1[理学—数学]