sklearn.metrics.consensus_score(a, b, similarity=’jaccard’)
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.
Read more in the User Guide.
© 2007–2018 The scikit-learn developers
Licensed under the 3-clause BSD License.