摘要
在概念格的纵向合并概念的基础上,讨论了对象集不同属性集相同的概念格的节点之间的关系,并给出了有序概念的定义,建立了一种概念格的纵向合并算法.
Based on the vertical union of concept lattice,the relation of the nodes of concept lattices with the same attributes set was discussed,and the ordered concept was defined,a vertical union algorithm of concept lattices was presented,meanwhile,the Hasse diagram was formed.
出处
《哈尔滨师范大学自然科学学报》
CAS
2010年第2期27-31,共5页
Natural Science Journal of Harbin Normal University
基金
安徽新华学院自然科学项目(2008ZY009)
