New perspectives of granular computing in relation geometry induced by pairings

DOI10.1007/S11565-019-00314-5OpenAlexW2915333016WikidataQ128350306 ScholiaQ128350306MaRDI QIDQ2000596FDOQ2000596

F. Infusino, G. Chiaselotti, 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

zbMATH Keywords

metric spacesgranular computingclosure operatorsinformation tablespairingsabstract simplicial complexes

Mathematics Subject Classification ID

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?)
• Variable precision rough set model
• A characterization of partial metrizability: Domains are quantifiable.
• The Smyth Completion
• Continuous Lattices and Domains
• Parallel dynamical systems over directed dependency graphs
• Continuity of posets via Scott topology and sobrification
• A new discrete dynamical system of signed integer partitions
• Data Types as Lattices
• Rudiments of rough sets
• Cayley graphs as classifiers for data mining: the influence of asymmetries
• On transitive Cayley graphs of groups and semigroups
• Information granulation and rough set approximation
• Probabilistic approach to rough sets
• An extension of the dual complexity space and an application to computer science
• The Banach fixed point theorem in fuzzy quasi-metric spaces with application to the domain of words
• A contribution to the study of fuzzy metric spaces
• Directed graphs and combinatorial properties of semigroups
• On the generalized roundness of finite metric spaces
• Asymptotic negative type properties of finite ultrametric spaces
• Complexity spaces as quantitative domains of computation
• Rough sets. Mathematical foundations
• Matroidal approaches to rough sets via closure operators
• An introduction to sequential dynamical systems
• Discernibility matrix simplification for constructing attribute reducts
• Transactions on Rough Sets I
• Granular computing. An emerging paradigm
• Rough matroids based on relations
• An application of rough sets to graph theory
• Rough sets and matroids from a lattice-theoretic viewpoint
• A matroidal approach to rough set theory
• Nullity-based matroid of rough sets and its application to attribute reduction
• On commuting polynomial automorphisms of \(\mathbb C^2\)
• Orthogonal partitions in designed experiments
• New rough approximations for \(n\)-cycles and \(n\)-paths
• Dependency and accuracy measures for directed graphs
• Using information systems to solve recursive domain equations
• Strongly continuous posets and the local Scott topology
• Decision bireducts and decision reducts -- a comparison
• The adjacency matrix of a graph as a data table: a geometric perspective
• Notions from rough set theory in a generalized dependency relation context
• Pairings and related symmetry notions
• Granular computing on information tables: families of subsets and operators
• On periods and equilibria of computational sequential systems
• Simplicial complexes and closure systems induced by indistinguishability relations
• Dependency structures for decision tables
• Preclusivity and Simple Graphs
• Mathematical tools for data mining. Set theory, partial orders, combinatorics
• Granular computing in decision approximation. An application of rough mereology
• On the Galois lattice of bipartite distance hereditary graphs
• Applications of Bipartite Graphs and their Adjacency Matrices to Covering-based Rough Sets
• On commuting polynomial automorphisms of \({\mathbb{C}}^{k}\), \(k \geq 3\)
• On closed invariant sets in local dynamics
• Approximation via a double-matroid structure
• On Generalized Decision Functions: Reducts, Networks and Ensembles
• Decision systems in rough set theory: A set operatorial perspective

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

Recommendations

• Association discovery from relational data via granular computing 👍 👎
• Granular computing and dual Galois connection 👍 👎
• Topological Aspects of Granular Computing 👍 👎
• 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?) 👍 👎

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)