2012 SamplingMinimalFrequentBooleanD
Jump to navigation
Jump to search
- (Li & Zaki, 2012) ⇒ Geng Li, and Mohammed J. Zaki. (2012). “Sampling Minimal Frequent Boolean (DNF) Patterns.” In: Proceedings of the 18th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD-2012). ISBN:978-1-4503-1462-6 doi:10.1145/2339530.2339547
Subject Headings:
Notes
Cited By
- http://scholar.google.com/scholar?q=%222012%22+Sampling+Minimal+Frequent+Boolean+%28DNF%29+Patterns
- http://dl.acm.org/citation.cfm?id=2339530.2339547&preflayout=flat#citedby
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
;
Author | volume | Date Value | title | type | journal | titleUrl | doi | note | year | |
---|---|---|---|---|---|---|---|---|---|---|
2012 SamplingMinimalFrequentBooleanD | Mohammed J. Zaki Geng Li | Sampling Minimal Frequent Boolean (DNF) Patterns | 10.1145/2339530.2339547 | 2012 |