Thanks to visit codestin.com
Credit goes to github.com

Skip to content

Commit 71b3f20

Browse files
author
Eric Naeseth
committed
So what's FP-growth, you ask?
1 parent 6b76162 commit 71b3f20

File tree

1 file changed

+4
-1
lines changed

1 file changed

+4
-1
lines changed

Readme.md

Lines changed: 4 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -2,7 +2,10 @@ Python FP-Growth
22
================
33

44
This module provides a pure Python implementation of the FP-growth algorithm for
5-
finding frequent itemsets.
5+
finding frequent itemsets. FP-growth exploits a (usually-valid) assumption that
6+
many transactions will have items in common to build a prefix tree. If the
7+
assumption holds true, this tree produces a compact representation of the actual
8+
transactions and is used to generate itemsets much faster than *Apriori* can.
69

710
Installation
811
------------

0 commit comments

Comments
 (0)