RWTH Aachen University
RDF (Resource Description Framework) is the common data model to publish structured data on the Web. RDF data sets are given as subject-predicate-object triples and typically are represented as directed edge-labeled graphs. To make the information represented by such graphs comprehensible, RDF-Schema (RDFS) provides concepts to de ne a class-structure as part of the given RDF-graph and thus supports a more abstract view on the data set. In this paper, the authors follow a different approach and propose to make an RDF graph more comprehensible by reducing its size by partitioning to discover subgraphs which are similar with respect to their structure.