| Document Date: 2013-04-02 16:26:20
Open Document File Size: 370,37 KBShare Result on Facebook
City Apriori / / Company Introduction Subgroup / Exhaustive Subgroup / / / Facility Frank Puppe University of W¨urzburg / / / IndustryTerm prior-sample algorithm / larger search spaces / by-product / search method / artificial vehicle insurance domain / restricted search space / post-processing step / unpruned search space / association rule mining / beam search method / high insurance rates / exponential search space / search method scale / subgroup search strategy / search strategy / association rule mining methods / data mining / post-processing / potential redundancy management / beam search / search space / subgroup discovery algorithms / subgroup mining / beam search approach / beam search algorithm / search methods / / OperatingSystem Windows XP / / Organization Frank Puppe University of W¨urzburg / Germany Department of Computer Science Phone / German Research Council / Discussion Using association / / / Position rule head / / Product FP / / ProgrammingLanguage FP / / Technology Apriori-SD algorithms / prior-sample algorithm / three subgroup discovery algorithms / FP-growth algorithm / existing algorithms / data mining / SD-Map algorithm / dom / mentioned algorithms / Apriori algorithm / beam search algorithm / 1 SD-Map algorithm / /
SocialTag |
SD-Map – A Fast Algorithm for Exhaustive Subgroup Discovery Martin Atzmueller and Frank Puppe University of W¨urzburg, 97074 W¨urzburg, Germany Department of Computer Science Phone: +[removed], Fax: +[removed]