基于属性涵盖的概念格构造算法

Construction Algorithm of Concept Lattice Based on Attribute Covered

形式概念分析是一种非常有效的数据分析工具,在很多领域得到了广泛的应用。形式概念分析的核心数据结构就是概念格,概念格的构造是形式概念分析的许多重要应用的前提。本文分析了在概念格的自上而下构造方式中子概念涵盖父概念属性集的特点,根据第N层概念的子概念的对象集必然可以最大覆盖其属性集,提出新的概念格构造算法,简化了概念格的构造过程。

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.