Pages that link to "Item:Q1935816"

The following pages link to A matroidal approach to rough set theory (Q1935816):

Displaying 39 items.

• Matroidal approaches to rough sets via closure operators (Q448937) (← links)
• Graph and matrix approaches to rough sets through matroids (Q508728) (← links)
• Multi-granulation entropy and its applications (Q742765) (← links)
• Notions from rough set theory in a generalized dependency relation context (Q1644893) (← links)
• Neighborhood operators for covering-based rough sets (Q1671266) (← links)
• Matroidal structure of rough sets from the viewpoint of graph theory (Q1760908) (← links)
• Covering-based rough sets on Eulerian matroids (Q1789823) (← links)
• Matroidal structure of rough sets based on serial and transitive relations (Q1952848) (← links)
• New perspectives of granular computing in relation geometry induced by pairings (Q2000596) (← links)
• Some classes of abstract simplicial complexes motivated by module theory (Q2196332) (← links)
• Granular computing on information tables: families of subsets and operators (Q2198022) (← links)
• Matrix approach to spanning matroids of rough sets and its application to attribute reduction (Q2238210) (← links)
• Lattice representations with set partitions induced by pairings (Q2290345) (← links)
• The granular partition lattice of an information table (Q2293047) (← links)
• Set relations and set systems induced by some families of integral domains (Q2295472) (← links)
• Approximation via a double-matroid structure (Q2318598) (← links)
• Four operators of rough sets generalized to matroids and a matroidal method for attribute reduction (Q2333783) (← links)
• The adjacency matrix of a graph as a data table: a geometric perspective (Q2362877) (← links)
• Note on ``A rough set approach to the characterization of transversal matroids'' (Q2374522) (← links)
• Similarity of binary relations based on rough set theory and topology: an application for topological structures of matroids (Q2403318) (← links)
• Simplicial complexes and closure systems induced by indistinguishability relations (Q2408539) (← links)
• Object similarity measures and Pawlak's indiscernibility on decision tables (Q2666859) (← links)
• The properties of rough matroids based on equivalence relations (Q2824148) (← links)
• Matrix representation and axiomatization of neighborhood-based rough sets (Q2858727) (← links)
• Rough sets on graphs: New dependency and accuracy measures (Q4554547) (← links)
• (Q4697927) (← links)
• Indiscernibility structures induced from function sets : Graph and digraph case (Q5031926) (← links)
• Locally finite complexes, modules and generalized information systems (Q5073316) (← links)
• Approximation Operators in Covering Based Rough Sets from Submodular Functions (Q5082213) (← links)
• (Q5126171) (← links)
• (Q5127922) (← links)
• A New Description of Transversal Matroids Through Rough Set Approach (Q5164865) (← links)
• (Q5166134) (← links)
• Decision systems in rough set theory: A set operatorial perspective (Q5376483) (← links)
• Granular computing on basic digraphs (Q5866244) (← links)
• A rough set approach to the characterization of transversal matroids (Q5963134) (← links)
• Class-specific information measures and attribute reducts for hierarchy and systematicness (Q6064476) (← links)
• Categorification of a set relation geometry induced by rough operators (Q6077348) (← links)
• A new approach to generalized neighborhood system-based rough sets via convex structures and convex matroids (Q6125260) (← links)