Difference between revisions of "Data Visualization"

From dftwiki3
Jump to: navigation, search
(Graphite)
(Graphite)
Line 28: Line 28:
 
* movie:<br /><center><videoflash>nZYHazugVNA</videoflash><br /></center>
 
* movie:<br /><center><videoflash>nZYHazugVNA</videoflash><br /></center>
 
* pdf paper: http://www.cs.cmu.edu/~dchau/graphite/graphite.pdf
 
* pdf paper: http://www.cs.cmu.edu/~dchau/graphite/graphite.pdf
 +
<blockquote>
 +
We present Graphite, a system that allows the user to visually construct a query pattern, finds both its exact and approximate matching subgraphs in large attributed graphs, and visualizes the matches. For ex- ample, in a social network where a person’s occupa- tion is an attribute, the user can draw a ‘star’ query for “finding a CEO who has interacted with a Secre- tary, a Manager, and an Accountant, or a structure very similar to this”. Graphite uses the G-Ray al- gorithm to run the query against a user-chosen data graph, gaining all of its benefits, namely its high speed, scalability, and its ability to find both exact and near matches. Therefore, for the example above, Graphite tolerates indirect paths between, say, the CEO and the Accountant, when no direct path exists. Graphite uses fast algorithms to estimate node proximities when finding matches, enabling it to scale well with the graph database size.
 +
</blockquote>
  
 
==Viz4All ==
 
==Viz4All ==

Revision as of 17:35, 14 October 2009

Introduction

This page is an ad-hoc collection of interesting (for me) examples of visualization of data. They are taken from the Web, from the scientific literature, and from newspapers (The New York Times in particular).

The collection of posts is organized from the most recent (at the top) to the oldest (at the bottom).
Additions are continuously made, documenting interesting discoveries regarding visual displays of information.
While this page is not available for anonymous edits, feel free to send comments, suggestions and/or discoveries to thiebaut@cs.smith.edu.



Contents