Granular computing on information tables: families of subsets and operators
From MaRDI portal
(Redirected from Publication:2198022)
Recommendations
Cites work
- scientific article; zbMATH DE number 994052 (Why is no real title available?)
- scientific article; zbMATH DE number 1810491 (Why is no real title available?)
- scientific article; zbMATH DE number 3932436 (Why is no real title available?)
- scientific article; zbMATH DE number 3677745 (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 3534506 (Why is no real title available?)
- scientific article; zbMATH DE number 2059848 (Why is no real title available?)
- scientific article; zbMATH DE number 754436 (Why is no real title available?)
- scientific article; zbMATH DE number 223333 (Why is no real title available?)
- scientific article; zbMATH DE number 3204690 (Why is no real title available?)
- A geometry of approximation. Rough set theory: logic, algebra and topology of conceptual patterns.
- A matroidal approach to rough set theory
- A new discrete dynamical system of signed integer partitions
- Characterization and reduction of concept lattices through matroid theory
- Compound approximation spaces for relational data
- Constructive and algebraic methods of the theory of rough sets
- Dependency structures for decision tables
- Description and classification of complex structured objects by applying similarity measures
- Dominance order on signed integer partitions
- Generalizations of rough set tools inspired by graph theory
- Generalized rough sets (preclusivity fuzzy-intuitionistic (BZ) lattices)
- Granular computing. An emerging paradigm
- Matroidal approaches to rough sets via closure operators
- On periods and equilibria of computational sequential systems
- On the connection of hypergraph theory with formal concept analysis and rough set theory
- Representations of Lattices by Sets
- Rough Set Theory and Digraphs
- Rough matroids based on relations
- Rough mereology: A new paradigm for approximate reasoning
- Rough sets and matroids from a lattice-theoretic viewpoint
- Simple graphs in granular computing
- Temporal dynamics in information tables
- The adjacency matrix of a graph as a data table: a geometric perspective
- The granular partition lattice of an information table
- Toward a theory of fuzzy information granulation and its centrality in human reasoning and fuzzy logic
- Transactions on Rough Sets I
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
- Rough sets on graphs: new dependency and accuracy measures
- A new approach to generalized neighborhood system-based rough sets via convex structures and convex matroids
- 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)
