覆盖粗糙集的图表示和2-部矩阵

计算机科学 ›› 2014, Vol. 41 ›› Issue (3): 85-87.

覆盖粗糙集的图表示和2-部矩阵

孙峰,王敬前

闽南师范大学福建省粒计算及其应用重点实验室漳州363000;闽南师范大学福建省粒计算及其应用重点实验室漳州363000

出版日期:2018-11-14 发布日期:2018-11-14
基金资助:
本文受国家自然科学基金面上项目(61170128),福建省自然科学基金项目(2012J01294),福建省自然科学基金省属高校专项(JK2012028),福建省计算机应用技术和信号与信息系统研究生教育创新基地(闽高教[2008]114号)资助

Graph Representation and 2-part Matrix of Covering-based Rough Sets

SUN Feng and WANG Jing-qian

Online:2018-11-14 Published:2018-11-14

摘要/Abstract

摘要： 通过图论和矩阵理论研究覆盖粗糙集。首先提出覆盖的关联二部图,一个覆盖的任意两个关联二部图都是同构的,进而从图论的角度给出一类覆盖近似算子的等价描述；然后给出二部图的2-部矩阵的定义,通过一个覆盖的关联二部图的2-部矩阵,既可以判断出这个覆盖是不是一元覆盖,又可以求出这个覆盖中的可约元；最后,研究划分对应的2-部矩阵的特点。

关键词: 覆盖粗糙集,近似算子,一元覆盖,可约元,二部图,2-部矩阵中图法分类号TP18文献标识码A

Abstract: Covering-based rough sets were studied through graphs and matrices．Firstly,bipartite graphs associated with a covering were proposed,and any two of them are isomorphic．Then a type of covering-based lower and upper approximation operators were represented through a bipartite graph associated with a covering．Secondly,the definition of 2-part matrix was presented for bipartite graphs．According to a 2-part matrix of a bipartite graph associated with a covering,not only one can know whether the covering is unary,but also reducible elements of the covering can be obtained．Finally,some characteristics of 2-part matrices of a bipartite graph associated with a partition were studied.

Key words: Covering-based rough set,Approximation operator,Unary covering,Reducible element,Bipartite graph,2-part matrix

孙峰,王敬前. 覆盖粗糙集的图表示和2-部矩阵[J]. 计算机科学, 2014, 41(3): 85-87. https://doi.org/

SUN Feng and WANG Jing-qian. Graph Representation and 2-part Matrix of Covering-based Rough Sets[J]. Computer Science, 2014, 41(3): 85-87. https://doi.org/

参考文献

[1] Pawlak Z．Rough sets[J]．International Journal of Computer and Information Sciences,1982,11(5):341-356
[2] 王炜,徐章艳,李晓瑜．不完备决策表中基于对象矩阵属性约简算法[J]．计算机科学,2012,39(4):201-204
[3] Hu Q H,An S,Yu D R．Soft fuzzy rough sets for robust feature evaluation and selection[J]．Information Sciences,2010,180(22):4384-4400
[4] Yang X B,Xie J,Song X N,et al．Credible rules in incomplete decision system based on descriptors[J]．Knowledge Based Systems,2009,22(1):8-17
[5] Zhong N．Rough sets in knowledge discovery and data mining[J]．Journal of Japan Society for Fuzzy Theory and Systems,2001,13:581-591
[6] Zakowski W．Approximations in the space (U,Ⅱ)[J]．Demonstration Mathematical,1983,16:761-769
[7] Zhu W,Wang F Y．Reduction and axiomization of covering generalized rough sets[J]．Information Sciences,2003,152:217-230
[8] 覃丽珍,姚炳学,李金海．基于信息量的完备覆盖约简算法[J]．计算机科学,2012,39(10):235-239
[9] 王石平,朱清新,祝峰,等．邻域粗糙集的矩阵表示与公理化[J]．合肥工业大学学报:自然科学版,2012,35(12):1624-1627
[10] Yao Y Y,Yao B X．Covering based rough set approximations [J]．Information Sciences,2012,200:91-107
[11] Bonikowski Z,Bryniarski E,Wybraniec U．Extensions and intentions in the rough set theory[J]．Information Sciences,1998,107:149-167
[12] Zhu W,Wang F Y．Relationships among three types of covering rough sets[C]∥Granular Computing,2006IEEE Internatioanl Conference.2006:43-48
[13] West D B．Introduction to Graph Theory[M]．Beijing:China Machine Press,2004
[14] 殷剑宏,吴开亚．图论及其算法[M]．合肥:中国科学技术大学出版社,2003
[15] Wang S P,Zhu W,Min F．Bipartite graphs and coverings[J]．Rough Sets and Knowledge Technology,2011,6954:722-727

Metrics

Viewed

Full text

Abstract

Cited

Shared

Discussed