Finding low-entropy sets and trees from binary data - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

Hannes Heikinheimo, Jouni K. Seppänen, Eino Hinkkanen, Heikki Mannila, Taneli Mielikäinen. Finding low-entropy sets and trees from binary data. In Pavel Berkhin, Rich Caruana, Xindong Wu, editors, Proceedings of the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, San Jose, California, USA, August 12-15, 2007. pages 350-359, ACM, 2007. [doi]

This author has not been identified. Look up 'Hannes Heikinheimo' in GoogleThis author has not been identified. Look up 'Jouni K. Seppänen' in GoogleThis author has not been identified. Look up 'Eino Hinkkanen' in GoogleThis author has not been identified. Look up 'Heikki Mannila' in GoogleThis author has not been identified. Look up 'Taneli Mielikäinen' in Google

runs on WebDSL