@jaeschke

SD-Map - A Fast Algorithm for Exhaustive Subgroup Discovery.

, and . PKDD, volume 4213 of Lecture Notes in Computer Science, page 6-17. Springer, (2006)
DOI: 10.1007/11871637_6

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.

Description

dblp

Links and resources

Tags

community

  • @jaeschke
  • @bsc
  • @dblp
@jaeschke's tags highlighted