On the public citation graph
A New Type of Covering Approximation Operators
0 signed · 28 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/11760146_58openalex-snapshot
Covering Based Granular Computing for Conflict Analysis
inferredcites →https://doi.org/10.1007/3-540-45813-1_43openalex-snapshot
Induction of Classification Rules by Granular Computing
inferredcites →https://doi.org/10.1007/3-540-69115-4_41openalex-snapshot
On Generalizing Pawlak Approximation Operators
inferredcites →https://doi.org/10.1016/s0020-0255(03)00056-2openalex-snapshot
Reduction and axiomization of covering generalized rough sets
inferredcites →https://doi.org/10.1016/s0020-0255(97)10046-9openalex-snapshot
Extensions and intentions in the rough set theory
inferredcites →https://doi.org/10.1016/s0020-0255(98)10019-1openalex-snapshot
Rough set approach to incomplete information systems
inferredcites →https://doi.org/10.1109/69.842271openalex-snapshot
A generalized definition of rough approximations based on similarity
inferredcites →https://doi.org/10.1109/grc.2006.1635755openalex-snapshot
Relationships among three types of covering rough sets
inferredcites →https://doi.org/10.1109/icmlc.2004.1384576openalex-snapshot
On the upper approximations of covering generalized rough sets
inferredcites →https://doi.org/10.1109/is.2006.348460openalex-snapshot
A New Type of Covering Rough Set
inferredcites →https://doi.org/10.1109/spawda.2008.4775750openalex-snapshot
The modifying generalized moving least squares approximation meshless method and application on plane piezoelectric problem
inferredcites →https://doi.org/10.1109/tkde.2003.1262181openalex-snapshot
Case generation using rough sets with fuzzy representation
inferredcites →https://doi.org/10.1109/tkde.2007.1044openalex-snapshot
On Three Types of Covering-Based Rough Sets
inferredcites →https://doi.org/10.1515/dema-1983-0319openalex-snapshot
APPROXIMATIONS IN THE SPACE (U,π)
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-030-10463-4_10openalex-snapshot
Matroids and Submodular Functions for Covering-Based Rough Sets
inferred← citeshttps://doi.org/10.1007/978-3-030-22815-6_10openalex-snapshot
Rough Matroids Based on Dual Approximation Operators
inferred← citeshttps://doi.org/10.1007/978-3-319-08729-0_13openalex-snapshot
Covering Based Rough Sets and Relation Based Rough Sets
inferred← citeshttps://doi.org/10.1007/978-3-319-60837-2_13openalex-snapshot
Approximation Operators in Covering Based Rough Sets from Submodular Functions
inferred← citeshttps://doi.org/10.1007/978-3-642-25553-3_61openalex-snapshot
Properties of the Fifth Type of Covering-Based Rough Sets
inferred← citeshttps://doi.org/10.1016/j.ijar.2013.08.002openalex-snapshot
Duality, conjugacy and adjointness of approximation operators in covering-based rough sets
inferred← citeshttps://doi.org/10.1016/j.ins.2012.02.065openalex-snapshot
Covering based rough set approximations
inferred← citeshttps://doi.org/10.1016/j.ins.2014.06.032openalex-snapshot
Partial order relation for approximation operators in covering based rough sets
inferred← citeshttps://doi.org/10.1109/grc.2010.127openalex-snapshot
Fuzzy Rough Set Model Based on Multi-fuzzy Granulations
inferred← citeshttps://doi.org/10.1109/icmlc.2012.6358909openalex-snapshot
Properties and axiomatization of fuzzy rough sets based on fuzzy covering
inferred← citeshttps://doi.org/10.2991/.2013.12openalex-snapshot
Characterization of neighborhood operators for covering based rough sets, using duality and adjointness
inferred← citeshttps://doi.org/10.4028/www.scientific.net/amr.548.735openalex-snapshot
Model of Covering Rough Sets in the Machine Intelligence
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.