一种新的犹豫模糊粗糙近似算子的公理刻画

刘文; 米据生; 孙妍

doi:10.7544/issn1000-1239.2021.20200517

一种新的犹豫模糊粗糙近似算子的公理刻画

¹(河北师范大学数学科学学院石家庄 050024)
²(北京理工大学数学与统计学院北京 100081) (1216664721@qq.com)

基金项目: 国家自然科学基金项目(62076088, 61502144)；河北省自然科学基金项目(F2018205196, F2019205295)；河北省高等学校自然科学基金项目(BJ2019014)；河北省博士后择优资助科研项目(B2016003013)；河北省三三三人才杠程培养经费(A2017002112)

详细信息

中图分类号: TP18
计量
- 文章访问数: 388
- HTML全文浏览量: 1
- PDF下载量: 152
出版历程
- 发布日期: 2021-08-31

Axiomatic Characterization of New Hesitant Fuzzy Rough Approximation Operators

¹(School of Mathematical Sciences, Hebei Normal University, Shijiazhuang 050024)
²(School of Mathematics and Statistics, Beijing Institute of Technology, Beijing 100081)

Funds: This work was supported by the National Natural Science Foundation of China (62076088, 61502144), the Natural Science Foundation of Hebei Province (F2018205196, F2019205295), the Natural Science Foundation of Higher Education Institutions of Hebei Province (BJ2019014), the Postdoctoral Advanced Programs of Hebei Province (B2016003013), and the Training Funds for 333 Talents Project in Hebei Province (A2017002112).

摘要

摘要: 为了揭示犹豫模糊粗糙近似算子更深层次的本质特性,且更进一步研究犹豫模糊粗糙近似空间与犹豫模糊拓扑空间之间的关系,对犹豫模糊粗糙近似算子公理刻画问题的研究具有重要意义.在已有结果中,用来刻画犹豫模糊近似算子的公理集大都含有多条公理.由于近似算子公理化方法在研究粗糙集理论的数学结构中具有重要意义,寻找最小公理集成为公理化方法中的一个基本问题.针对上述问题,首次将公理集中的公理简化为一条,提出一种新的公理刻画形式.首先给出一般犹豫模糊粗糙近似算子的公理刻画,然后分别针对串行的、自反的、对称的、传递的和等价的犹豫模糊关系所生成的犹豫模糊粗糙近似算子公理化问题进行研究.最后证明了由犹豫模糊粗糙近似空间可以诱导出一个犹豫模糊拓扑空间.
- 近似算子 /
- 犹豫模糊关系 /
- 犹豫模糊粗糙集 /
- 犹豫模糊集 /
- 公理刻画
Abstract: In order to reveal the deeper essential characteristics of hesitant fuzzy rough approximation operators and further study the relationship between hesitant fuzzy rough approximation spaces and hesitant fuzzy topological spaces, it is of great significance to study the axiomatic characterizations of hesitant fuzzy rough approximation operators. In most of the existing results, the axioms used to describe hesitant fuzzy approximation operators contain multiple axioms. Since the axiomatic characterization of approximation operator is a key method in the research of the mathematical structure of rough set theory, it is a fundamental problem in axiomatic method to find the minimum set of abstract axioms. In view of the above problems, this paper focuses on the study of characterization by using single axiom. The number of axioms in the axiom set is simplified to unique axiom for the first time, and a new axiom description is proposed. First of all, the axiomatic characterizations of classical hesitant fuzzy rough approximation operators are given. Then, we study the problem of the axiomatization of hesitant fuzzy rough approximation operators generated by serial, reflexive, symmetric, transitive and equivalent hesitant fuzzy relations, respectively. Finally, it is proved that the hesitant fuzzy rough approximation space can induce a hesitant fuzzy topological space.
- approximation operator /
- hesitant fuzzy relation /
- hesitant fuzzy rough set /
- hesitant fuzzy set /
- axiomatic characterization

HTML全文

参考文献(0)

施引文献(15)

期刊类型引用(6)

1.	徐雪峰，郭广伟，黄余. 改进全卷积神经网络的遥感图像小目标检测. 机械设计与制造. 2024(10): 38-42 . 百度学术
2.	刘雯雯，汪皖燕，程树林. 融合项目热门惩罚因子改进协同过滤推荐方法. 计算机技术与发展. 2023(03): 15-19 . 百度学术
3.	冯勇，刘洋，王嵘冰，徐红艳，张永刚. 面向用户需求的生成对抗网络多样性推荐方法. 小型微型计算机系统. 2023(06): 1192-1197 . 百度学术
4.	冯晨娇，宋鹏，张凯涵，梁吉业. 融合社交网络信息的长尾推荐方法. 模式识别与人工智能. 2022(01): 26-36 . 百度学术
5.	韩迪，陈怡君，廖凯，林坤玲. 推荐系统中的准确性、新颖性和多样性的有效耦合与应用. 南京大学学报(自然科学). 2022(04): 604-614 . 百度学术
6.	甘亚男，耿生玲，郝立. 超贝叶斯图模型及其联结树的构建. 青海师范大学学报(自然科学版). 2021(02): 42-48 . 百度学术