基于交可约等价类的概念格属性约简

Concept Lattice Attribute Reduction Based on Intersectional Reducible Equivalence Class

定义交可约等价类的概念,研究基于交可等价类的概念格属性约简及其算法,并由此得到不同类型属性的特征.使用链表表示形式背景的逻辑结构并根据外延对象个数大小建立索引快速判断交运算对属性约简的有效性.根据属性对交运算的不同作用找出所有不必要属性,最终得到概念格的属性约简.

The concepts of intersectional reducible equivalence class and intersectional reducible element are introduced. The concept lattice attribute reduction and reduction algorithm based on intersectional reducible elements are studied, and attribute characters of different kinds are obtained. The linked list is used to show the logical structure of formal context, and based on the number of extension objects, the index is built to rapidly judge the validity of the intersection operation on attribute reduction. All unnecessary attributes are found out according to the different roles of attributes to intersection operation. Finally, the concept lattice attribute reduction is achieved.