New perspectives of granular computing in relation geometry induced by pairings
type: Item
instance of: scholarly article
title: New perspectives of granular computing in relation geometry induced by pairings
author: G. Chiaselotti
author: F. Infusino
author: T. Gentile
published in: Annali dell'Università di Ferrara. Sezione VII. Scienze Matematiche
publication date: 2019-06-28T00:00:00Z
Mathematics Subject Classification ID: 06A15
Mathematics Subject Classification ID: 08A02
Mathematics Subject Classification ID: 68P01
Mathematics Subject Classification ID: 68P05
Mathematics Subject Classification ID: 54E35
zbMATH DE Number: 7074946
zbMATH Keywords: pairings
zbMATH Keywords: closure operators
zbMATH Keywords: abstract simplicial complexes
zbMATH Keywords: information tables
zbMATH Keywords: metric spaces
zbMATH Keywords: granular computing
MaRDI profile type: Publication
full work available at URL: s11565-019-00314-5
OpenAlex ID: W2915333016
cites work: Parallel dynamical systems over directed dependency graphs
cites work: On periods and equilibria of computational sequential systems
cites work: On the Galois lattice of bipartite distance hereditary graphs
cites work: Q4050122
cites work: Q4348453
cites work: Orthogonal partitions in designed experiments
cites work: Q4828542
cites work: Q5532570
cites work: On commuting polynomial automorphisms of \(\mathbb C^2\)
cites work: On commuting polynomial automorphisms of \({\mathbb{C}}^{k}\), \(k \geq 3\)
cites work: On closed invariant sets in local dynamics
cites work: A new discrete dynamical system of signed integer partitions
cites work: An application of rough sets to graph theory
cites work: Preclusivity and Simple Graphs
cites work: Simplicial complexes and closure systems induced by indistinguishability relations
cites work: Dependency structures for decision tables
cites work: The adjacency matrix of a graph as a data table: a geometric perspective
cites work: Dependency and accuracy measures for directed graphs
cites work: Pairings and related symmetry notions
cites work: Granular computing on information tables: families of subsets and operators
cites work: Decision systems in rough set theory: A set operatorial perspective
cites work: Notions from rough set theory in a generalized dependency relation context
cites work: Asymptotic negative type properties of finite ultrametric spaces
cites work: Q4230685
cites work: Continuous Lattices and Domains
cites work: Q4346721
cites work: Nullity-based matroid of rough sets and its application to attribute reduction
cites work: Directed graphs and combinatorial properties of semigroups
cites work: On transitive Cayley graphs of groups and semigroups
cites work: Cayley graphs as classifiers for data mining: the influence of asymmetries
cites work: Using information systems to solve recursive domain equations
cites work: Matroidal approaches to rough sets via closure operators
cites work: Rough sets and matroids from a lattice-theoretic viewpoint
cites work: Approximation via a double-matroid structure
cites work: An introduction to sequential dynamical systems
cites work: Q4003537
cites work: Rudiments of rough sets
cites work: Granular computing. An emerging paradigm
cites work: Rough sets. Mathematical foundations
cites work: Q3148332
cites work: Granular computing in decision approximation. An application of rough mereology
cites work: An extension of the dual complexity space and an application to computer science
cites work: The Banach fixed point theorem in fuzzy quasi-metric spaces with application to the domain of words
cites work: Complexity spaces as quantitative domains of computation
cites work: New rough approximations for \(n\)-cycles and \(n\)-paths
cites work: A contribution to the study of fuzzy metric spaces
cites work: The Smyth Completion
cites work: A characterization of partial metrizability: Domains are quantifiable.
cites work: Data Types as Lattices
cites work: Q3959414
cites work: Mathematical tools for data mining. Set theory, partial orders, combinatorics
cites work: Q4024050
cites work: Q4458143
cites work: On Generalized Decision Functions: Reducts, Networks and Ensembles
cites work: Decision bireducts and decision reducts -- a comparison
cites work: A matroidal approach to rough set theory
cites work: Applications of Bipartite Graphs and their Adjacency Matrices to Covering-based Rough Sets

New perspectives of granular computing in relation geometry induced by pairings (cites work)
cites work: On the generalized roundness of finite metric spaces

New perspectives of granular computing in relation geometry induced by pairings (cites work)
cites work: Information granulation and rough set approximation

New perspectives of granular computing in relation geometry induced by pairings (cites work)
cites work: Q4530306

New perspectives of granular computing in relation geometry induced by pairings (cites work)
cites work: Transactions on Rough Sets I

New perspectives of granular computing in relation geometry induced by pairings (cites work)
cites work: Discernibility matrix simplification for constructing attribute reducts

New perspectives of granular computing in relation geometry induced by pairings (cites work)
cites work: Continuity of posets via Scott topology and sobrification

New perspectives of granular computing in relation geometry induced by pairings (cites work)
cites work: Strongly continuous posets and the local Scott topology

New perspectives of granular computing in relation geometry induced by pairings (cites work)
cites work: Rough matroids based on relations

New perspectives of granular computing in relation geometry induced by pairings (cites work)
cites work: Variable precision rough set model

New perspectives of granular computing in relation geometry induced by pairings (cites work)
cites work: Probabilistic approach to rough sets

New perspectives of granular computing in relation geometry induced by pairings (Wikidata QID)
Wikidata QID: Q128350306

New perspectives of granular computing in relation geometry induced by pairings (DOI)
DOI: 10.1007/S11565-019-00314-5

New perspectives of granular computing in relation geometry induced by pairings (Recommended article)
Recommended article: Q4530316
Similarity Score: 0.8597017
Recommender Run: Recommender Run 3

New perspectives of granular computing in relation geometry induced by pairings (Recommended article)
Recommended article: Q4250247
Similarity Score: 0.85602367
Recommender Run: Recommender Run 3

New perspectives of granular computing in relation geometry induced by pairings (Recommended article)
Recommended article: Q4484261
Similarity Score: 0.85340685
Recommender Run: Recommender Run 3

New perspectives of granular computing in relation geometry induced by pairings (Recommended article)
Recommended article: Association discovery from relational data via granular computing
Similarity Score: 0.8392869
Recommender Run: Recommender Run 3

New perspectives of granular computing in relation geometry induced by pairings (Recommended article)
Recommended article: Granular computing and dual Galois connection
Similarity Score: 0.8386399
Recommender Run: Recommender Run 3

New perspectives of granular computing in relation geometry induced by pairings (Recommended article)
Recommended article: Topological Aspects of Granular Computing
Similarity Score: 0.835687
Recommender Run: Recommender Run 3

New perspectives of granular computing in relation geometry induced by pairings (Recommended article)
Recommended article: Q4250248
Similarity Score: 0.83393884
Recommender Run: Recommender Run 3

New perspectives of granular computing in relation geometry induced by pairings (Recommended article)
Recommended article: Q3166681
Similarity Score: 0.8334808
Recommender Run: Recommender Run 3