Thanks to visit codestin.com Credit goes to github.com
We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 6b76162 commit 71b3f20Copy full SHA for 71b3f20
Readme.md
@@ -2,7 +2,10 @@ Python FP-Growth
2
================
3
4
This module provides a pure Python implementation of the FP-growth algorithm for
5
-finding frequent itemsets.
+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.
9
10
Installation
11
------------
0 commit comments