Fork me on GitHub


sklearn.metrics.consensus_score(a, b, similarity='jaccard')[source]

The similarity of two sets of biclusters.

Similarity between individual biclusters is computed. Then the best matching between sets is found using the Hungarian algorithm. The final score is the sum of similarities divided by the size of the larger set.


a : (rows, columns)

Tuple of row and column indicators for a set of biclusters.

b : (rows, columns)

Another set of biclusters like a.

similarity : string or function, optional, default: “jaccard”

May be the string “jaccard” to use the Jaccard coefficient, or any function that takes four arguments, each of which is a 1d indicator vector: (a_rows, a_columns, b_rows, b_columns).