A Constructing Galois Lattice Model Based On Cover Relation

Nowadays, the society has entered the information era. The computer and network information technology have been developed so rapidly that data and information are increasing dramatically (information explosion) in all fields,meanwhile data and information systems become more uncertain due to human's participation. How to effectively achieve the data analysis and processing and quickly get implicit knowledge has long been an important direction of Artificial intelligence.Concept Lattice with complete structure and solid theory has been one of the main models in DM。Because Building lattice is a expensive process,How to construc lattice becomes a great limit with application.Due to the challenge, all kinds of methods bring up.nowadays there are two methods for building lattice: batch algorithms and incremental algorithms. The existing incremental algorithms are only suitable for the case of single object insertions one by one, however, in most databases,the updates are group-wise, i.e,a set of objects is to be added at a time.To solve this problem, this paper presents a new incremental algorithm for building concept lattice based on cover relation, this algorithm is suitable for the case of the insertion of a set of objects into the context, and it can construct the Hasse diagram of the concept latticewhile generating the concept.Finally, the experimental prove that the mothed is correct and quick.During constructing lattices,we deal with the formal context .we firstly reduce the formal context and delete unwanted rows and columns,at the same time write down the information about what we do just now. After the context is reduced,it is partitioned with the fourth order context kernel(or under it).All thing is done, once more deal with the partitioned child-context and construct child-lattices according to isomorphic relationg between them.In order to the child-lattices complete,the deleted information must be added.At last the child-lattices are united and build the complete lattice.According to the results of the experiments,this algorithm is very correct and efficacious. Because it use the existed information and adopt to many processes,the method is smart.the key operation of the method is asseblying the child-lattices, which decide the algorithm is good or not.The main contributions of this paper include,(1) The paper give a algorithm for construction lattice based on cover relation。Its merit is that the algorithm reduce the number of compare among building lattice,so that it advances the efficiency.(2) From the point of building lattice, wo give two funcions and some propositions prove the NLD can be translate into the Hasse diagram.(3) The paper give a model for construction lattice based on cover relation,and compare with the CLIF-A algorithm and Godin algorithm.