2012/09/25 by Lirun Su, Su, Lirun, William Zhu +1
Computer Science · #Artificial Intelligence (cs.AI) #Data Mining Algorithms and Applications #FOS: Computer and information sciences #I.2.3 #I.2.4 #Rough Sets and Fuzzy Logic
paper · pdf · doi:10.48550/arxiv.1209.5473
openalex publication_date 2012/09/25 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
At present, practical application and theoretical discussion of rough sets are two hot problems in computer science. The core concepts of rough set theory are upper and lower approximation operators based on equivalence relations. Matroid, as a branch of mathematics, is a structure that generalizes linear independence in vector spaces. Further, matroid theory borrows extensively from the terminology of linear algebra and graph theory. We can combine rough set theory with matroid theory through using rough sets to study some characteristics of matroids. In this paper, we apply rough sets to matroids through defining a family of sets which are constructed from the upper approximation operator with respect to an equivalence relation. First, we prove the family of sets satisfies the support set axioms of matroids, and then we obtain a matroid. We say the matroids induced by the equivalence relation and a type of matroid, namely support matroid, is induced. Second, through rough sets, some characteristics of matroids such as independent sets, support sets, bases, hyperplanes and closed sets are investigated.