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 FPtree,...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Conference or Workshop Item |
| Language: | English |
| Published: |
Universiti Utara Malaysia
2010
|
| Online Access: | http://psasir.upm.edu.my/id/eprint/59759/1/PG671_676.pdf http://psasir.upm.edu.my/id/eprint/59759/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|