Henrik Grosskreutz, Daniel Paurat. Fast and Memory-Efficient Discovery of the Top-k Relevant Subgroups in a Reduced Candidate Space. In Dimitrios Gunopulos, Thomas Hofmann, Donato Malerba, Michalis Vazirgiannis, editors, Machine Learning and Knowledge Discovery in Databases - European Conference, ECML PKDD 2011, Athens, Greece, September 5-9, 2011. Proceedings, Part I. Volume 6911 of Lecture Notes in Computer Science, pages 533-548, Springer, 2011. [doi]
@inproceedings{GrosskreutzP11,
title = {Fast and Memory-Efficient Discovery of the Top-k Relevant Subgroups in a Reduced Candidate Space},
author = {Henrik Grosskreutz and Daniel Paurat},
year = {2011},
doi = {10.1007/978-3-642-23780-5_44},
url = {http://dx.doi.org/10.1007/978-3-642-23780-5_44},
tags = {discovery},
researchr = {https://researchr.org/publication/GrosskreutzP11},
cites = {0},
citedby = {0},
pages = {533-548},
booktitle = {Machine Learning and Knowledge Discovery in Databases - European Conference, ECML PKDD 2011, Athens, Greece, September 5-9, 2011. Proceedings, Part I},
editor = {Dimitrios Gunopulos and Thomas Hofmann and Donato Malerba and Michalis Vazirgiannis},
volume = {6911},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-642-23779-9},
}