Rough matroids based on relations
From MaRDI portal
Publication:2510128
DOI10.1016/j.ins.2012.12.029zbMath1293.05036OpenAlexW2064664059MaRDI QIDQ2510128
Publication date: 1 August 2014
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2012.12.029
Related Items (29)
Notions from rough set theory in a generalized dependency relation context ⋮ Rough sets on graphs: New dependency and accuracy measures ⋮ Unnamed Item ⋮ Similarity of binary relations based on rough set theory and topology: an application for topological structures of matroids ⋮ Rough sets and matroids from a lattice-theoretic viewpoint ⋮ Simplicial complexes and closure systems induced by indistinguishability relations ⋮ Dependency structures for decision tables ⋮ Generalized matroids based on three-way decision models ⋮ A new approach to generalized neighborhood system-based rough sets via convex structures and convex matroids ⋮ Granular computing on information tables: families of subsets and operators ⋮ Nullity-based matroid of rough sets and its application to attribute reduction ⋮ Rough set theory applied to finite dimensional vector spaces ⋮ A novel soft rough fuzzy set: \(Z\)-soft rough fuzzy ideals of hemirings and corresponding decision making ⋮ Another approach to rough soft hemirings and corresponding decision making ⋮ The lattice and matroid representations of definable sets in generalized rough sets based on relations ⋮ A kind of new rough set: Rough soft sets and rough soft rings ⋮ Reviews on decision making methods based on (fuzzy) soft sets and rough soft sets ⋮ Rough set approach to incomplete numerical data ⋮ The relationship among different covering approximations ⋮ Matrix approach to spanning matroids of rough sets and its application to attribute reduction ⋮ Rough approximation operators on \(R_0\)-algebras (nilpotent minimum algebras) with an application in formal logic \(\mathcal{L}^\ast\) ⋮ On measurements of covering rough sets based on granules and evidence theory ⋮ A New Description of Transversal Matroids Through Rough Set Approach ⋮ New perspectives of granular computing in relation geometry induced by pairings ⋮ The granular partition lattice of an information table ⋮ Multi-granulation entropy and its applications ⋮ Characteristic numbers and approximation operators in generalized rough approximation system ⋮ Approximation via a double-matroid structure ⋮ Granular computing on basic digraphs
This page was built for publication: Rough matroids based on relations
