Pages that link to "Item:Q1750616"

The following pages link to On the connection of hypergraph theory with formal concept analysis and rough set theory (Q1750616):

Displaying 16 items.

• An application of fuzzy hypergraphs and hypergraphs in granular computing (Q781861) (← links)
• Simple graphs in granular computing (Q1671713) (← links)
• Pairings and related symmetry notions (Q1989479) (← links)
• Describing hierarchy of concept lattice by using matrix (Q2053853) (← links)
• A heuristic approximation algorithm of minimum dominating set based on rough set theory (Q2168768) (← links)
• Granular computing on information tables: families of subsets and operators (Q2198022) (← links)
• Information structures in a fuzzy set-valued information system based on granular computing (Q2237188) (← links)
• The granular partition lattice of an information table (Q2293047) (← links)
• The adjacency matrix of a graph as a data table: a geometric perspective (Q2362877) (← links)
• Simplicial complexes and closure systems induced by indistinguishability relations (Q2408539) (← links)
• Dependency structures for decision tables (Q2411274) (← links)
• Dependency and accuracy measures for directed graphs (Q2423026) (← links)
• Rough Set Theory Applied to Simple Undirected Graphs (Q3300371) (← links)
• Indiscernibility structures induced from function sets : Graph and digraph case (Q5031926) (← links)
• Reduct-Irreducible $$\alpha $$ -cut Concept Lattices: An Efficient Reduction Procedure to Multi-adjoint Concept Lattices (Q5117200) (← links)
• Rough concepts (Q6081075) (← links)