HRoBi - The Algorithm for Hierarchical Rough Biclustering

摘要

The article presents the new algorithm of biclustering, based on the rough biclustering foundations. Each rough bicluster is considered as the ordered pair of its lower and upper approximation. Notions of lower and upper bicluster approximation are derived from the Pawlak rough sets theory. Every considered discrete value in the data can be covered with more than one rough bicluster. The presented algorithm is hierarchical, so the number of biclusters can be controlled by the user.