When reconstructing an optimal solution interpreting P (i.e. the optimal context-label assignments to the nodes of P), the skipped node is assigned the same label as the one chosen for the source node of the skip edge (for example, in Figure 3C, node v is green even though it does not have a green label in its column).
Rewarding appropriate label assignments.
Penalizing inappropriate label assignments.
● Random (uniform) label assignments have an ARI score close to 0.0, thanks to the 'corrected-for-chance' adjustment made in order to reduce the effect of random labellings.
As evaluation measures we report in Table 1 the results obtained using a set of measures that indicate the agreement of two independent label assignments strategies on the same dataset [33].
The midpoint of the means of the two classes is used to update r, as provided in step 9 of Procedure 2. The update terminates when label assignments no longer change.
Penalizing inappropriate label assignments Scenario 3: If W ij <r i (i.e., SPNs n i and n j belong to different classes) but the label l under investigation is the same as f j (i.e., l=f j ), then s l,f j )=−1 will be used in Eq. (6).
Rewarding appropriate label assignments Scenario 1: If W ij <r i (i.e., SPNs n i and n j belong to different classes) and the label l under investigation is different from f j (i.e., l≠f j ), then s l,f j )=+1 will be used in Eq. (6).
Instead, Zhang et al. proposed an algorithm similar to conjugate descent to solve this problem [22], alternating between (a) training the linear separator given current label assignments and (b) updating the label assignment based on the linear separator.
SMDA generates all possible combinations of label assignments to those neighboring pools and reactions.
