Construction Algorithm of Concept Lattice Based on Attribute Covered
Liang Jin
Abstract
Liang Jin
Abstract
Formal concept analysis is a powerful tool for data analysis,which has been widely used in many areas.Concept lattice is the main data structure for formal concept analysis theory,so how to build concept lattice is the premise for many applications.The paper analyzes the algorithm building concept lattice in the way of top-down structure,in which sub-concepts conver it's super-concepts' attribute sets.The paper presents a new concept lattice construction algorithm,it's based primarily on the No.N layer concepts' object sets must be the maximum coverage of their properties,which simplifies the process of constructing the concept lattice.
OpenAlex reports 1 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.
Formal concept analysis is a powerful tool for data analysis,which has been widely used in many areas.Concept lattice is the main data structure for formal concept analysis theory,so how to build concept lattice is the premise for many applications.The paper analyzes the algorithm building concept lattice in the way of top-down structure,in which sub-concepts conver it's super-concepts' attribute sets.The paper presents a new concept lattice construction algorithm,it's based primarily on the No.N layer concepts' object sets must be the maximum coverage of their properties,which simplifies the process of constructing the concept lattice.
Key concepts: Lattice Miner, Formal concept analysis, Lattice (music), Computer science, Algorithm, Premise, Theoretical computer science, Mathematics