For two different partitioning function computes confusion matrix.
Let P and P' be two different partitioning of the same data. Partitionings are represent as two
clust1, clust2. Both vectors should have the same length.
Confusion matrix measures the size of intersection between clusters comming from P and P'
according to equation:
M[i,j] = | intersection of P(i) and P'(j) |
|P(i)||- cluster which belongs to partitioning P,|
|P'(j)||- cluster which belongs to partitioning P',|
||A|||- cardinality of set A.|
cls.set.section returns a n x m integer
where n = |P| and m = |P'| defined above.
Result used in
1 2 3 4 5 6