t
ij
|
r
ij
| Category |
---|
0 | 0 | TN |
0 | 1 | FP |
1 | 0 | FN |
1 | 1 | TP |
- This table shows how an edge is classified according to the values in the true matrix (t
ij
) and in the adjacency matrix (a
ij
). An entry that is equal to zero means that the edge from node X
i
to node X
j
is absent, conversely, an entry that is equal to one means that the edge is present