Expand description
algorithm
is the core module of FP-Growth algorithm.
It implements the algorithm based on the internal data structs crate::tree::Node<T>
and crate::tree::Tree<T>
.
Structsยง
- FPGrowth
FPGrowth<T>
represents an algorithm instance, it should include thetransactions
input and minimum support value as the initial config. Once it is created, you could runFPGrowth::find_frequent_patterns()
to start the frequent pattern mining.- FPResult