检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:王霞 彭致华 李俊余 吴伟志 WANG Xia;PENG Zhi-hua;LI Jun-yu;WU Wei-zhi(School of Mathematics,Physics and Information Science,Zhejiang Ocean University,Zhoushan,Zhejiang 316022,China;Key Laboratory of Oceanographic Big Data Mining and Application of Zhejiang Province(Zhejiang Ocean University),Zhoushan,Zhejiang 316022,China)
机构地区:[1]浙江海洋大学数理与信息学院,浙江舟山316022 [2]浙江省海洋大数据挖掘与应用重点实验室(浙江海洋大学),浙江舟山316022
出 处:《计算机科学》2021年第1期125-130,共6页Computer Science
基 金:国家自然科学基金项目(41631179,61773349,61976194);浙江省自然科学基金项目(LY18F030017)。
摘 要:基于布尔因子分析的概念约简能够保持形式背景的二元关系不变。借鉴概念格中基于可辨识矩阵求解属性约简的思想,在形式背景上定义概念可辨识矩阵,基于此给出保持二元关系不变的概念约简方法。首先,在形式背景上定义一种新的可辨识矩阵,称之为概念可辨识矩阵。该矩阵的行和列都是形式概念,矩阵的每个元素是由属于所在行的形式概念的所有对象和属性对,但不属于所在列的形式概念的对象和属性对构成的集合。其次,研究概念可辨识矩阵与概念协调集之间的关系,利用概念可辨识矩阵给出概念协调集的判定方法。然后,利用概念可辨识矩阵详细讨论核心概念、相对必要概念和不必要概念的特征,进而分别给出判断这3类形式概念的方法。最后,给出基于概念可辨识矩阵寻找概念约简的步骤。The concept reduction of a formal context based on Boolean factor analysis can preserve all binary relations of the formal context.That is the relations between objects and attributes contained in a concept reduction based on Boolean factor analysis are consistent with the binary relations represented by the formal context.Inspired by the idea of discernibility matrix solving attribute reduct in a concept lattice,a concept discernibility matrix is defined in a formal context,and a method of concept reduct based on the concept discernibility matrix is proposed to find all concept reducts.Firstly,a new discernibility matrix is defined in a formal context,which is called concept discernibility matrix of the formal context.Both the rows and columns of the matrix are the formal concepts.Each element of the matrix is a set consisted of all pairs of object and attribute,which belong to the formal concept in the corresponding row,but not to the formal concept in the corresponding column.Secondly,the relationship between the concept discernibility matrix and the concept consistent set is studied,and the method of judging concept consistent set is given by using the concept discernibility matrix.Then,all formal concepts of a formal context are divided into three categories:core concept,relatively necessary concept and unnecessary concept according to their relationship to concept reducts.And characteristics of core concept,relatively necessary concept and unnecessary concept are discussed in detail.Moreover,methods of judging these three kinds of formal concepts are developed respectively by using the concept discernibility matrix.The detailed process of solving all concept reducts of a formal cont ext is given by an example based on the concept discernibility matrix.Finally,solution steps to find all concept reducts are given by using the concept discernibility matrix,and the complexity of each step is simply analyzed.
关 键 词:形式背景 形式概念 概念约简 概念可辨识矩阵 概念特征
分 类 号:TP301[自动化与计算机技术—计算机系统结构]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:18.219.89.207