CFP last date
15 October 2024
Call for Paper
November Edition
IJAIS solicits high quality original research papers for the upcoming November edition of the journal. The last date of research paper submission is 15 October 2024

Submit your paper
Know more
Reseach Article

Ordered Frequent Itemsets Matrix based on FP-Tree Structure and Apriori Algorithm

by Abdulkader M. Al-Badani, Abdualmajed A. Al-Khulaidi
International Journal of Applied Information Systems
Foundation of Computer Science (FCS), NY, USA
Volume 12 - Number 45
Year of Publication: 2024
Authors: Abdulkader M. Al-Badani, Abdualmajed A. Al-Khulaidi
10.5120/ijais2024451979

Abdulkader M. Al-Badani, Abdualmajed A. Al-Khulaidi . Ordered Frequent Itemsets Matrix based on FP-Tree Structure and Apriori Algorithm. International Journal of Applied Information Systems. 12, 45 ( Jul 2024), 7-15. DOI=10.5120/ijais2024451979

@article{ 10.5120/ijais2024451979,
author = { Abdulkader M. Al-Badani, Abdualmajed A. Al-Khulaidi },
title = { Ordered Frequent Itemsets Matrix based on FP-Tree Structure and Apriori Algorithm },
journal = { International Journal of Applied Information Systems },
issue_date = { Jul 2024 },
volume = { 12 },
number = { 45 },
month = { Jul },
year = { 2024 },
issn = { 2249-0868 },
pages = { 7-15 },
numpages = {9},
url = { https://www.ijais.org/archives/volume12/number45/ordered-frequent-itemsets-matrix-based-on-fp-tree-structure-and-apriori-algorithm/ },
doi = { 10.5120/ijais2024451979 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-07-18T00:40:46+05:30
%A Abdulkader M. Al-Badani
%A Abdualmajed A. Al-Khulaidi
%T Ordered Frequent Itemsets Matrix based on FP-Tree Structure and Apriori Algorithm
%J International Journal of Applied Information Systems
%@ 2249-0868
%V 12
%N 45
%P 7-15
%D 2024
%I Foundation of Computer Science (FCS), NY, USA
Abstract

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.

References
Index Terms

Computer Science
Information Sciences
Data Mining
Association Rule
Frequent Itemsets Mining

Keywords

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