An FCA-based approach to RDF graphs

 

Abstract

We investigate building a connection between RDF and FCA. The proposed approach transforms an RDF graph, where vertices represent objects of different types and edges represent relationships between these objects, into a series of bipartite graphs. It is achieved by separating edges representing specific relationships, resulting in a clear representation of the relationship of interest without clutter. To address this issue, we propose a bond-based construction of rigorous and benevolent compositions of bipartite graphs. These bipartite graphs are extracted from RDF graphs and combined—using the proposed construction—with external information related to the graphs’ entities.

Funding

Projects funding this work