CoVennTree compares up to three rooted trees at the same time.
CoVennTree (Comparative weighted Venn Tree) is a software to analyze and compare up to three datasets. Unlike other methods, CoVennTree correlates data on the leaf level and transfers this information to the root node. CoVennTree works with numbers to compute weighted Venn diagrams for each node in the graph (rooted tree). Therefore any kind of input data can be processed as long as the data structure will be taken into account.
Input
Input example
dsv-format: The following table represents the graph.
| #Datasets | set1 | set2 | set3 |
|---|---|---|---|
| "root;" | 0 | 0 | 0 |
| "root;A;" | 10000 | 0 | 0 |
| "root;A;C;" | 600000 | 300000 | 500000 |
| "root;A;D;" | 0 | 100000 | 200000 |
| "root;A;E;" | 800000 | 0 | 100000 |
| "root;B;" | 10000 | 20000 | 50000 |
Results
A specific color is assigned to each dataset in five optional color schemes (see parameter "Select color mode for weighted Venn diagrams"). In this example set1 corresponds to color blue, set2 to red and set3 to yellow. In order to cover a wide numerical range a non linear transformation function is used.
Data format *.sif
[parent_node] [connected_with] [child_node]
Data format *.venn
[id] [google_url] [id_vds] [Venn_abs_values]
Output example "leaf information and not assigned information"
By selecting "leaf information + not assigned information" artificial nodes can be inserted. Artificial nodes will be inserted if inner nodes have values larger than zero.
Output example "only leaf information"
By selecting "only leaf information" only leaf nodes are considered for the computation of weighted Venn diagrams.
