If method="rowmax", then each class defining a row in the
contingency table is mapped to the column of the corresponding row
maximum. Hence, some columns may be mapped to more than one row
(while each row is mapped to a single column). If method="greedy" or method="exact", then the
contingency table must be a square matrix and a unique mapping is
computed. This corresponds to a permutation of columns and rows,
such that sum of the main diagonal, i.e., the trace of the matrix,
gets as large as possible. For both methods, first all pairs where
row and columns maxima correspond and are bigger than the sum of all
other elements in the corresponding columns and rows together are
located and fixed (this is a necessary condition for maximal trace).
If method="exact", then for the remaining rows and columns,
all possible permutations are computed and the optimum is
returned. This can get computationally infeasible very fast. If more
than maxexact rows and columns remain after applying the
necessary condition, then method is reset to "greedy". If
method="greedy", then a greedy heuristic is tried iter
times. Repeatedly a row is picked at random and matched to the free
column with the maximum value.
compareMatchedClasses() computes the contingency table for
each combination of columns from x and y and applies
matchClasses to that table. The columns of the table are
permuted accordingly and then the table is
passed to classAgreement. The resulting agreement
coefficients (diag, kappa, ...) are returned. The return value of
compareMatchedClasses() is a list containing a matrix for
each coefficient; with element (k,l) corresponding to the k-th
column of x and l-th column of y. If y is
missing, then the columns of x are compared with each other.