Matroidal approaches to rough sets via closure operators

DOI10.1016/j.ijar.2011.12.005zbMath1246.68233MaRDI QIDQ448937

Publication date: 11 September 2012

Published in: International Journal of Approximate Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ijar.2011.12.005

zbMATH Keywords

closure operator; topology; matroid; rough set; axiom; abstract approximation space

Mathematics Subject Classification ID

68T37: Reasoning under uncertainty in the context of artificial intelligence

54A05: Topological spaces and generalizations (closure spaces, etc.)

05B35: Combinatorial aspects of matroids and geometric lattices

06A15: Galois correspondences, closure operators (in relation to ordered sets)

Related Items

Approximation Operators in Covering Based Rough Sets from Submodular Functions, A New Description of Transversal Matroids Through Rough Set Approach, Topological Approaches to Generalized Rough Multisets, A rough set approach to the characterization of transversal matroids, Topological approach for rough sets by using J-nearly concepts via ideals, Idealization of j-approximation spaces, Topological approximations of multisets, On some types of neighborhood-related covering rough sets, Covering cycle matroid, Graph and matrix approaches to rough sets through matroids, Generalized three-way decision models based on subset evaluation, Covering based rough set approximations, Nullity-based matroid of rough sets and its application to attribute reduction, Matrix representations and interdependency on \(L\)-fuzzy covering-based approximation operators, Rough sets and matroids from a lattice-theoretic viewpoint, Generalized matroids based on three-way decision models, Generalization of Pawlak's rough approximation spaces by using \(\delta \beta \)-open sets, New perspectives of granular computing in relation geometry induced by pairings, Topologies generated by two ideals and the corresponding \(j\)-approximations spaces with applications, Dependence space models to construct concept lattices, Granular computing on information tables: families of subsets and operators, The lattice and matroid representations of definable sets in generalized rough sets based on relations, Matrix approach to spanning matroids of rough sets and its application to attribute reduction, Lattice representations with set partitions induced by pairings, The structures and the connections on four types of covering rough sets, Approximation via a double-matroid structure, Four operators of rough sets generalized to matroids and a matroidal method for attribute reduction, Four matroidal structures of covering and their relationships with rough sets, A categorical representation of algebraic domains based on variations of rough approximable concepts, Similarity of binary relations based on rough set theory and topology: an application for topological structures of matroids, A New Type of Covering-Based Rough Sets, Algebraic Representation, Dualities and Beyond, The Matroidal Structures of the Second Type of Covering-Based Rough Set

Cites Work