New perspectives of granular computing in relation geometry induced by pairings
From MaRDI portal
Publication:2000596
DOI10.1007/s11565-019-00314-5OpenAlexW2915333016WikidataQ128350306 ScholiaQ128350306MaRDI QIDQ2000596
F. Infusino, Giampiero Chiaselotti, Tommaso Gentile
Publication date: 28 June 2019
Published in: Annali dell'Università di Ferrara. Sezione VII. Scienze Matematiche (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11565-019-00314-5
metric spacesclosure operatorspairingsgranular computinginformation tablesabstract simplicial complexes
Metric spaces, metrizability (54E35) Data structures (68P05) Relational systems, laws of composition (08A02) Galois correspondences, closure operators (in relation to ordered sets) (06A15) General topics in the theory of data (68P01)
Related Items
Alexandroff topologies and monoid actions ⋮ Class-specific information measures and attribute reducts for hierarchy and systematicness ⋮ Set relations and set systems induced by some families of integral domains
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new discrete dynamical system of signed integer partitions
- Asymptotic negative type properties of finite ultrametric spaces
- Matroidal approaches to rough sets via closure operators
- Complexity spaces as quantitative domains of computation
- New rough approximations for \(n\)-cycles and \(n\)-paths
- Orthogonal partitions in designed experiments
- An application of rough sets to graph theory
- Using information systems to solve recursive domain equations
- An introduction to sequential dynamical systems
- Rudiments of rough sets
- The Banach fixed point theorem in fuzzy quasi-metric spaces with application to the domain of words
- Nullity-based matroid of rough sets and its application to attribute reduction
- Strongly continuous posets and the local Scott topology
- Probabilistic approach to rough sets
- Discernibility matrix simplification for constructing attribute reducts
- An extension of the dual complexity space and an application to computer science
- Cayley graphs as classifiers for data mining: the influence of asymmetries
- Variable precision rough set model
- A characterization of partial metrizability: Domains are quantifiable.
- On commuting polynomial automorphisms of \(\mathbb C^2\)
- Directed graphs and combinatorial properties of semigroups
- Notions from rough set theory in a generalized dependency relation context
- Rough sets and matroids from a lattice-theoretic viewpoint
- On transitive Cayley graphs of groups and semigroups
- Rough sets. Mathematical foundations
- On the generalized roundness of finite metric spaces
- A matroidal approach to rough set theory
- Pairings and related symmetry notions
- Granular computing on information tables: families of subsets and operators
- On periods and equilibria of computational sequential systems
- Approximation via a double-matroid structure
- Granular computing in decision approximation. An application of rough mereology
- On the Galois lattice of bipartite distance hereditary graphs
- The adjacency matrix of a graph as a data table: a geometric perspective
- Decision bireducts and decision reducts -- a comparison
- Simplicial complexes and closure systems induced by indistinguishability relations
- Dependency structures for decision tables
- Dependency and accuracy measures for directed graphs
- Parallel dynamical systems over directed dependency graphs
- On commuting polynomial automorphisms of \({\mathbb{C}}^{k}\), \(k \geq 3\)
- Continuity of posets via Scott topology and sobrification
- Rough matroids based on relations
- On closed invariant sets in local dynamics
- Information granulation and rough set approximation
- A contribution to the study of fuzzy metric spaces
- On Generalized Decision Functions: Reducts, Networks and Ensembles
- Preclusivity and Simple Graphs
- Data Types as Lattices
- The Smyth Completion
- Applications of Bipartite Graphs and their Adjacency Matrices to Covering-based Rough Sets
- Continuous Lattices and Domains
- Transactions on Rough Sets I
- Decision systems in rough set theory: A set operatorial perspective
- Mathematical tools for data mining. Set theory, partial orders, combinatorics
- Granular computing. An emerging paradigm
