利用格结构特性生成概念格的算法  

Algorithm of Building Concept Lattice Based on Its Structure

作　　者：时百胜[1] 刘宗田[1] 余泓[2] 

机构地区：[1]上海大学计算机工程与科学学院,上海200072 [2]苏州科技学院应用数学系,苏州215009

出　　处：《计算机工程》2007年第21期12-14,共3页Computer Engineering

基　　金：国家自然科学基金资助项目(60275022)

摘　　要：给出了概念格中关于后代和后继的一些性质,利用这些性质,提出了一种生成所有概念及其序关系的算法。对于任一形式概念,该算法能产生它的全部后代,并确认哪些后代为后继。为提高算法效率,采用了集合的精确匹配代替高代价的子集关系的检验。与现有算法相比,该算法的计算效率有显著的提高。This paper gives some basic properties of children and successors in the concept lattice. By making use of these properties, it presents an algorithm to generate all concepts and its lattice order. Given a formal concept, this algorithm can produce all the children and identify all successors from them. During its implementation, the set exact matching takes place of against subset testing operations which is at a high price and the better computation efficiency is achieved.

关 键 词：概念格 形式概念 后代 后继 算法 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]