Formal Concept Analysis over Graphs and Hypergraphs

Simple graphs in granular computing

“…In [39] different kinds of granulation from a spatial standpoint are proposed: a partition of the nodes, a partition of the edges and of the nodes, a partition of the edges and a covering of the nodes. In some following works, he investigated the granularity for graphs and hypergraphs from the mathematical morphology and spatial information system perspectives [40,41,42].…”

On the connection of hypergraph theory with formal concept analysis and rough set theory

“…On the other hand, in several other papers (see [14], [15], [30], [31]) specific hypergraphs associated with some particular type of formal contexts and Boolean information tables were constructed. For instance, Stell applies rough set and formal concept ideas to hypergraphs: in [30] rough hypergraph theory is introduced and, similarly, in [31] FCA are generalized using a relation on hypergraphs instead of sets. In [14] a hypergraph is considered as a basic model for granular structures.…”