Exploring large readable and interactive RDF graphs
Leonidas Deligiannidis · 2009
In this paper we present an algorithm that enhances our previous user-centered, semi-autonomous visualization tool. Our previous tool is used to incrementally explore and visualize large RDF ontologies. Even though this implementation is very fast, hot spots in the graph i.e. nodes with a large number of immediate neighbors, clutter the display and decrease the level of interactivity. We propose a new algorithm that enhances our previous implementation by a) clustering information around hot spots and making the display readable, and b) as a result increase the frame rate and the level of interactivity.