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.
Constraint-Based Frequent Pattern Mining
- Pattern space pruning constraints
- Anti-monotonic: If constraint c is violated, its further mining can be terminated
- Monotonic: If c is satisfied, no need to check c again
- Succinct: c must be satisfied, so one can start with the data sets satisfying c
- Convertible: c is not monotonic nor anti-monotonic, but it can be converted into it if items in the transaction can be properly ordered
- Data space pruning constraint
- Data succinct: Data space can be pruned at the initial pattern mining process
- Data anti-monotonic: If a transaction t does not satisfy c, t can be pruned from its further mining
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.