%0 Conference Paper
%1 atzmueller2006sdmap
%A Atzmüller, Martin
%A Puppe, Frank
%B PKDD
%D 2006
%E Fürnkranz, Johannes
%E Scheffer, Tobias
%E Spiliopoulou, Myra
%I Springer
%K classification discovery sd-map subgroup
%P 6-17
%T SD-Map - A Fast Algorithm for Exhaustive Subgroup Discovery.
%U http://dblp.uni-trier.de/db/conf/pkdd/pkdd2006.html#AtzmullerP06
%V 4213
%X 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.