A frequent pattern mining algorithm based on FP-growth without generating tree
An interesting method to frequent pattern mining without generating candidate pattern is called frequent-pattern growth, or simply FP-growth, which adopts a divide-and-conquer strategy as follows.First, it compresses the database representing frequent items into a frequent-pattern tree, or FP-tree,...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Conference or Workshop Item |
| Language: | en |
| Published: |
2010
|
| Subjects: | |
| Online Access: | https://repo.uum.edu.my/id/eprint/11250/1/PG671_676.pdf https://repo.uum.edu.my/id/eprint/11250/ http://www.kmice.uum.edu.my |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|