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)

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.

URL

http://dblp.uni-trier.de/db/conf/pkdd/pkdd2006.html#AtzmullerP06

Suchen auf

Diese Publikation wurde noch nicht bewertet.

Bewertungsverteilung

Durchschnittliche Benutzerbewertung0,0 von 5.0 auf Grundlage von 0 Rezensionen

Bitte melden Sie sich an um selbst Rezensionen oder Kommentare zu erstellen.

@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.},
  added-at = {2009-04-14T17:29:06.000+0200},
  author = {Atzmüller, Martin and Puppe, Frank},
  biburl = {https://puma.uni-kassel.de/bibtex/23edb41b31504187c963dd0383ee379e6/jaeschke},
  booktitle = {PKDD},
  crossref = {conf/pkdd/2006},
  date = {2006-10-23},
  description = {dblp},
  doi = {10.1007/11871637_6},
  editor = {Fürnkranz, Johannes and Scheffer, Tobias and Spiliopoulou, Myra},
  interhash = {f856c6b72f915861203f4ab460dc247d},
  intrahash = {3edb41b31504187c963dd0383ee379e6},
  isbn = {3-540-45374-1},
  keywords = {classification discovery sd-map subgroup},
  pages = {6-17},
  publisher = {Springer},
  series = {Lecture Notes in Computer Science},
  timestamp = {2009-04-14T17:29:21.000+0200},
  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
}

%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
%R 10.1007/11871637_6
%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.
%@ 3-540-45374-1

PUMA

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)

Tags

Nutzer

Kommentare und Rezensionen

Zitieren Sie diese Publikation

PUMA

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)

Tags

Nutzer

Kommentare und Rezensionen

Zitieren Sie diese Publikation

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)