不同覆盖产生相同覆盖近似集的条件研究

南京大学学报(自然科学版) ›› 2014, Vol. 50 ›› Issue (1): 72–.

不同覆盖产生相同覆盖近似集的条件研究

汤建国1,汪江桦1,佘堃2,祝峰3

出版日期:2014-01-16 发布日期:2014-01-16
作者简介:(1.新疆财经大学计算机科学与工程学院,乌鲁木齐,830012; 2. 电子科技大学计算机科学与工程学院,成都,611731; 3. 闽南师范大学粒计算实验室,漳州,363000)
基金资助:
国家自然科学基金( 61170128)，福建省自然科学基金(2011J01374, 2012J01294)，新疆财经大学博士启动基金

On conditions for the same covering approximation sets induced by different coverings

Tang Jianguo1, Wang Jianghua1, She Kun2, William Zhu3

Online:2014-01-16 Published:2014-01-16
About author:1. School of Computer Science and Engineering, Xinjiang University of Finance and Economics, Urumqi, 830012, China; 2. School of Computer Science and Engineering, University of Electronic Science and Technology of China, Chengdu, 611731, China; 3. Laboratory of Granular Computing, Minnan Normal University, Zhangzhou, 363000, China

摘要/Abstract

摘要： 覆盖粗糙集是处理不确定性问题的一种有效方法，在最近几年日益受到研究人员的关注。由于覆盖具有很强的一般性，使得出现了许多从不角度构建的覆盖粗糙集模型。然而，由此引发的一个现实而关键的问题还未得到全面有效的解决，即：对于某个模型而言，不同的覆盖产生相同覆盖近似集的条件是什么？针对这个问题，以六类主要的覆盖粗糙集模型为研究对象，对它们的上下近似产生原理展开了深入分析。研究发现各模型的近似集与覆盖中的极大块或极小块有着紧密联系，基于此提出了最小覆盖和最大覆盖的概念，利用它们的特性对该问题进行了探讨和解决。

Abstract: Covering-based rough sets provide an effective method to deal with the uncertainty in data. It is attracting more and more interests of researchers in recent years. Due to the weak constraint definition of covering, there arise many different covering-based rough set models established from different viewpoints. And this causes a key problem that under what conditions a covering-based rough set model can generate the same covering approximations induced from different coverings. This paper will get more into the problem. The study assessed six covering-based rough set models and explored the principles that how these models generate respectly their own approximation sets. A rule is found that the six types of approximation sets have a closed relation to those maximum blocks or minimum blocks in a covering. Therefore, the maximal covering and the minimal covering are proposed. By using the properties of this two concepts, the problem are discussed detailly and a solution to it is given.

汤建国1,汪江桦1,佘堃2,祝峰3. 不同覆盖产生相同覆盖近似集的条件研究[J]. 南京大学学报(自然科学版), 2014, 50(1): 72–.

Tang Jianguo1, Wang Jianghua1, She Kun2, William Zhu3. On conditions for the same covering approximation sets induced by different coverings[J]. Journal of Nanjing University(Natural Sciences), 2014, 50(1): 72–.

参考文献

[1] Zhu W, Wang F Y. Reduction and axiomization of covering generalized rough sets. Information Sciences, 2003, 152: 217~230. [2] Mordeson J N. Rough set theory applied to (fuzzy) ideal theory. Fuzzy Sets and Systems, 2001, 121: 315~324. [3] Zhu W, Wang F Y. On three types of covering-based rough sets. IEEE Transactions on Knowledge and Data Engineering, 2007, 19(8): 1131~1144. [4] Hu Q H, Yu D R, Liu J F, et al. Neighborhood rough set based heterogeneous feature subset selection. Information Sciences, 2008, 178(18): 3577~3594. [5] Fan N, Hu G, Xiao X, et al. Study on conditions of neighborhoods forming a partition. The 9th International Conference on Fuzzy Systems and Knowledge Discovery, Chongqing, 2012. [6] Yun Z, Ge X, Bai X. Axiomatization and conditions for neighborhoods in a covering to form a partition. Information Sciences, 2011, 181(9): 1735~1740. [7] Tang J G, She K, Zhu W. The refinement in covering-based rough sets. Proceeding of the International Conference on Granular Computing. Taiwan, China: IEEE Computer Science, 2012: 641~646. [8] Tang J G, She K, Zhu W. Covering-based rough sets based on the refinement of covering-element. International Journal of Computational and Mathematical Sciences, 2011, 5: 198~208. [9] 谢骋，商琳. 基于三支决策粗糙集的视频异常行为检测. 南京大学学报(自然科学), 2013, 49(4): 475~482. [10] 王丽娟，杨习贝，杨静宇等. 一种新的不完备多粒度粗糙集. 南京大学学报(自然科学), 2012, 48(4): 436-444. [11] 黄兵. 优势区间直觉模糊粗糙模型及应用. 南京大学学报(自然科学), 2012, 48(4): 367~375. [12] 徐久成，李晓艳，孙林. 一种基于概率粗糙集模型的图像语义检索方法. 南京大学学报(自然科学), 2011, 47(4): 438~445. [13] 王石平，祝峰，朱培勇. 基于抽象相关关系的粗糙集研究. 南京大学学报(自然科学), 2010, 46(5): 507~510. [14] Zakowski W. Approximations in the Space(U,∏). Demonstratio Mathematica, 1983(16): 761~769. [15] Bonikowski Z, Bryniarski E, Wybraniec-Skardowska U. Extensions and intensions in the rough set theory. Information Sciences, 1998, 107(1-4): 149~167. [16] 汤建国，佘堃，祝峰. 覆盖Vague集. 计算机科学, 2012, 39(01): 256~260. [17] Pomykala J A. Approximation operations in approximation space. Bulletin of the Polish Academy of Sciences, 1987, 35(9-10): 653~662. [18] Tsang E C C, Chen D G, Lee J W T, et al. On the upper approximations of covering generalized rough sets. Proceedings of the 3rd International Conference on Machine Learning and Cybernetics. Shanghai, China: IEEE Computer Society, 2004: 4200~4203. [19] Zhu W, Wang F Y. A new type of covering rough set. Proceeding of the 3rd International IEEE Conference on Intelligent Systems. London, United kingdom: IEEE Inc., 2006: 444~449. [20] Zhu W. Topological approaches to covering rough sets. Information Sciences, 2007, 177(6): 1499~1508. [21] 王健鹏，戴岱，周正春. 基于覆盖的模糊粗糙集模型. 周口师范学院学报, 2004, 21(2): 20~22. [22] Zhu W. Relationship between generalized rough sets based on binary relation and covering. Information Sciences, 2009, 179(3): 210~225. [23] Zhu W, Wang F. Relationships among three types of covering rough sets. IEEE International Conference on Granular Computing. Atlanta, GA, United states: IEEE Computer Society, 2006: 43~48. [24] Zhu W, Wang F Y. The fourth type of covering-based rough sets. Information Sciences, 2012, 201: 80~92.

Metrics

Viewed

Full text

Abstract

Cited

Shared

Discussed