Modifier and Type | Constant Field | Value |
---|---|---|
public static final java.lang.String |
GRAPH |
"Graph" |
public static final java.lang.String |
MATRIX |
"Matrix" |
Modifier and Type | Constant Field | Value |
---|---|---|
public static final java.lang.String |
GRAPH |
"Graph" |
public static final java.lang.String |
MATRIX |
"Matrix" |
Modifier and Type | Constant Field | Value |
---|---|---|
public static final java.lang.String |
NAME |
"Strongest Connected Values" |
Modifier and Type | Constant Field | Value |
---|---|---|
public static final java.lang.String |
NAME |
"Binary Split" |
Modifier and Type | Constant Field | Value |
---|---|---|
public static final java.lang.String |
NAME |
"Strongest I/O Values" |
Modifier and Type | Constant Field | Value |
---|---|---|
public static final java.lang.String |
NAME |
"Strongest Edges" |
Modifier and Type | Constant Field | Value |
---|---|---|
public static final java.lang.String |
NAME |
"Weight Probability" |
Modifier and Type | Constant Field | Value |
---|---|---|
public static final java.lang.String |
NAME |
"Values Exceeding Zero" |
Modifier and Type | Constant Field | Value |
---|---|---|
public static final java.lang.String |
TEXT |
"Creates a casual activity graph from a causal activity matrix, provided a zero value, a concurrency ratio, and an include threshold. First, a new causal activity matrix is created using these parameters. Second, the casual activity graph is created by selecting from that matrix all cells with positive values." |
Modifier and Type | Constant Field | Value |
---|---|---|
public static final java.lang.String |
TEXT |
"Discovers a casual activity graph from a log, provided a classiifer, a miner, a zero value, a concurrency ratio, and an include threshold. First, a matrix is decovered from the log using the parameters. Second, a casual activity graph is created by from that matrix using the parameters." |
Modifier and Type | Constant Field | Value |
---|---|---|
public static final java.lang.String |
TEXT |
"Creates a causal activity graph from a casual activity matrix given a conversion algorithm. Different conversion algorithms may result in different graphs. For example, the \"Values Exceeding Zero\" algorithm takes all cells that have a positive value, and creates an edge from every such cell." |