FP-Max is a variant of the [[FP-Growth]] algorithm, used as a basis for [[Association Rules|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.