摘要
提出了基于概念格Hasse图的一种对象渐减式构造算法,从Hasse图的最大节点开始,沿着仅包含该对象的路径,自顶向下完成概念格的构造,不需要遍历所有的节点,也不需要重新构造概念格.
One decreasing algorithm of concept lattice was proposed,when one object was deleted.Based on the Hasse diagram,starting from the greatest node,along the path which only contains the object deleted,from top to down, the new concept lattice could be completed,without travelling all the nodes of the original concept lattice and reconstructing the new concept lattice from its corresponding formal context.At the same time,the new Hasse diagram can be obtained,too.
出处
《河南科技学院学报（自然科学版）》
2015年第3期57-60,66,共5页
Journal of Henan Institute of Science and Technology(Natural Science Edition)
基金
安徽省自然科学项目(KJ2013B107)
安徽新华学院项目(2014zr011
2014zr014)
