Conference Paper

Have Green - A Visual Analytics Framework for Large Semantic Graphs.

Pacific Northwest Nat. Lab., Richland, WA
DOI: 10.1109/VAST.2006.261432 Conference: IEEE Symposium On Visual Analytics Science And Technology, IEEE VAST 2006, October 31-November 2, 2006, Baltimore, Maryland, USA
Source: DBLP

ABSTRACT A semantic graph is a network of heterogeneous nodes and links annotated with a domain ontology. In intelligence analysis, investigators use semantic graphs to organize concepts and relationships as graph nodes and links in hopes of discovering key trends, patterns, and insights. However, as new information continues to arrive from a multitude of sources, the size and complexity of the semantic graphs will soon overwhelm an investigator's cognitive capacity to carry out significant analyses. We introduce a powerful visual analytics framework designed to enhance investigators' natural analytical capabilities to comprehend and analyze large semantic graphs. The paper describes the overall framework design, presents major development accomplishments to date, and discusses future directions of a new visual analytics system known as Have Green

  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Abstract—We present two techniques for interactive graph layout manipulation which take inspiration from the fields of 3D modeling, mesh deformation, and static graph drawing. The first technique uses a multigrid method for modeling and animating large 3D meshes, the second employs ideas from a simpler mesh deformation scheme together with a basic graph searching algorithm and a user interface to control region of influence. We show,how,these techniques,along with a set of basic graph refinement,tools can be used interactively to produce informative visualizations based on graph connectivity alone, and then fine tune existing layouts to reveal insights into specific focus regions. We assume arbitrary, large, connected, undirected graphs, and draw the entire graph in 3D. Our techniques are designed to run at interactive rates on a standard desktop or laptop computer, even for graphs with hundreds of thousands,of nodes. We present timing results and images,of layouts generated,by our techniques. Index Terms—Graph Visualization, Multigrid, Interaction, User Interfaces
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: The essence and value of Linked Data lies in the ability of humans and machines to query, access and reason upon highly structured and formalised data. Ontology structures provide an unambiguous description of the structure and content of data. While a multitude of software applications and visualization systems have been developed over the past years for Linked Data, there is still a significant gap that exists between applications that consume Linked Data and interfaces that have been designed with significant focus on aesthetics. Though the importance of aesthetics in affecting the usability, effectiveness and acceptability of user interfaces have long been recognised, little or no explicit attention has been paid to the aesthetics of Linked Data applications. In this paper, we introduce a formalised approach to developing aesthetically pleasing semantic web interfaces by following aesthetic principles and guidelines identified from literature. We apply such principles to design and develop a generic approach of using visualizations to support exploration of Linked Data, in an interface that is pleasing to users. This provides users with means to browse ontology structures, enriched with statistics of the underlying data, facilitating exploratory activities and enabling visual query for highly precise information needs. We evaluated our approach in three ways: an initial objective evaluation comparing our approach with other well-known interfaces for the semantic web and two user evaluations with semantic web researchers.
    Semantic web : interoperability, usability, applicability. 08/2013;
  • [Show abstract] [Hide abstract]
    ABSTRACT: Graph analysis by data visualization involves achieving a series of topology-based tasks. When the graph data belongs to a data domain that contains multiple node and link types, as in the case of semantic graphs, topology-based tasks become more challenging. To reduce visual complexity in semantic graphs, we propose an approach which is based on applying relational operations such as selecting and joining nodes of different types. We use node aggregation to reflect the relational operations to the graph. We introduce glyphs for representing aggregated nodes. Using glyphs lets us encode connectivity information of multiple nodes with a single glyph. We also use visual parameters of the glyph to encode node attributes or type specific information. Rather than doing the operations in the data abstraction layer and presenting the user with the resulting visualization, we propose an interactive approach where the user can iteratively apply the relational operations directly on the visualization. We present the efficiency of our method by the results of a usability study that includes a case study on a subset of the International Movie Database. The results of the controlled experiment in our usability study indicate a statistically significant contribution in reducing the completion time of the evaluation tasks.
    Journal of Visual Languages & Computing 12/2013; · 0.56 Impact Factor

Full-text (2 Sources)

Available from
May 31, 2014