12th IEEE International Conference on Data Mining Workshops pages:139-146
International workshop on Co-Clustering and Applications (CoClus'12) in conjunction with IEEE ICDM 2012 edition:1 location:Brussels date:10 December 2012
Most traditional biclustering algorithms identify biclusters with no or little overlap. In this paper, we introduce the problem of identifying staircases of biclusters. Such staircases may be indicative for causal relationships between columns and can not easily be identified by existing biclustering algorithms. Our formalization relies on a scoring function based on the
Minimum Description Length principle. Furthermore, we propose a first algorithm for identifying staircase biclusters, based on a combination of local search and constraint programming. Experiments show that the approach is promising.