Hierarchical visualization for chance discovery

  • Authors:
  • Brett Bojduj;Clark S. Turner

  • Affiliations:
  • Department of Computer Science, California Polytechnic State University, San Luis Obispo, CA;Department of Computer Science, California Polytechnic State University, San Luis Obispo, CA

  • Venue:
  • IEA/AIE'07 Proceedings of the 20th international conference on Industrial, engineering, and other applications of applied intelligent systems
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

Chance discovery has achieved much success in discovering events that, though rare, are important to human decision making. Since humans are able to efficiently interact with graphical representations of data, it is useful to use visualizations for chance discovery. KeyGraph enables efficient visualization of data for chance discovery, but does not have provisions for adding domain-specific constraints. This contribution extends the concepts of KeyGraph to a visualization method based on the target sociogram. As the target sociogram is hierarchical in nature, it allows hierarchical constraints to be embedded in visualizations for chance discovery. The details of the hierarchical visualization method are presented and a class of problems is defined for its use. An example from software requirements engineering illustrates the efficacy of our approach.