摘要
介绍分析了概念格的研究现状,给出了基于规则的广义概念格的基本定义。通过构建树结构,缩小产生子格节点的范围,产生增量式广义概念格算法。最后,通过实例验证了所提出的算法的时空有效性,并给出了对几种概念格的生成算法有效性的比较结果。
This paper gave a rules based fundamental definition of generalized concept lattice, by analyzing the research status on concept lattices. Then we presented an incremental algorithm for generalized lattice construction, after a tree structure was built and the ranges of sub-lattice nodes were reduced. The efficiency of this algorithm was verified by an illustration,and the comparative result of several algorithms of generating concept lattice was given.
出处
《计算机科学》
CSCD
北大核心
2009年第5期223-224,228,共3页
Computer Science
基金
国家自然科学基金资助项目(60675030)资助
关键词
广义概念格
概念格
增量式生成算法
知识构建
产生式规则
Generalized concept lattice, Concept lattice, Incremental construction algorithm, Knowledge construction, Production rule