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.
Scaling FP-growth by Database Projection
- What about if FP-tree cannot fit in memory?
- DB projection
- First partition a database into a set of projected DBs
- Then construct and mine FP-tree for each projected DB
- Parallel projection vs. partition projection techniques
- Parallel projection
- Project the DB in parallel for each frequent item
- Parallel projection is space costly
- All the partitions can be processed in parallel
- Partition projection
- Partition the DB based on the ordered frequent items
- Passing the unprocessed parts to the subsequent partitions
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.