Simple Modification for an Apriori Algorithm With Combination Reduction and Iteration Limitation Technique

• Published in: Knowledge engineering and data science (Online) Vol. 3; no. 2; pp. 89 - 98
• Main Authors: Gama, Adie Wahyudi Oktavia, Widnyani, Ni Made
• Format: Journal Article
• Language: English
• Published: Universitas Negeri Malang 31.12.2020
• ISSN: 2597-4602; 2597-4637
• DOI: 10.17977/um018v3i22020p89-98

Apriori algorithm is one of the methods with regard to association rules in data mining. This algorithm uses knowledge from an itemset previously formed with frequent occurrence frequencies to form the next itemset. An a priori algorithm generates a combination by iteration methods that are using repeated database scanning process, pairing one product with another product and then recording the number of occurrences of the combination with the minimum limit of support and confidence values. The a priori algorithm will slow down to an expanding database in the process of finding frequent itemset to form association rules. Modification techniques are needed to optimize the performance of a priori algorithms so as to get frequent itemset and to form association rules in a short time. Modifications in this study are obtained by using techniques combination reduction and iteration limitation. Testing is done by comparing the time and quality of the rules formed from the database scanning using a priori algorithms with and without modification. The results of the test show that the modified a priori algorithm tested with data samples of up to 500 transactions is proven to form rules faster with quality rules that are maintained.Keywords: Data Mining; Association Rules; Apriori Algorithms; Frequent Itemset; Apriori Modified;