Abstract:
The paper studies the axiomatization of rough sets. Pawlak matroids are characterized in terms of rank functions and connections between matchings in bipartites and Pawla...Show MoreMetadata
Abstract:
The paper studies the axiomatization of rough sets. Pawlak matroids are characterized in terms of rank functions and connections between matchings in bipartites and Pawlak matroids are pointed out. Using topological approaches, the Pawlak upper approximation operator is characterized by one condition. Additionally, a possible generalization of Pawlak rough sets based on coverings is pointed out.
Date of Conference: 26-28 July 2011
Date Added to IEEE Xplore: 15 September 2011
ISBN Information: