An Algorithm Based on Concept-Matrix for Building Concept Lattice with Hasse

As the core data structure of FCA (formal concept analysis), concept lattice has been widely used in the field of machine learning and data mining. It is useful to study algorithms of building concept lattice in practical applications. There are several of algorithms of building concept lattice which have been developed. This paper presents an efficient algorithm named CMCG (concept- matrix based concepts generation) for building concept lattice and corresponding Hasse graph based on concept- matrix which is a novel notion. The Algorithm CMCG finds all lower neighbors of concept by using the rank of attribute in concept-matrix and generate corresponding Hasse graph. The validity of the algorithm was proved in theory and by experiment. The pseudo codes of CMCG Algorithm are given and that performance of CMCG is superior to one of Lattice Algorithm is proved at end.