Tasks Taxonomy for Graphs
buy diazepam order tramadol cheap wellbutrin jazz ringtones cheap rivotril free mtv ringtones cheap lipitor cheap celexa cheap ativan free nokia ringtones order norco free motorola ringtones but ultram ultram online norco online free mono ringtones celexa online didrex online free online pharmacy propecia online phentermine online viagra online cheap vicodin but sildenafil cheap lisinopril free sharp ringtones levitra online funny ringtones hydrocodone valium online cool ringtones cheap clonazepam cyclobenzaprine online free verizon ringtones hgh online cheap ambien free sony ringtones cialis online free cingular ringtones cialis online cheap prozac free qwest ringtones didrex online free punk ringtones jazz ringtones free ringtones ultracet order flexeril free nokia ringtones cheap ativan cheap viagra midi ringtones free sony ericsson ringtones real ringtones adipex online free funny ringtones free punk ringtones tenuate online online meridia kyocera ringtones sprint ringtones meridia tenuate online cheap clomid cheap ambien free sonyericsson ringtones cheap clomid free music ringtones free ericsson ringtones cheap levitra free wwe ringtones free kyocera ringtones cheap nexium free mp3 ringtones cheap hgh cheap xanax free sagem ringtones cheap xenical alprazolam music ringtones buy zanaflex verizon ringtones free nextel ringtones tracfone ringtones buy diethylpropion albuterol online tramadol online samsung ringtones mp3 ringtones free wwe ringtones cheap soma sharp ringtones cheap lisinopril paxil online free motorola ringtones samsung ringtones vigrx online cheap sildenafil paxil online zanaflex online rivotril online cheap diethylpropion free sprint ringtones free polyphonic ringtones free sagem ringtones cheap nexium free cingular ringtones cheap cyclobenzaprine cheap pharmacy online free alltel ringtones free sonyericsson ringtones sony ericsson ringtones cheap diazepam vicodin buy lipitor vigrx online free mtv ringtones cheap soma buy lorazepam real ringtones zyban online albuterol online free ericsson ringtones cheap lorazepam but zoloft but adipex wellbutrin online alltel ringtones cool ringtones free nextel ringtones zoloft online clonazepam online cheap valium fioricet online free midi ringtones xanax online free polyphonic ringtones buy hoodia lortab cheap alprazolam hydrocodone online cheap lortab ultracet online free free ringtones free mono ringtones cheap carisoprodol free sony ringtones cheap ortho tracfone ringtones cheap phentermine ortho online cheap xenical order prozac carisoprodol online propecia online but flexeril free qwest ringtones fioricet online hoodia online zyban online == Low-Level Tasks ==
From [Amar et al. 2005] and [Lee et al 2006].
- General Tasks
|Retrieve Value||Given a set of cases, find attributes of those cases.|
|Filter||Given some conditions on attributes values, find data cases satisfying those conditions.|
|Compute Derived Value||Given a set of data cases, compute an aggregate numeric representation of those data cases.(e.g. average, median, and count)|
|Find Extremum||Find data cases possessing an extreme value of an attribute over its range within the data set.|
|Sort||Given a set of data cases, rank them according to some ordinal metric.
Determine Range Given a set of data cases and an attribute of interest, find the span of values within the set.
|Characterize Distribution||Given a set of data cases and a quantitative attribute of interest, characterize the distribution of that attribute’s values over the set.|
|Find Anomalies||Identify any anomalies within a given set of data cases with respect to a given relationship or expectation, e.g. statistical outliers.|
|Cluster||Given a set of data cases, find clusters of similar attribute values.|
|Correlate||Given a set of data cases and two attributes, determine useful relationships between the values of those attributes.|
|Scan||Quickly review a set of items.|
|Set Operation||Given multiple sets of items, perform set operations on them. For example, find the intersection of the set of nodes.|
- Graph Specific Tasks
|Find Adjacent Nodes||Given a node, find its adjacent nodes.|
Graph Task Taxonomy
Examples are illustrated using 4 types of graphs:
- (FOAF): friend-of-a-friend
- (FW): food web
- (GO): gene ontology
- (ARM): airport routing map
|Adjacency (direct connection)||
|Accessibility (direct or indirect connection)||
|On the Nodes||
|On the Links||
This is a compound exploratory task to get estimated values quickly. For example, we might ask users to estimate the size of the social network. Note that sometimes it is more important to be able to estimate the answer than to get an accurate one. Some of the topology tasks can be done easily using an overview of the graph as well. For example, using particular layout algorithms, it is easy to see whether or not there are clusters and connected components. Other algorithms help to find shortest paths between nodes. Overview also helps to find patterns.
- estimate size of the network
- estimate the number of connected components
- is the network clustered?
- can you identify different patterns of connection?
- (FOAF) has the network a small-world structure?
High-Level tasks which are not a combination of lower level tasks.
- When we compare two or more food webs, we can ask the following questions: What do they have in common? What are the differences among those food webs? Is there any missing or conflicting information?
- Due to errors in the data, several nodes may represent the same entity. For example, the co-authorship graphs often have duplicate author nodes. One important task is to identify whether two or more nodes represent the same person.
- How has the graph changed over time?
There seems to be a set of tasks in the world that match very few of these, but show up often. I welcome others' ideas of how to categorize them:
"what is the general structure of this graph?" http://www.networkweaving.com/blog/2006/09/nola-networks.html
"what is the distribution of vertex degree in this graph?" (That is, "how are well-linked nodes different from under-linked nodes?") http://research.microsoft.com/research/pubs/view.aspx?type=Publication