Notions from rough set theory in a generalized dependency relation context
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1810491 (Why is no real title available?)
- scientific article; zbMATH DE number 3780545 (Why is no real title available?)
- scientific article; zbMATH DE number 53312 (Why is no real title available?)
- scientific article; zbMATH DE number 3464827 (Why is no real title available?)
- scientific article; zbMATH DE number 1249514 (Why is no real title available?)
- scientific article; zbMATH DE number 1303618 (Why is no real title available?)
- scientific article; zbMATH DE number 1748431 (Why is no real title available?)
- scientific article; zbMATH DE number 783754 (Why is no real title available?)
- scientific article; zbMATH DE number 3204690 (Why is no real title available?)
- A matroidal approach to rough set theory
- A new discrete dynamical system of signed integer partitions
- A relational model of data for large shared data banks
- An investigation about rough set theory: some foundational and mathematical aspects
- Chernoff's dual axiom, revealed preference and weak rational choice functions
- Choice functions and abstract convex geometries
- Choice functions over a finite set: A summary
- Constructive and algebraic methods of the theory of rough sets
- Default reasoning and possibility theory
- Dependence-space-based attribute reductions in inconsistent decision information systems
- Dependency structures for decision tables
- Discernibility matrix simplification for constructing attribute reducts
- Dominance order on signed integer partitions
- Four matroidal structures of covering and their relationships with rough sets
- Fuzzy sets and systems. Theory and applications
- Generalizations of rough set tools inspired by graph theory
- Generalized rough sets (preclusivity fuzzy-intuitionistic (BZ) lattices)
- Granular computing on information tables: families of subsets and operators
- Granular computing. An emerging paradigm
- Granular rough mereological logics with applications to dependencies in information and decision systems
- Lattices with Interior and Closure Operators and Abstract Approximation Spaces
- Mathematical tools for data mining. Set theory, partial orders, combinatorics
- New rough approximations for \(n\)-cycles and \(n\)-paths
- On periods and equilibria of computational sequential systems
- On the periods of parallel dynamical systems
- Pairings and related symmetry notions
- Path independence in serial-parallel data processing
- Preclusivity and simple graphs
- Preclusivity and simple graphs: the \(n\)-cycle and \(n\)-path cases
- Probabilistic approach to rough sets
- Rough Set Theory and Digraphs
- Rough Sets and Functional Dependencies in Data: Foundations of Association Reducts
- Rough matroids based on relations
- Rough sets and Boolean reasoning
- Rough sets. Mathematical foundations
- Rough sets: some extensions
- Rudiments of rough sets
- Simple graphs in granular computing
- Simplicial complexes and closure systems induced by indistinguishability relations
- The adjacency matrix of a graph as a data table: a geometric perspective
- The granular partition lattice of an information table
- Transactions on Rough Sets I
- Transactions on Rough Sets II
- Two views of the theory of rough sets in finite universes
- Using information systems to solve recursive domain equations
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
- Set relations and set systems induced by some families of integral domains
- Measurement, modeling, reduction of decision-theoretic multigranulation fuzzy rough sets based on three-way decisions
- Three-way dual concept analysis
- Dependency relations
- Pairings and related symmetry notions
- Granular computing on basic digraphs
- Granular computing on information tables: families of subsets and operators
- Granular cabin: an efficient solution to neighborhood learning in big data
- 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)
