Notions from rough set theory in a generalized dependency relation context
DOI10.1016/J.IJAR.2018.04.002zbMATH Open1446.03087OpenAlexW2802088460MaRDI QIDQ1644893FDOQ1644893
Authors: F. Infusino, G. Chiaselotti Edit this on Wikidata
Publication date: 22 June 2018
Published in: International Journal of Approximate Reasoning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ijar.2018.04.002
Recommendations
formal contextrough setpossibility measuresScott information systemsgeneralized dependency relations
Theory of fuzzy sets, etc. (03E72) Reasoning under uncertainty in the context of artificial intelligence (68T37) Knowledge representation (68T30)
Cites Work
- Fuzzy sets and systems. Theory and applications
- Title not available (Why is that?)
- Default reasoning and possibility theory
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A relational model of data for large shared data banks
- A new discrete dynamical system of signed integer partitions
- Rudiments of rough sets
- Two views of the theory of rough sets in finite universes
- Title not available (Why is that?)
- Rough sets: some extensions
- Rough sets and Boolean reasoning
- Probabilistic approach to rough sets
- Choice functions over a finite set: A summary
- Constructive and algebraic methods of the theory of rough sets
- Title not available (Why is that?)
- Dependence-space-based attribute reductions in inconsistent decision information systems
- Rough sets. Mathematical foundations
- Discernibility matrix simplification for constructing attribute reducts
- Lattices with Interior and Closure Operators and Abstract Approximation Spaces
- Transactions on Rough Sets I
- Granular computing. An emerging paradigm
- Generalized rough sets (preclusivity fuzzy-intuitionistic (BZ) lattices)
- Transactions on Rough Sets II
- Chernoff's dual axiom, revealed preference and weak rational choice functions
- Choice functions and abstract convex geometries
- Rough matroids based on relations
- A matroidal approach to rough set theory
- New rough approximations for \(n\)-cycles and \(n\)-paths
- Using information systems to solve recursive domain equations
- Simple graphs in granular computing
- The adjacency matrix of a graph as a data table: a geometric perspective
- Title not available (Why is that?)
- Title not available (Why is that?)
- Four matroidal structures of covering and their relationships with rough sets
- On the periods of parallel dynamical systems
- Path independence in serial-parallel data processing
- Dominance order on signed integer partitions
- Pairings and related symmetry notions
- Granular computing on information tables: families of subsets and operators
- The granular partition lattice of an information table
- On periods and equilibria of computational sequential systems
- Simplicial complexes and closure systems induced by indistinguishability relations
- Dependency structures for decision tables
- An investigation about rough set theory: some foundational and mathematical aspects
- Preclusivity and simple graphs
- Preclusivity and simple graphs: the \(n\)-cycle and \(n\)-path cases
- Granular rough mereological logics with applications to dependencies in information and decision systems
- Rough Sets and Functional Dependencies in Data: Foundations of Association Reducts
- Generalizations of rough set tools inspired by graph theory
- Rough Set Theory and Digraphs
- Mathematical tools for data mining. Set theory, partial orders, combinatorics
Cited In (17)
- Locally finite complexes, modules and generalized information systems
- Object similarity measures and Pawlak's indiscernibility on decision tables
- New perspectives of granular computing in relation geometry induced by pairings
- Measurement, modeling, reduction of decision-theoretic multigranulation fuzzy rough sets based on three-way decisions
- Set relations and set systems induced by some families of integral domains
- Three-way dual concept analysis
- Dependency relations
- Pairings and related symmetry notions
- Granular computing on basic digraphs
- Granular cabin: an efficient solution to neighborhood learning in big data
- Granular computing on information tables: families of subsets and operators
- Some classes of abstract simplicial complexes motivated by module theory
- Attribute reduction using functional dependency relations in rough set theory
- Local dissymmetry on graphs and related algebraic structures
- Lattice representations with set partitions induced by pairings
- Dependence space models to construct concept lattices
- A model of three-way decisions for knowledge harnessing
This page was built for publication: Notions from rough set theory in a generalized dependency relation context
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1644893)