Computer Science ›› 2016, Vol. 43 ›› Issue (1): 57-60.doi: 10.11896/j.issn.1002-137X.2016.01.013

Previous Articles     Next Articles

Matroidal Structure Induced by Neighborhood

LI Hui, ZHU Feng and LIN Zi-qiong   

  • Online:2018-12-01 Published:2018-12-01

Abstract: This paper constructed a matroidal structure by the neighborhood of a covering.At first,a family of sets was constructed through neighborhood and complementary neighborhood on a covering and the family of sets was proved to satisfy independent set axioms.Thus a matroidal structure of a covering was established.Then,we investigated some characteristics of this kind of matroid,such as dependent set,circuit,rank function and closure.At last,we gave some equivalent characterizations of dual matroid of the matroid,such as independent set and cicuit.

Key words: Rough set,Covering,Neighborhood,Complementary neighborhood,Matroid

[1] Calegari S,Ciucci D.Granular computing applied to ontologies[J].International Journal of Approximate Reasoning,2010,51(4):391-409
[2] Kryszkiewicz M.Rough set approach to incomplete information systems[J].Information Sciences,1998,112(1):39-49
[3] Hu Q,Yu D,Guo M.Fuzzy preference based rough sets[J].Information Sciences,2010,180(10):2003-2022
[4] Angiulli F,Pizzuti C.Outlier mining in large high dimensional data sets[J].IEEE Transactions on Knowledge and Data Engineering,2005,17(2):203-215
[5] Nieminen J.Rough tolerance equality[J].Fundamenta Informaticae,1988,11(3):289-296
[6] Abo-Tabl E A.A comparison of two kinds of definitionsof rough approximations based on a similarity relation[J].Information Sciences,2011,181(12):2587-2596
[7] Zhu W.Topological approaches to covering rough sets[J].Information Sciences,2007,177(6):1499-1508
[8] Wang S,Zhu W,Zhu Q,et al.Four matroidal structures of co-vering and their relationships with rough sets[J].International Journal of Approximate Reasoning,2013,54(9):1361-1372
[9] Lawler E L.Combinatorial optimization:networks and matroids[M].Courier Dover Publications,1976
[10] Edmonds J.Matroids and the greedy algorithm[J].Mathematical Programming,1971,1(1):127-136
[11] El Rouayheb S Y,Sprintson A,Georghiades C.On the index co-ding problem and its relation to network coding and matroid theory[J].IEEE Transactions on Information Theory,2010,56(7):3187-3195
[12] Wang S,Zhu W.Matroidal structure of covering-based roughsets through the upper approximation number[J].International Journal of Granular Computing,Rough Sets and Intelligent Systems,2011,2(2):141-148
[13] Li X,Liu S.Matroidal approaches to rough sets via closure opera-tors[J].International Journal of Approximate Reasoning,2012,53(4):513-527
[14] Zhu W,Wang F Y.Reduction and axiomization of covering gene-ralized rough sets[J].Information Sciences,2003,152:217-230
[15] Ma L.On some types of neighborhood-related covering rough sets[J].International Journal of Approximate Reasoning,2012,53(6):901-911
[16] Lai H J.Matroid theory[M].Beijing:Higher Education Press,2001(in Chinese)赖虹建.拟阵论[M].北京:高等教育出版社,2002
[17] Oxley J G.Matroid theory[M].Oxford University Press,2006

No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!