Dependency structures for decision tables
From MaRDI portal
Publication:2411274
DOI10.1016/j.ijar.2017.06.007zbMath1418.68187OpenAlexW2640233652MaRDI QIDQ2411274
Giampiero Chiaselotti, F. Infusino, Tommaso Gentile
Publication date: 20 October 2017
Published in: International Journal of Approximate Reasoning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ijar.2017.06.007
Reasoning under uncertainty in the context of artificial intelligence (68T37) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items
Indiscernibility structures induced from function sets : Graph and digraph case, Notions from rough set theory in a generalized dependency relation context, Rough sets on graphs: New dependency and accuracy measures, Three-way decision on two universes, Simplicial complexes and closure systems induced by indistinguishability relations, Object similarity measures and Pawlak's indiscernibility on decision tables, Dependence space models to construct concept lattices, Rule acquisition in generalized multi-scale information systems with multi-scale decisions, Granular computing on information tables: families of subsets and operators, New perspectives of granular computing in relation geometry induced by pairings, Lattice representations with set partitions induced by pairings, Local dissymmetry on graphs and related algebraic structures
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new discrete dynamical system of signed integer partitions
- Information systems in modeling interactive computations on granules
- New rough approximations for \(n\)-cycles and \(n\)-paths
- Generalized rough sets (preclusivity fuzzy-intuitionistic (BZ) lattices)
- Covering based rough set approximations
- Interactive information systems: toward perception based computing
- Relative reducts in consistent and inconsistent decision tables of the Pawlak rough set model
- Rudiments of rough sets
- Rough sets: some extensions
- Rough sets and Boolean reasoning
- Nullity-based matroid of rough sets and its application to attribute reduction
- Positive approximation: an accelerator for attribute reduction in rough set theory
- Discernibility matrix simplification for constructing attribute reducts
- Constructive and algebraic methods of the theory of rough sets
- Simple graphs in granular computing
- Dominance order on signed integer partitions
- On the connection of hypergraph theory with formal concept analysis and rough set theory
- The granular partition lattice of an information table
- Description and classification of complex structured objects by applying similarity measures
- Association discovery from relational data via granular computing
- Rough matroids based on relations
- A natural extension of the Young partition lattice
- Information granulation and rough set approximation
- Unifying Rough Set Theories via Large Scaled Granular Computing
- An Investigation About Rough Set Theory: Some Foundational and Mathematical Aspects
- Relations on Hypergraphs
- Learning Spaces
- The Lattice Structure of Equally Extended Signed Partitions
- Preclusivity and Simple Graphs
- Preclusivity and Simple Graphs: The n–cycle and n–path Cases
- Connectedness of Graph and Matroid by Covering-Based Rough Sets
- The Matroidal Structures of the Second Type of Covering-Based Rough Set
- Rough Set Theory Applied to Simple Undirected Graphs
- Lattices with Interior and Closure Operators and Abstract Approximation Spaces
- Identifying the Minimal Transversals of a Hypergraph and Related Problems
- Simple Undirected Graphs as Formal Contexts
- Rough Sets and Current Trends in Computing
- Granular computing. An emerging paradigm
