检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:李炎 赵思雨 任睿思[1,2] 魏玲 LI Yan;ZHAO Siyu;REN Ruisi;WEI Ling(School of Mathematics,Northwest University,Xi’an 710127,China;Institute of Concepts,Cognition and Intelligence,Northwest University,Xi’an 710127,China;School of Mathematics and Statistics,Minnan Normal University,Zhangzhou 363000,China)
机构地区:[1]西北大学数学学院,陕西西安710127 [2]西北大学概念、认知与智能研究中心,陕西西安710127 [3]闽南师范大学数学与统计学院,福建漳州363000
出 处:《西北大学学报(自然科学版)》2023年第5期803-811,共9页Journal of Northwest University(Natural Science Edition)
基 金:国家自然科学基金(12171392,62006190);西北大学研究生创新项目(CX2023065)。
摘 要:该文将形式背景上保持二元关系不变的概念约简扩展到决策形式背景,在弱协调决策形式背景上,研究保持规则前件信息的概念约简问题。首先,根据决策形式背景获得规则,仅考虑规则前件集合中的二元关系将条件子背景进行压缩,构造前件背景;其次,针对前件背景提出保持规则前件信息的概念约简,借助代表概念矩阵给出概念协调集的判定定理;最后,根据概念在概念约简中所起的作用,将所有概念分成3类,并从最小代表概念矩阵的角度讨论3类概念的概念特征。This paper extends the concept reduction in formal context to formal decision context,and studies the concept reduction preserving antecedent information of rules in weakly consistent formal decision context.Firstly,the conditional subcontext is compressed to form the antecedent context by only considering the binary relation in the antecedent of the rules of formal decision context.Then,we propose the concept reduction preserving antecedent information of rules for the antecedent context,and give the judgment theorem of concept consistent set by representative concept matrix.Finally,we classify all formal concepts into three parts according to the role of each formal concept in concept reduction,and discuss the concept characteristics of three types of formal concepts from the perspective of the minimal representative concept matrix.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.128.78.139