Fast and Memory-Efficient Discovery of the Top-K Relevant Subgroups in a Reduced Candidate Space

Grosskreutz and Paurat. "Fast and Memory-Efficient Discovery of the Top-K Relevant Subgroups in a Reduced Candidate Space." European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases, 2011. doi:10.1007/978-3-642-23780-5_44

[Grosskreutz and Paurat. "Fast and Memory-Efficient Discovery of the Top-K Relevant Subgroups in a Reduced Candidate Space." European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases, 2011.](https://mlanthology.org/ecmlpkdd/2011/grosskreutz2011ecmlpkdd-fast/) doi:10.1007/978-3-642-23780-5_44

@inproceedings{grosskreutz2011ecmlpkdd-fast,
  title     = {{Fast and Memory-Efficient Discovery of the Top-K Relevant Subgroups in a Reduced Candidate Space}},
  author    = {Grosskreutz, Henrik and Paurat, Daniel},
  booktitle = {European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases},
  year      = {2011},
  pages     = {533-548},
  doi       = {10.1007/978-3-642-23780-5_44},
  url       = {https://mlanthology.org/ecmlpkdd/2011/grosskreutz2011ecmlpkdd-fast/}
}