[1]胡霞,费鹏,杜卫锋.集族等价与基于粒的下近似算子研究[J].智能系统学报,2018,13(02):327-330.[doi:10.11992/tis.201607018]
 HU Xia,FEI Peng,DU Weifeng.On collections equivalence and the granule based lower approximation operators[J].CAAI Transactions on Intelligent Systems,2018,13(02):327-330.[doi:10.11992/tis.201607018]
点击复制

集族等价与基于粒的下近似算子研究(/HTML)
分享到:

《智能系统学报》[ISSN:1673-4785/CN:23-1538/TP]

卷:
第13卷
期数:
2018年02期
页码:
327-330
栏目:
出版日期:
2018-04-15

文章信息/Info

Title:
On collections equivalence and the granule based lower approximation operators
作者:
胡霞1 费鹏2 杜卫锋3
1. 苏州工业职业技术学院 软件与服务外包学院, 江苏 苏州 215104;
2. 苏州市创采软件有限公司, 江苏 苏州 215128;
3. 嘉兴学院 数理与信息工程学院, 浙江 嘉兴 314001
Author(s):
HU Xia1 FEI Peng2 DU Weifeng3
1. School of Software and Service Outsourcing, Suzhou Institute of Industrial Technology, Suzhou 215104, China;
2. Suzhou Chuangcai Software Co., Ltd., Suzhou 215128, China;
3. School of Mathematics, Physics and Information Engineering, Jiaxing Univ
关键词:
近似算子约简粗集既约元可约元覆盖集族约简
Keywords:
approximation operatorsreductrough setsirreducible elementreducible elementcoveringgranulecollections reduct
分类号:
TP18
DOI:
10.11992/tis.201607018
摘要:
基于覆盖的粗集是推广经典粗集理论的方法之一,有基于元素、基于粒和基于子系统的3类定义上下近似的途径,以往大多数的文献往往从基于元素的角度出发进行定义。为了研究基于粒的近似算子特别是下近似算子的性质,借鉴格论中既约元、可约元等概念,提出了集族约简的概念。从集族约简出发,探讨了集族等价的概念与性质,并设计了集族约简的算法,得到了两个集族等价是两个集族生成相同的下近似运算的充要条件这一结果,为进一步开展一般二元关系下基于粒的近似算子的公理化方法的研究做了初步的理论方面的准备工作。
Abstract:
Covering based rough set is one of the methods to extend the classical rough set theory. There are three kinds of approaches, the element based definition, the granule based definition, and the subsystem based definition, to define upper and lower approximation. Most of the literature in the past tends to define based on element. In order to study the properties of the granule based approximation operators, especially the lower approximation operator, referring the concepts of irreducible element and reducible element from lattice theory, the concept of collections reduct is put forward. Starting from the concept of collections reduct, the concept and properties of collections equivalence are discussed, and collections reduction algorithm is designed. The result that collections equivalence is the necessary and sufficient condition for generating the same lower approximation by collections is given here. The preliminary theoretical preparation is done here to further develop the axiomatization of the granule based approximation operators under general binary relation.

参考文献/References:

[1] 张文修, 梁怡, 吴伟志. 信息系统与知识发现[M]. 北京: 科学出版社, 2003.
[2] 祝峰, 王飞跃. 关于覆盖广义粗集的一些基本结果[J]. 模式识别与人工智能, 2002, 15(1): 6-13.
ZHU Feng, WANG Feiyue. Some results on covering generalized rough sets[J]. Pattern recognition and artificial intelligence, 2002, 15(1): 6-13.
[3] YAO Yiyu, YAO Bingxue. Covering based rough set approximations[J]. Information sciences, 2012, 200: 91-107.
[4] RESTREPO M, CORNELIS C, GóMEZ J. Partial order relation for approximation operators in covering based rough sets[J]. Information sciences, 2014, 284: 44-59.
[5] RESTREPO M, GóMEZ J. Topological properties for approximation operators in covering based rough sets[C]//Proceeding of the 15th International Conference on Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing. Tianjin, China, 2015: 112-123.
[6] 李立峰, 俞伟. 概念格约简与覆盖约简之间的关系[J]. 陕西理工学院学报: 自然科学版, 2014, 30(3): 37-40.
LI Lifeng, YU Wei. Relationships of reduction between concept lattice and covering[J]. Journal of Shaanxi university of technology: natural science edition, 2014, 30(3): 37-40.
[7] WANG Changzhong, HE Qiang, CHEN Degang, et al. A novel method for attribute reduction of covering decision systems[J]. Information sciences, 2014, 254: 181-196.
[8] YANG Bin, ZHU W. A new type of covering-based rough sets[C]//Proceedings of the 9th International Conference on Rough Sets and Knowledge Technology. Shanghai, China, 2014: 489-499.
[9] 彭育威. 完全分配格的并一既约元的性质及分子格的代数结构[J]. 工程数学学报, 1985, 2(2): 113-117.
PENG Yuwei. Charaterization of a joiet lrreducible eiement of compietiy distributive lattice and agebric structure of a molecular lattice[J]. Chinese journal of engineering mathematics, 1985, 2(2): 113-117.
[10] 屈小兵, 王学平. 完备格上并既约元的性质[J]. 模糊系统与数学, 2004, 18(S1): 176-179.
QU Xiaobing, WANG Xueping. Some properties of join-irreducible elements in complete lattice[J]. Fuzzy systems and mathematics, 2004, 18(S1): 176-179.

相似文献/References:

[1]王金英,韩晓冰,王艳平.二型直觉模糊粗糙集[J].智能系统学报,2015,10(6):943.[doi:10.11992/tis.201412013]
 WANG Jinying,HAN Xiaobing,WANG Yanping.Type-2 intuitionistic fuzzy rough sets[J].CAAI Transactions on Intelligent Systems,2015,10(02):943.[doi:10.11992/tis.201412013]
[2]刘洪伟,王艳平.区间直觉模糊粗糙集的不确定性研究[J].智能系统学报,2014,9(05):613.[doi:10.3969/j.issn.1673-4785.201307007]
 LIU Hongwei,WANG Yanping.Research on uncertainty of interval-valued intuitionistic fuzzy rough sets[J].CAAI Transactions on Intelligent Systems,2014,9(02):613.[doi:10.3969/j.issn.1673-4785.201307007]
[3]王映龙,曾淇,钱文彬,等.变精度下不完备邻域决策系统的属性约简算法[J].智能系统学报,2017,12(03):386.[doi:10.11992/tis.201705027]
 WANG Yinglong,ZENG Qi,QIAN Wenbin,et al.Attribute reduction algorithm of the incomplete neighborhood decision system with variable precision[J].CAAI Transactions on Intelligent Systems,2017,12(02):386.[doi:10.11992/tis.201705027]

备注/Memo

备注/Memo:
收稿日期:2016-07-19。
基金项目:国家自然科学基金项目(61202109).
作者简介:胡霞,女,1979年生,讲师,主要研究方向为粗糙集理论、信息处理;费鹏,男,1978年生,高级工程师,主要研究方向为粗糙集、大数据处理;杜卫锋,男,1977年生,副教授,博士,主要研究方向为粗糙集理论。
通讯作者:杜卫锋.E-mail:23031520@qq.com.
更新日期/Last Update: 1900-01-01