HiBi – The Algorithm of Biclustering the Discrete Data

摘要

The article presents the new algorithm for hierarchical biclustering: HiBi. It is dedicated to the analysis of the discrete data. The algorithm uses the set of exact biclusters as the input. In this approach results of exact biclustering algorithm eBi are used as the input. As a result of combining biclusters into the more general one, HiBi gives the set of inexact biclusters. The algorithm is hierarchical so the final result can be chosen after the algorithm performance. All experiments were performed on artificial datasets.