Several Generating Algorithms Of The Concept Lattice

Concept lattice is the core data structure of formal concept analysis theory, it is a powerful tool of data analysis. With the sharp increasing of the need date to be analyzed, the constructive efficiency of a concept lattice is more important.In order to solve the constructive problem of the concept lattice, the process of the generation of the concept lattice has been studied, and several generation algorithms of the concept lattice are given.First, here we give a type of concept lattice which has a special structure. Because the binary tree in the data structure has the simple storage structure, on account of this type of concept lattice, using this binary tree structure to re-organize the concepts in concept lattice. We give two algorithms of generating concept lattices, they are the algorithm which is based on add-object incremental algorithm to generate the concept lattice and the algorithm which is based on add-attribute incremental algorithm to generate the concept lattice. By using of this structure of binary tree, in some cases, it can reduce the judging scope of old concept and update concept, at the same time, the process of updating the concept lattice by using this algorithm is demonstrated with an example.Secondly, by analyzing the process of incrementally updating, it provides a new structure, that is, orthogonal list to store the concept lattice. This structure not only has the characteristics of linked storage, but also reflects the father-child relationship between concepts. Based on this structure, a new algorithm which is used to construct concept lattice is presented, and the process of updating the concept lattice by using this algorithm is demonstrated with an example.