Evaluates the quality of the mapping given in mapON[].
The "mismapped edges", or "mismapped relations" measure is computed
for a permutation map[] as follows:
misRel(map) =
0.5 * sum_{i,j} Diff(Link(A,i,j), Link(B,map[i],map[j]) -
alpha/beta*(n-1)* ( sum_{q,x}ExSim[q][x] - sum_{i}ExSim[i][map[i]] ).
In the case of matching non-labeled, non-weighted graphs with no
extrenal similarity, misRel(map) is equal to the number of edges
that are present in one graph but absent in the other. When
external similarity is present, misRel also includes the numeber
of pairs (q,x) where external similarity is present, but q is
not matched to x, with the weight of (alpha/beta)*(n-1)*ExSim(q,x).
On the set of all permutation matrices, minimizing the misRel
functional is equivalent to maximizing the energy functionals,
because
Energy(map) = (alpha/(n-1))*(n/2) + alpha*sum_{q,x}ExSim[q][x] -
(beta/(n-1))*misRel(map).
The "mismapped concepts" measure measures the difference
between the only applies to mappings between a concept system
and its noisy copy, assuming that the noise is small enough so
that the mapping should be identity, i.e. map[Ci]=Ci'.
- Parameters:
absurdist - Is used to access the structures of the
concept systems, via Absurdist.calcLinkSym()mapON - The mapping whose quality is to be evaluatedcorrespond - Used to compute results.accuracy