# FP-MatthewCan

(Difference between revisions)
 Revision as of 06:28, 15 March 2011 (view source) (Created page with "==Proposal== ===Group Members=== *Matt Can ===Description=== In computer science, we often visualize relationships and structured objects with graphs. When we want to analyze sev...")← Older edit Revision as of 09:33, 15 March 2011 (view source)Newer edit → Line 3: Line 3: *Matt Can *Matt Can ===Description=== ===Description=== - In computer science, we often visualize relationships and structured objects with graphs. When we want to analyze several structures for their similarities and differences, we can reduce this to graph comparison. The goal of this project is to develop novel visualization techniques and accompanying algorithms to facilitate graph comparison. + In computer science, we often visualize relationships and structured objects with graphs. When we want to analyze several structures for their similarities and differences, we can reduce this to the problem of graph comparison. The goal of this project is to develop novel visualization techniques and accompanying algorithms to facilitate graph comparison. - Give examples + To help motivate this problem, here are some examples of the kinds of objects we would like to compare: + *'''Social Networks''' - We take the social networks of two individuals (at some fixed depth) and want to know which groups of friends they share. Naturally, we encode these as graphs, which we want to compare. + *'''Recipes''' - There exist many recipes for chocolate chip cookies, and we want to know how these compare. One approach is to encode the recipes as graphs, where nodes represent ingredients and actions, and edges represent ingredient flows. This creates DAGs from the recipes, and now we want to compare them. This example generalizes from recipes to anything that can be represented by a process diagram. + *'''Parse Trees''' - We want to visualize how syntactically similar two sentences are, so we compare their parse trees. Give some related work. Give some related work. Evaluate against existing methods Evaluate against existing methods

## Proposal

• Matt Can

### Description

In computer science, we often visualize relationships and structured objects with graphs. When we want to analyze several structures for their similarities and differences, we can reduce this to the problem of graph comparison. The goal of this project is to develop novel visualization techniques and accompanying algorithms to facilitate graph comparison.

To help motivate this problem, here are some examples of the kinds of objects we would like to compare:

• Social Networks - We take the social networks of two individuals (at some fixed depth) and want to know which groups of friends they share. Naturally, we encode these as graphs, which we want to compare.
• Recipes - There exist many recipes for chocolate chip cookies, and we want to know how these compare. One approach is to encode the recipes as graphs, where nodes represent ingredients and actions, and edges represent ingredient flows. This creates DAGs from the recipes, and now we want to compare them. This example generalizes from recipes to anything that can be represented by a process diagram.
• Parse Trees - We want to visualize how syntactically similar two sentences are, so we compare their parse trees.

Give some related work.

Evaluate against existing methods