Matroidal structure of covering-based rough sets through the upper approximation number

ISSN： 1757-2703

Source： International Journal of Granular Computing, Rough Sets and Intelligent Systems, Vol.2, Iss.2, 2011-10, pp. : 141-148

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Condition for covering-based upper approximation operators to be closure operators of matroids

By Su Lirun Zhu William

International Journal of Granular Computing, Rough Sets and Intelligent Systems, Vol. 3, Iss. 2, 2013-10 ,pp. : 144-159

Inderscience Publishers

Access to resources Recommend Favorite

Covering-Based Routing Algorithms for Cyclic Content-Based P/S Overlays

By Chen Ming-Wen

Journal of Computer Science and Technology, Vol. 25, Iss. 6, 2010-11 ,pp. : 1214-1224

Springer Publishing Company

Access to resources Recommend Favorite

Time series forecasting through rule-based models obtained via rough sets

By Faustino Claudio

Artificial Intelligence Review, Vol. 36, Iss. 4, 2011-12 ,pp. : 299-310

Springer Publishing Company

Access to resources Recommend Favorite

Covering Based Pessimistic Multigranular Approximate Rough Equalities and Their Properties

International Journal of Rough Sets and Data Analysis (IJRSDA), Vol. 5, Iss. 1, 2018-01 ,pp. : 58-78

IGI Global_journal

Access to resources Recommend Favorite

Reliability evaluation of conceptual colour design based on rough sets

By Zhang Quan Ming X.G. Lu Changde

International Journal of Computer Applications in Technology, Vol. 37, Iss. 3-4, 2010-03 ,pp. : 204-209

Inderscience Publishers

Access to resources Recommend Favorite