SD-Map -- A Fast Algorithm for Exhaustive Subgroup Discovery
M. Atzmueller, and F. Puppe.
Proc. 10th European Conference on Principles and Practice of Knowledge Discovery in Databases (PKDD 2006), 4213, page 6-17. (2006)

search on

This publication has not been reviewed yet.

rating distribution

average user rating0.0 out of 5.0 based on 0 reviews

Please log in to take part in the discussion (add own reviews or comments).

%0 Conference Paper
%1 AP:06a
%A Atzmueller, Martin
%A Puppe, Frank
%B Proc. 10th European Conference on Principles and Practice of Knowledge Discovery in Databases (PKDD 2006)
%D 2006
%K imported myown
%N 4213
%P 6-17
%T SD-Map -- A Fast Algorithm for Exhaustive Subgroup Discovery

PUMA

SD-Map -- A Fast Algorithm for Exhaustive Subgroup Discovery
M. Atzmueller, and F. Puppe.
Proc. 10th European Conference on Principles and Practice of Knowledge Discovery in Databases (PKDD 2006), 4213, page 6-17. (2006)

Tags

Users

Comments and Reviews

Cite this publication

PUMA

SD-Map -- A Fast Algorithm for Exhaustive Subgroup DiscoveryM. Atzmueller, and F. Puppe. Proc. 10th European Conference on Principles and Practice of Knowledge Discovery in Databases (PKDD 2006), 4213, page 6-17. (2006)

Tags

Users

Comments and Reviews

Cite this publication

SD-Map -- A Fast Algorithm for Exhaustive Subgroup Discovery
M. Atzmueller, and F. Puppe.
Proc. 10th European Conference on Principles and Practice of Knowledge Discovery in Databases (PKDD 2006), 4213, page 6-17. (2006)