Apriori and fp-growth are two well-known association rule algorithms that are well-known to data mining researchers. Nevertheless, the association rule algorithm has certain drawbacks, such as the need for large memory, lengthy dataset scans to determine the frequency of the item set, and occasionally less-than-ideal rules. To examine the rule outcomes of the three algorithms, the authors of this research compared the fp-growth, Apriori, and OFIM algorithms.In this paper, the suggest alterations to the FP-Growth algorithm's operation. By using the proposed matrix OFIM instead of the tree employed in those methods, the recommended algorithm would lower the number of often formed items and the amount of time spent mining, resulting in a considerable reduction in the amount of decision-making in large datasets. In comparison to the conventional tree-based technique, the matrix OFIM enables effective storing and retrieval of frequently occurring itemsets, leading to quicker calculation and result extraction. Furthermore, our technique significantly improves its speed in handling large datasets by limiting the amount of items that are produced often, thereby optimizing memory use.

FP-Growth Algorithm Aprioiri Algorithm FP-tree Support Count OFIM