2012 SamplingMinimalFrequentBooleanD

From GM-RKB
Jump to navigation Jump to search

Subject Headings:

Notes

Cited By

Quotes

Author Keywords

Abstract

We tackle the challenging problem of mining the simplest Boolean patterns from categorical datasets. Instead of complete enumeration, which is typically infeasible for this class of patterns, we develop effective sampling methods to extract a representative subset of the minimal Boolean patterns (in disjunctive normal form - DNF). We make both theoretical and practical contributions, which allow us to prune the search space based on provable properties. Our approach can provide a near-uniform sample of the minimal DNF patterns. We also show that the mined minimal DNF patterns are very effective when used as features for classification.

References

;

 AuthorvolumeDate ValuetitletypejournaltitleUrldoinoteyear
2012 SamplingMinimalFrequentBooleanDMohammed J. Zaki
Geng Li
Sampling Minimal Frequent Boolean (DNF) Patterns10.1145/2339530.23395472012