Granular computing on information tables: families of subsets and operators
From MaRDI portal
Publication:2198022
DOI10.1016/J.INS.2018.02.046zbMATH Open1440.68288OpenAlexW2792691650MaRDI QIDQ2198022FDOQ2198022
Authors: G. Chiaselotti, F. Infusino, T. Gentile 
Publication date: 8 September 2020
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2018.02.046
Recommendations
Cites Work
- Compound approximation spaces for relational data
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A new discrete dynamical system of signed integer partitions
- Toward a theory of fuzzy information granulation and its centrality in human reasoning and fuzzy logic
- Title not available (Why is that?)
- Rough mereology: A new paradigm for approximate reasoning
- Constructive and algebraic methods of the theory of rough sets
- Title not available (Why is that?)
- A geometry of approximation. Rough set theory: logic, algebra and topology of conceptual patterns.
- Title not available (Why is that?)
- Matroidal approaches to rough sets via closure operators
- Representations of Lattices by Sets
- Transactions on Rough Sets I
- Granular computing. An emerging paradigm
- Generalized rough sets (preclusivity fuzzy-intuitionistic (BZ) lattices)
- Title not available (Why is that?)
- Temporal dynamics in information tables
- Rough matroids based on relations
- Rough sets and matroids from a lattice-theoretic viewpoint
- A matroidal approach to rough set theory
- Characterization and reduction of concept lattices through matroid theory
- Title not available (Why is that?)
- Simple graphs in granular computing
- On the connection of hypergraph theory with formal concept analysis and rough set theory
- 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?)
- Title not available (Why is that?)
- Dominance order on signed integer partitions
- The granular partition lattice of an information table
- On periods and equilibria of computational sequential systems
- Dependency structures for decision tables
- Generalizations of rough set tools inspired by graph theory
- Rough Set Theory and Digraphs
- Description and classification of complex structured objects by applying similarity measures
Cited In (14)
- Locally finite complexes, modules and generalized information systems
- Object similarity measures and Pawlak's indiscernibility on decision tables
- Three-way class-specific attribute reducts from the information viewpoint
- New perspectives of granular computing in relation geometry induced by pairings
- Set relations and set systems induced by some families of integral domains
- Notions from rough set theory in a generalized dependency relation context
- Granular computing on basic digraphs
- The granular partition lattice of an information table
- Some classes of abstract simplicial complexes motivated by module theory
- Generalized multi-scale decision tables with multi-scale decision attributes
- Class-specific information measures and attribute reducts for hierarchy and systematicness
- A new approach to generalized neighborhood system-based rough sets via convex structures and convex matroids
- Rough sets on graphs: new dependency and accuracy measures
- Granular computing: fundamentals and system modeling
This page was built for publication: Granular computing on information tables: families of subsets and operators
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2198022)
