2013 IEEE 13th International Conference on Data Mining Workshops (2012)
Brussels, Belgium Belgium
Dec. 10, 2012 to Dec. 10, 2012
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICDMW.2012.83
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.
Fault tolerance, Fault tolerant systems, Data mining, Programming, Noise, Bismuth, Encoding, biclustering, Staircase patterns, pattern sets, constraint programming, MDL
Thanh Le Van, Ana Carolina Fierroy, Tias Guns, Matthijs van Leeuwen, Siegfried Nijssen, Luc De Raedt, Kathleen Marchal, "Mining Local Staircase Patterns in Noisy Data", 2013 IEEE 13th International Conference on Data Mining Workshops, vol. 00, no. , pp. 139-146, 2012, doi:10.1109/ICDMW.2012.83