@inproceedings{atzmueller2006sdmap,
  abstract = {In this paper we present the novel SD-Map algorithm for exhaustive but efficient subgroup discovery. SD-Map guarantees to identify all interesting subgroup patterns contained in a data set, in contrast to heuristic or samplingbased methods. The SD-Map algorithm utilizes the well-known FP-growth method for mining association rules with adaptations for the subgroup discovery task.We show how SD-Map can handle missing values, and provide an experimental evaluation of the performance of the algorithm using synthetic data.},
  author = {Atzmüller, Martin and Puppe, Frank},
  booktitle = {PKDD},
  crossref = {conf/pkdd/2006},
  date = {2006-10-23},
  doi = {10.1007/11871637_6},
  editor = {Fürnkranz, Johannes and Scheffer, Tobias and Spiliopoulou, Myra},
  interhash = {f856c6b72f915861203f4ab460dc247d},
  intrahash = {3edb41b31504187c963dd0383ee379e6},
  isbn = {3-540-45374-1},
  pages = {6-17},
  publisher = {Springer},
  series = {Lecture Notes in Computer Science},
  title = {SD-Map - A Fast Algorithm for Exhaustive Subgroup Discovery.},
  url = {http://dblp.uni-trier.de/db/conf/pkdd/pkdd2006.html#AtzmullerP06},
  volume = 4213,
  year = 2006
}