Current Slide
Small screen detected. You are viewing the mobile version of SlideWiki. If you wish to edit slides you will need to use a larger device.
Closed Patterns and Max-Patterns
-
A long pattern contains a combinatorial number of sub-patterns, e.g.,
\[ {a_{1}, …, a_{100}} \]
contains
\[ (100^1)+(100^2)+...+(1^{1}0^{0}0^{0}) = 2^{100}-1 = 1.27 * 10^{30}\]
sub-patterns! - Solution: Mine closed patterns and max-patterns instead
- An itemset X is closed if X is frequent and there exists no super-pattern Y כ X, with the same support as X (proposed by Pasquier, et al. @ ICDT’99)
- An itemset X is a max-pattern if X is frequent and there exists no frequent super-pattern Y כ X (proposed by Bayardo @ SIGMOD’98)
- Closed pattern is a lossless compression of freq. patterns
- Reducing the # of patterns and rules
Speaker notes:
Content Tools
Tools
Sources (0)
Tags (0)
Comments (0)
History
Usage
Questions (0)
Playlists (0)
Quality
Sources
There are currently no sources for this slide.