Research Article
Customer Relationship Management Based on SPRINT Classification Algorithm under Data Mining Technology
Algorithm 3
Generation of frequent sets.
| Input: | | FPtree built above, a minimum support alpha | | Output: Frequency set | | Procedure FP-growth (FPtree, alpha) | | {if FPtree has only one path P | | then | | { | | The frequency set produced by the combination of nodes β in P β∪α | | Specify the frequency set support as the minimum support of the node in β. | | } | | The else | | {for FPTree header table each entry c is processed from back to front | | {generate a frequency set β = C ∪α | | The support of the frequency set is that of entry C | | The conditional pattern library and conditional tree FPTree2 of β were established | | If FPTree2 is not empty | | Then FP-growth FPTree2, beta, | | } | | } |
|