等价关系
等价关系的相关文献在1959年到2022年内共计538篇,主要集中在数学、自动化技术、计算机技术、教育
等领域,其中期刊论文509篇、会议论文26篇、专利文献19460篇;相关期刊341种,包括周口师范学院学报、杭州师范大学学报(自然科学版)、贵州师范大学学报(自然科学版)等;
相关会议22种,包括第十届中国不确定系统年会、第十四届中国青年信息与管理学者大会、第二届全国语言动力系统研讨会、第七届全国技术过程故障诊断与安全性学术会议等;等价关系的相关文献由818位作者贡献,包括孙垒、马周明、张强等。
等价关系—发文量
专利文献>
论文:19460篇
占比:97.32%
总计:19995篇
等价关系
-研究学者
- 孙垒
- 马周明
- 张强
- 李进金
- 王尧
- 王敏
- 韩光辉
- 李令斗
- 李翰芳
- 代劲
- 任艳丽
- 张铃
- 欧阳建新
- 苏亚娟
- 裴惠生
- 费秀海
- 闫林
- 魏立明
- 何中市
- 侯恩广
- 侯维民
- 冯源
- 刘一亮
- 刘勇
- 刘复岩
- 刘文奇
- 刘芙萍
- 刘静
- 吉永杰
- 吕韶义
- 吴亭
- 吴玉涛
- 周伟峰
- 周绍艳
- 唐保祥
- 姚从军
- 孔灿
- 孙树栋
- 孙翠先
- 宋明娟
- 张丽
- 张勤
- 张晓军
- 张玉祥
- 张秋娜
- 张荣华
- 徐元
- 成乐
- 施恩伟
- 李岳炀
-
-
闫俊辉
-
-
摘要:
随着计算机网络技术和人们生活节奏的加快,生活中很多数据都在随时发生着变化,那么快速及时的解决数据变化后的属性约简问题,就成了信息技术领域里研究的一个重要课题。剖析了数据更新后相对知识粒度和等价关系矩阵的增量机制,提出了对象属性值增加后的基于矩阵方法的增量属性约简算法。下载了2组UCI数据对提出的增量属性约简算法进行了测试,结果证明了增量属性约简算法能够处理属性值增加后的属性约简问题。
-
-
李静
-
-
摘要:
认识方程的核心在于认识其中内在的“等价关系”模型。方程的历史演变经历了文辞式方程、缩写式方程、符号式方程三个时期。在教学中,教师可以由方程外在描述性的定义出发,让学生感悟概念的意义,感悟方程的模型思想。
-
-
郭丽君
-
-
摘要:
在集合论中等价关系是非常重要的概念,相关的知识点较为抽象,首先,通过对等价关系和集合之间理论的深度解读,有助于相关学习者对等价关系的进一步理解,对集合论相关知识进行深度学习;其次,对等价关系和全关系进行了分析;最后,在基于矩阵的理论基础上给出等价关系的判断方法.
-
-
陈辉;
刘鑫;
王守峰
-
-
摘要:
设X为非空集合,E是X上的等价关系,T(X)是X上的全变换半群.记T_(E*)(X)={α∈T(X)|(∀x,y∈X)(x,y)∈E⇔(xα,yα)∈E},则T_(E*)(X)是T(X)的子半群.许多学者对半群T_(E*)(X)作了研究,而沿着这些方向继续研究还可以刻画出T_(E*)(X)中的关系L˜,给出L*=L˜,R=R*的充要条件,证明T_(E*)(X)中的正则元集Re g(T_(E*)(X))形成子半群,同时可以得到Re g(T_(E*)(X))构成完全正则半群和纯正半群的充要条件.
-
-
-
蒲小丽
-
-
摘要:
等号是数学领域中一个极其重要的符号,它既是表示得出运算结果的符号,也是表示等价关系的符号.很多时候,等号的这两种含义相伴相随,不需要明确区分.但在有余数的除法算式中,等号只表示得出运算结果,却不表示等价关系.在教学中可以让学生独立计算,引发认知冲突以及进行推理验证,先逆推验算结果,再说清道理,从而理解等号的含义.
-
-
刘蔚萍
-
-
摘要:
基于代数系统理论,证明了函数极限相等是一个等价关系、同余关系.并证明了极限存在的一元函数集合A的代数系统(A,±)是一个群,商代数(A/R,±)是一个商群.
-
-
代婧宇;
郜舒竹
-
-
摘要:
小学生常将"="视为操作性的符号,缺乏对其关系性的认识.经过文献考察得知,等号具有多样的意义且它们之间存在联系.研究者从"关系"的角度对等号的多样意义进行分析与归类,澄清等号在不同情境下的不同意义,并探讨"关系"思维的拓展应用.
-
-
-
李静
-
-
摘要:
在小学阶段,就方程的概念学习来说,概念的意义比概念的定义更为重要。史宁中教授认为:一元一次方程比较全面地展示了建模思想——用等号将相互等价的两件事情联立,等号的左右两边等价。这是数学建模的本质表现之一。可见,认识方程的核心在于认识其内在的"等价关系"模型。我们知道,方程的历史演变经历了文辞式方程、缩写式方程、符号式方程三个时期。教学时,我们可以由方程外在描述性的定义出发,去感悟概念的丰富意义,感悟方程的模型思想。
-
-
-
-
-
-
-
张丽
- 《2010年亚太青年通信与技术学术会议》
| 2010年
-
摘要:
给定一台确定型有穷自动机,通过它所接受的语言的闭包运算,构造出相应的闭包自动机,是一台非确定型有穷自动机.利用确定型有穷自动机上的状态等价关系对该非确定型有穷自动机进行极小化,使之能在接受的语言不改变的前提下,状态数得到减少.
-
-
Shiping Wang;
William Zhu;
Qingxin Zhu;
Fan Min
- 《第二届全国语言动力系统研讨会》
| 2011年
-
摘要:
Rough set theory provides a systematical tool for attribute reduction and rule induction in information systems. There is much need to use sophisticated theories or tools to make it more adaptive to practical problems. This paper constructs an isomorphism from equivalence relations to 2-circuit matroids, and provides two equivalent characterizations of attribute reductions of information systems with matroidal approaches. Firstly, we establish a matroidal structure of rough sets. Specifically, an approach to inducing a matroid fromrnan equivalence relation is proposed. Several equivalent formulations of independent sets of the matroid by an equivalence relation are presented. Secondly, an approach is provided to induce an equivalence relation from a matroid. Thirdly, an isomorphism from equivalence relations to 2-circuit matroids is constructed. We also use matroidal approaches to studying rough sets;specially, it is proved that the upper approximation operator with respect to an equivalence relation is equal to the closure operator of the matroid induced by the equivalence relation. Finally, attribute reductions of information systems are equivalently formulated with rank functions and closure operators of matroids induced by attributes.
-
-
Shiping Wang;
William Zhu;
Qingxin Zhu;
Fan Min
- 《第二届全国语言动力系统研讨会》
| 2011年
-
摘要:
Rough set theory provides a systematical tool for attribute reduction and rule induction in information systems. There is much need to use sophisticated theories or tools to make it more adaptive to practical problems. This paper constructs an isomorphism from equivalence relations to 2-circuit matroids, and provides two equivalent characterizations of attribute reductions of information systems with matroidal approaches. Firstly, we establish a matroidal structure of rough sets. Specifically, an approach to inducing a matroid fromrnan equivalence relation is proposed. Several equivalent formulations of independent sets of the matroid by an equivalence relation are presented. Secondly, an approach is provided to induce an equivalence relation from a matroid. Thirdly, an isomorphism from equivalence relations to 2-circuit matroids is constructed. We also use matroidal approaches to studying rough sets;specially, it is proved that the upper approximation operator with respect to an equivalence relation is equal to the closure operator of the matroid induced by the equivalence relation. Finally, attribute reductions of information systems are equivalently formulated with rank functions and closure operators of matroids induced by attributes.
-
-
Shiping Wang;
William Zhu;
Qingxin Zhu;
Fan Min
- 《第二届全国语言动力系统研讨会》
| 2011年
-
摘要:
Rough set theory provides a systematical tool for attribute reduction and rule induction in information systems. There is much need to use sophisticated theories or tools to make it more adaptive to practical problems. This paper constructs an isomorphism from equivalence relations to 2-circuit matroids, and provides two equivalent characterizations of attribute reductions of information systems with matroidal approaches. Firstly, we establish a matroidal structure of rough sets. Specifically, an approach to inducing a matroid fromrnan equivalence relation is proposed. Several equivalent formulations of independent sets of the matroid by an equivalence relation are presented. Secondly, an approach is provided to induce an equivalence relation from a matroid. Thirdly, an isomorphism from equivalence relations to 2-circuit matroids is constructed. We also use matroidal approaches to studying rough sets;specially, it is proved that the upper approximation operator with respect to an equivalence relation is equal to the closure operator of the matroid induced by the equivalence relation. Finally, attribute reductions of information systems are equivalently formulated with rank functions and closure operators of matroids induced by attributes.
-