基于偏序关系的子概念格判定算法  

DETERMINANT ALGORITHM OF SUB-CONCEPT LATTICE ON PARTIAL ORDERING RELATION BASIS

作　　者：张瑞玲[1] 徐红升[1] 沈夏炯[2] 

机构地区：[1]洛阳师范学院信息技术学院,河南洛阳471022 [2]河南大学数据与知识工程研究所,河南开封475001

出　　处：《计算机应用与软件》2008年第8期6-7,64,共3页Computer Applications and Software

基　　金：国家自然科学基金项目(60275022);河南省科技攻关项目(072102310088)

摘　　要：基于偏序关系给出子概念格的定义和判定定理,描述子概念格的判定算法,提出对概念格中的子概念格进行折叠的思想,最后,通过FCA原型系统验证了算法的有效性,借助Direct3D技术可视化地展示了子概念格的折叠和互操作过程。子概念格的折叠简化了概念格的显示,从而方便用户对格信息的查询。This article gives the definition and determinant theorem of sub-concept lattice on partial ordering relation basis, and describes the determinant algorithm of sub-concept lattice as well, In the article it also puts forward folding conception for sub-concept lattice in concept lattice, Validity of the algorithm was verified by Formal Concept Analysis （FCA） prototype system, the process of folding and interoperation was displayed in visualization by Direet3D technique. The folding of sub-concept lattice simplifies the display of concept lattice, and facilitates users to inquire about the lattice information.

关 键 词：概念格 偏序关系 子概念格 形式概念分析 子概念格的折叠 

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