Finding low-entropy sets and trees from binary data

Reference:

Hannes Heikinheimo, Eino Hinkanen, Heikki Mannila, Taneli Mielikäinen, and Jouni K. Seppänen. Finding low-entropy sets and trees from binary data. In 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD), pages 350–359, 2007.

Suggested BibTeX entry:

@inproceedings{heikinheimo07b,
    author = {Hannes Heikinheimo and Eino Hinkanen and Heikki Mannila and Taneli Mielik\"{a}inen and Jouni K. Sepp\"{a}nen},
    booktitle = {13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD)},
    pages = {350--359},
    title = {Finding low-entropy sets and trees from binary data},
    year = {2007},
}

This work is not available online here.