Decision systems in rough set theory: A set operatorial perspective
From MaRDI portal
Publication:5376483
DOI10.1142/S021949881950004XzbMath1411.68155OpenAlexW2787964812MaRDI QIDQ5376483
F. Infusino, Giampiero Chiaselotti, Tommaso Gentile
Publication date: 10 May 2019
Published in: Journal of Algebra and Its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s021949881950004x
set partitionsrough set theoryclosure systemsdecision systemsabstract simplicial complexesset operators
Related Items (13)
Locally finite complexes, modules and generalized information systems ⋮ Three-way decision on two universes ⋮ Object similarity measures and Pawlak's indiscernibility on decision tables ⋮ Alexandroff topologies and monoid actions ⋮ 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 ⋮ New perspectives of granular computing in relation geometry induced by pairings ⋮ Dependency relations ⋮ Set relations and set systems induced by some families of integral domains ⋮ Local dissymmetry on graphs and related algebraic structures ⋮ Some classifications of graphs with respect to a set adjacency relation
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new discrete dynamical system of signed integer partitions
- Intersection properties of maximal directed cuts in digraphs
- The joy of implications, aka pure Horn formulas: mainly a survey
- A geometry of approximation. Rough set theory: logic, algebra and topology of conceptual patterns.
- A bijective toolkit for signed partitions
- On the supremal \(p\)-negative type of finite metric spaces
- On the gap of finite metric spaces of \(p\)-negative type
- New rough approximations for \(n\)-cycles and \(n\)-paths
- Orthogonal partitions in designed experiments
- Hypergraph families with bounded edge cover or transversal number
- Rudiments of rough sets
- Rough sets: some extensions
- Rough sets and Boolean reasoning
- Selections and topological convexity
- Enhanced negative type for finite metric trees
- On the complexity of monotone dualization and generating minimal hypergraph transversals
- Lower bounds for three algorithms for transversal hypergraph generation
- Union-closed families
- A theory of finite closure spaces based on implications
- Finite metric spaces of strictly negative type
- Resolvability in graphs and the metric dimension of a graph
- Dominance order on signed integer partitions
- Join-semidistributive lattices and convex geometries.
- Base exchange properties of graphic matroids
- An extension principle for closure operators
- A matroidal approach to rough set theory
- Combinatorial representations
- Four matroidal structures of covering and their relationships with rough sets
- The adjacency matrix of a graph as a data table: a geometric perspective
- Generated envelopes
- Riemann-Roch and Abel-Jacobi theory on a finite graph
- Decision bireducts and decision reducts -- a comparison
- Simplicial complexes and closure systems induced by indistinguishability relations
- Dependency and accuracy measures for directed graphs
- On rank functions of lattices
- A natural extension of the Young partition lattice
- Convexity in directed graphs
- A further characteristic of abstract convexity structures on topological spaces
- An Investigation About Rough Set Theory: Some Foundational and Mathematical Aspects
- Convex Structures and Continuous Selections
- On Generalized Decision Functions: Reducts, Networks and Ensembles
- Preclusivity and Simple Graphs
- Preclusivity and Simple Graphs: The n–cycle and n–path Cases
- Rough Set Theory Applied to Simple Undirected Graphs
- Lattices with Interior and Closure Operators and Abstract Approximation Spaces
- Formal Topology and Information Systems
- Optimal implicational bases for finite modular lattices
- Generalizations of Rough Set Tools Inspired by Graph Theory
- Rough Set Theory and Digraphs
- Metric and Symmetric Spaces
- Identifying the Minimal Transversals of a Hypergraph and Related Problems
- A class of lattices and boolean functions related to the Manickam–Miklös–Singhi conjecture
- Transactions on Rough Sets II
- Euler’s “De Partitio Numerorum”
- Metrization of Symmetric Spaces and Regular Maps
- [https://portal.mardi4nfdi.de/wiki/Publication:5731810 On the foundations of combinatorial theory I. Theory of M�bius Functions]
This page was built for publication: Decision systems in rough set theory: A set operatorial perspective
