New perspectives of granular computing in relation geometry induced by pairings
From MaRDI portal
Publication:2000596
DOI10.1007/S11565-019-00314-5OpenAlexW2915333016WikidataQ128350306 ScholiaQ128350306MaRDI QIDQ2000596FDOQ2000596
Authors: G. Chiaselotti, F. Infusino, T. 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
Recommendations
- scientific article; zbMATH DE number 1748440
- scientific article; zbMATH DE number 1303620
- scientific article; zbMATH DE number 1927363
- Association discovery from relational data via granular computing
- Granular computing and dual Galois connection
- Topological Aspects of Granular Computing
- scientific article; zbMATH DE number 1303621
- Set-theoretic approaches to granular computing
metric spacesgranular computingclosure operatorsinformation tablespairingsabstract simplicial complexes
Data structures (68P05) Galois correspondences, closure operators (in relation to ordered sets) (06A15) Relational systems, laws of composition (08A02) Metric spaces, metrizability (54E35) General topics in the theory of data (68P01)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A characterization of partial metrizability: Domains are quantifiable.
- A contribution to the study of fuzzy metric spaces
- A matroidal approach to rough set theory
- A new discrete dynamical system of signed integer partitions
- An application of rough sets to graph theory
- An extension of the dual complexity space and an application to computer science
- An introduction to sequential dynamical systems
- Applications of Bipartite Graphs and their Adjacency Matrices to Covering-based Rough Sets
- Approximation via a double-matroid structure
- Asymptotic negative type properties of finite ultrametric spaces
- Cayley graphs as classifiers for data mining: the influence of asymmetries
- Complexity spaces as quantitative domains of computation
- Continuity of posets via Scott topology and sobrification
- Continuous Lattices and Domains
- Data Types as Lattices
- Decision bireducts and decision reducts -- a comparison
- Decision systems in rough set theory: a set operatorial perspective
- Dependency and accuracy measures for directed graphs
- Dependency structures for decision tables
- Directed graphs and combinatorial properties of semigroups
- Discernibility matrix simplification for constructing attribute reducts
- Granular computing in decision approximation. An application of rough mereology
- Granular computing on information tables: families of subsets and operators
- Granular computing. An emerging paradigm
- Information granulation and rough set approximation
- Mathematical tools for data mining. Set theory, partial orders, combinatorics
- Matroidal approaches to rough sets via closure operators
- New rough approximations for \(n\)-cycles and \(n\)-paths
- Notions from rough set theory in a generalized dependency relation context
- Nullity-based matroid of rough sets and its application to attribute reduction
- On closed invariant sets in local dynamics
- On commuting polynomial automorphisms of \(\mathbb C^2\)
- On commuting polynomial automorphisms of \({\mathbb{C}}^{k}\), \(k \geq 3\)
- On generalized decision functions: reducts, networks and ensembles
- On periods and equilibria of computational sequential systems
- On the Galois lattice of bipartite distance hereditary graphs
- On the generalized roundness of finite metric spaces
- On transitive Cayley graphs of groups and semigroups
- Orthogonal partitions in designed experiments
- Pairings and related symmetry notions
- Parallel dynamical systems over directed dependency graphs
- Preclusivity and simple graphs
- Probabilistic approach to rough sets
- Rough matroids based on relations
- Rough sets and matroids from a lattice-theoretic viewpoint
- Rough sets. Mathematical foundations
- Rudiments of rough sets
- Simplicial complexes and closure systems induced by indistinguishability relations
- Strongly continuous posets and the local Scott topology
- The Banach fixed point theorem in fuzzy quasi-metric spaces with application to the domain of words
- The Smyth Completion
- The adjacency matrix of a graph as a data table: a geometric perspective
- Transactions on Rough Sets I
- Using information systems to solve recursive domain equations
- Variable precision rough set model
Cited In (4)
- Set relations and set systems induced by some families of integral domains
- Alexandroff topologies and monoid actions
- Representation theorems for simplicial complexes and matroidal-like properties of minimal partitioners
- Class-specific information measures and attribute reducts for hierarchy and systematicness
This page was built for publication: New perspectives of granular computing in relation geometry induced by pairings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2000596)
