Abstract: In view of the problem of how to maintain the concept lattice in limited space,a concept lattice maintenance algorithm was proposed to decrease redundant binary relation in formal context.Traditional algorithms need to re-construct the concept lattice after deleting redundant relations,this approach is more time-consuming.For the above,we proposed a concept lattice based on the original direct adjustment to obtain new concept lattice method,which can handle cases anywhere in the binary relations of decrement.It uses the bottom-up breadth first traversal grid nodes.Firstly,according to whether the current node contains redundant relational object or redundant relational attribute,the current node is divided into the affected nodes and the constant node.Then based on the relationship between the parent-child node of the current node and extent and intent,then the affected nodes subdivided into four categories,namely reducing object node,reducing attribute node,splitting nodes,deleting nodes.At last,according to the type of parent-child node update edges.Experimental results show that,to some extent,compared with the traditional algorithm,it can get better time performance.

Key words: Formal concept analysis,Concept lattice,Binary relation decrement,Algorithm