On Coherent Indented Tree Visualization of RDF Graphs

Presented at: The 12th Extented Semantic Web Conference (ESWC2015)

by Qingxia Liu, Gong Cheng, Yuzhong Qu

Indented tree has been widely used to organize information and visualize graph-structured data like RDF graphs. Given a starting resource in a cyclic RDF graph, there are different ways of transforming the graph into a tree representation to be visualized as an indented tree. It would be interesting to investigate whether and how these different representations influence the user's browsing experience. In this paper, we address this issue from the coherence aspect of tree representation. We aim to smooth the user's reading experience by visualizing an optimal indented tree in the sense of featuring the fewest reversed edges, which often cause confusion and interrupt the user's cognitive process due to lack of a general, effective way of presentation. To achieve this, we propose a two-step approach that is theoretically proved to generate such an optimal tree representation for a given RDF graph and a specified starting resource. We also empirically show the difference in coherence between tree representations of real-world RDF graphs generated by our approach and two baseline approaches that have been widely adopted. These different tree representations lead to significantly different user experience in our preliminary user study, which reports a considerable degree of dependence between coherence and user experience.

Keywords: Browsing, Indented tree, Coherence, RDF visualization


Resource URI on the dog food server: http://data.semanticweb.org/conference/eswc/2015/paper/research/175


Explore this resource elsewhere: