New Algorithm of Generating Concept Lattice Using Universal Matrix
Taorong Qiu
Abstract
Taorong Qiu
Abstract
This paper propose a new algorithm of Generating Concept Lattice(GCL1),in this paper using universal matrix.Firstly,the overall context of concept lattice in the form of matrix in which they were expressed by 0 or 1,the rows and columns of context were scanned to identify the universal matrix.In this paper,we define the concept of what is maximum rank universal matrix,and prove it must be a corresponding concept in concept lattice.Secondly,order the universal matrix according to their rank descending order,and expand the universal matrix without maximum rank,get concept nodes and set up sub-lattice.Finally,merge the sub-lattices into the whole concept lattice,and also generated Hass figure.This paper propose a theoretical argument for GCL1 algorithm,and run through the examples,the results show that the algorithm′s time complexity is better than many other algorithms.
OpenAlex reports 2 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
This paper propose a new algorithm of Generating Concept Lattice(GCL1),in this paper using universal matrix.Firstly,the overall context of concept lattice in the form of matrix in which they were expressed by 0 or 1,the rows and columns of context were scanned to identify the universal matrix.In this paper,we define the concept of what is maximum rank universal matrix,and prove it must be a corresponding concept in concept lattice.Secondly,order the universal matrix according to their rank descending order,and expand the universal matrix without maximum rank,get concept nodes and set up sub-lattice.Finally,merge the sub-lattices into the whole concept lattice,and also generated Hass figure.This paper propose a theoretical argument for GCL1 algorithm,and run through the examples,the results show that the algorithm′s time complexity is better than many other algorithms.
Key concepts: Computer science, Algorithm, Lattice (music), Merge (version control), Row and column spaces, Matrix (chemical analysis), Row, Theoretical computer science