Please log in to take part in the discussion (add own reviews or comments).
Cite this publication
More citation styles
- please select -
%0 Conference Paper
%1 1281232
%A Heikinheimo, Hannes
%A Hinkkanen, Eino
%A Mannila, Heikki
%A Mielikäinen, Taneli
%A Seppänen, Jouni K.
%B KDD '07: Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining
%C New York, NY, USA
%D 2007
%I ACM
%K entropy frequent-patterns
%P 350--359
%R http://doi.acm.org/10.1145/1281192.1281232
%T Finding low-entropy sets and trees from binary data
%U http://portal.acm.org/citation.cfm?id=1281232
%@ 978-1-59593-609-7
@inproceedings{1281232,
added-at = {2009-04-24T10:49:44.000+0200},
address = {New York, NY, USA},
author = {Heikinheimo, Hannes and Hinkkanen, Eino and Mannila, Heikki and Mielik\"{a}inen, Taneli and Sepp\"{a}nen, Jouni K.},
biburl = {https://www.bibsonomy.org/bibtex/2f40e0110bae184a7fa8c3efc941df060/claudio.lucchese},
booktitle = {KDD '07: Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining},
description = {Finding low-entropy sets and trees from binary data},
doi = {http://doi.acm.org/10.1145/1281192.1281232},
interhash = {2f25ce3064d439b8f11ada20ae975ef6},
intrahash = {f40e0110bae184a7fa8c3efc941df060},
isbn = {978-1-59593-609-7},
keywords = {entropy frequent-patterns},
location = {San Jose, California, USA},
pages = {350--359},
publisher = {ACM},
timestamp = {2009-04-24T10:49:44.000+0200},
title = {Finding low-entropy sets and trees from binary data},
url = {http://portal.acm.org/citation.cfm?id=1281232},
year = 2007
}