FP-Max

Properties2

Type	Concept
Note created	Feb 17, 2025

FP-Max is a variant of the FP-Growth algorithm, used as a basis for association rule learning, that focuses on obtaining maximal item sets: an item set $X$ is said to be maximal if $X$ is frequent and there is no frequent super-pattern containing $X$. In other words, $X$ cannot be a sub-pattern of a larger frequent pattern to be understood as maximal.