Decision systems in rough set theory: a set operatorial perspective
From MaRDI portal
Recommendations
Cites work
- A bijective toolkit for signed partitions
- A class of lattices and Boolean functions related to the Manickam-Miklös-Singhi conjecture
- A further characteristic of abstract convexity structures on topological spaces
- A geometry of approximation. Rough set theory: logic, algebra and topology of conceptual patterns.
- A matroidal approach to rough set theory
- A natural extension of the Young partition lattice
- A new discrete dynamical system of signed integer partitions
- A theory of finite closure spaces based on implications
- An extension principle for closure operators
- An investigation about rough set theory: some foundational and mathematical aspects
- Base exchange properties of graphic matroids
- Combinatorial representations
- Convex Structures and Continuous Selections
- Convexity in directed graphs
- Decision bireducts and decision reducts -- a comparison
- Dependency and accuracy measures for directed graphs
- Dominance order on signed integer partitions
- Enhanced negative type for finite metric trees
- Euler’s “De Partitio Numerorum”
- Finite metric spaces of strictly negative type
- Formal Topology and Information Systems
- Four matroidal structures of covering and their relationships with rough sets
- Generalizations of rough set tools inspired by graph theory
- Generated envelopes
- scientific article; zbMATH DE number 53312 (Why is no real title available?)
- scientific article; zbMATH DE number 2117211 (Why is no real title available?)
- scientific article; zbMATH DE number 3204690 (Why is no real title available?)
- scientific article; zbMATH DE number 3269827 (Why is no real title available?)
- Hypergraph families with bounded edge cover or transversal number
- Identifying the Minimal Transversals of a Hypergraph and Related Problems
- Intersection properties of maximal directed cuts in digraphs
- Join-semidistributive lattices and convex geometries.
- Lattices with Interior and Closure Operators and Abstract Approximation Spaces
- Lower bounds for three algorithms for transversal hypergraph generation
- Metric and Symmetric Spaces
- Metrization of Symmetric Spaces and Regular Maps
- New rough approximations for \(n\)-cycles and \(n\)-paths
- On generalized decision functions: reducts, networks and ensembles
- On rank functions of lattices
- On symmetry of uniform and preferential attachment graphs
- On the complexity of monotone dualization and generating minimal hypergraph transversals
- On the foundations of combinatorial theory I. Theory of M�bius Functions
- On the gap of finite metric spaces of \(p\)-negative type
- On the supremal p-negative type of finite metric spaces
- Optimal implicational bases for finite modular lattices
- Orthogonal partitions in designed experiments
- Preclusivity and simple graphs
- Preclusivity and simple graphs: the \(n\)-cycle and \(n\)-path cases
- Resolvability in graphs and the metric dimension of a graph
- Riemann-Roch and Abel-Jacobi theory on a finite graph
- Rough Set Theory and Digraphs
- Rough Set Theory Applied to Simple Undirected Graphs
- Rough sets and Boolean reasoning
- Rough sets: some extensions
- Rudiments of rough sets
- Selections and topological convexity
- Simplicial complexes and closure systems induced by indistinguishability relations
- Temporal dynamics in information tables
- The adjacency matrix of a graph as a data table: a geometric perspective
- The joy of implications, aka pure Horn formulas: mainly a survey
- Transactions on Rough Sets II
- Union-closed families
Cited in
(16)- New perspectives of granular computing in relation geometry induced by pairings
- Dependency relations
- Alexandroff topologies and monoid actions
- Set relations and set systems induced by some families of integral domains
- Three-way decision on two universes
- Object similarity measures and Pawlak's indiscernibility on decision tables
- Locally finite complexes, modules and generalized information systems
- Local dissymmetry on graphs and related algebraic structures
- Some classifications of graphs with respect to a set adjacency relation
- Class-specific information measures and attribute reducts for hierarchy and systematicness
- Categorification of a set relation geometry induced by rough operators
- Rule acquisition in generalized multi-scale information systems with multi-scale decisions
- Granular cabin: an efficient solution to neighborhood learning in big data
- Optimal scale generation in two-class dominance decision tables with sequential three-way decision
- Symmetry-based granulation in networks associated with commutative rings: application in social network dynamics
- Algebraic and order properties of maps and structures related to dependence relations arising in topology, algebra and rough set theory
This page was built for publication: Decision systems in rough set theory: a set operatorial perspective
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5376483)
