Finding low-entropy sets and trees from binary data

Reference:

Hannes Heikinheimo, Eino Hinkkanen, Heikki Mannila, Taneli Mielikainen, and Jouni Seppanen. Finding low-entropy sets and trees from binary data. In Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining (KDD 2007), pages 350–359, 2007.

Suggested BibTeX entry:

@inproceedings{heikinheimoetal07,
    author = {Hannes Heikinheimo and Eino Hinkkanen and Heikki Mannila and Taneli Mielikainen and Jouni Seppanen},
    booktitle = {Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining (KDD 2007)},
    pages = {350-359},
    title = {Finding low-entropy sets and trees from binary data},
    year = {2007},
}

This work is not available online here.