The Algorithms Of Generating Concept Lattice

Three algorithms are presented in different three parts in this dissertation. The first part builds up modified object lattice by introducing two partial ordering relations≤' and (?)' and a new intersection∩', followed by generating a concept lattice with the modified object lattice. The second part presents an algorithm of generating concept lattice utilizing layer thinking of row rank of matrix. At the same time, it describes the concept relation between objects and attributes by an example. The final part expands the definition of the concept information granule in the limited set, and followed by presenting a partial relation between two concept information granules in the set of the concept information granules. Then we prove that the set of the concept information granules is a complete lattice about the partial relation.