Frequent Pattern Growth (FP-Growth) algorithm
GPTKB entity
Statements (26)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
data mining algorithm
frequent itemset mining algorithm |
| gptkbp:advantage |
efficient for large datasets
avoids candidate generation |
| gptkbp:citation |
Han, J., Pei, J., & Yin, Y. (2000). Mining frequent patterns without candidate generation. SIGMOD Record, 29(2), 1-12.
|
| gptkbp:complexity |
linear with respect to number of transactions
|
| gptkbp:developedBy |
gptkb:Jiawei_Han
|
| https://www.w3.org/2000/01/rdf-schema#label |
Frequent Pattern Growth (FP-Growth) algorithm
|
| gptkbp:implementedIn |
gptkb:Java
gptkb:Python gptkb:Weka R MLlib (Apache Spark) |
| gptkbp:input |
transaction database
|
| gptkbp:introducedIn |
2000
|
| gptkbp:limitation |
FP-tree may not fit in memory
not efficient for very long patterns |
| gptkbp:output |
frequent itemsets
|
| gptkbp:publishedIn |
gptkb:SIGMOD_2000
|
| gptkbp:relatedTo |
gptkb:Apriori_algorithm
|
| gptkbp:step |
construct FP-tree
mine FP-tree recursively |
| gptkbp:usedFor |
association rule mining
market basket analysis |
| gptkbp:bfsParent |
gptkb:Mining_Association_Rules_between_Sets_of_Items_in_Large_Databases
|
| gptkbp:bfsLayer |
8
|