SD-Map - A Fast Algorithm for Exhaustive Subgroup Discovery.
M. Atzmüller, und F. Puppe. PKDD, Volume 4213 von Lecture Notes in Computer Science, Seite 6-17. Springer, (2006)
Zusammenfassung
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.
