Home Articles List Article Information
JES. Journal of Engineering Sciences
Journal Archive
Volume Volume 53 (2025)
Volume Volume 52 (2024)
Volume Volume 51 (2023)
Volume Volume 50 (2022)
Volume Volume 49 (2021)
Volume Volume 48 (2020)
Volume Volume 47 (2019)
Volume Volume 46 (2018)
Volume Volume 45 (2017)
Volume Volume 44 (2016)
Volume Volume 43 (2015)
Volume Volume 42 (2014)
Volume Volume 41 (2013)
Volume Volume 40 (2012)
Volume Volume 39 (2011)
Volume Volume 38 (2010)
Volume Volume 37 (2009)
Volume Volume 36 (2008)
Volume Volume 35 (2007)
Volume Volume 34 (2006)
Margahny, M., Shakour, A. (2006). FAST ALGORITHM FOR MINING ASSOCIATION RULE. JES. Journal of Engineering Sciences, 34(No 1), 79-87. doi: 10.21608/jesaun.2006.110079
M. H. Margahny; A. Shakour. "FAST ALGORITHM FOR MINING ASSOCIATION RULE". JES. Journal of Engineering Sciences, 34, No 1, 2006, 79-87. doi: 10.21608/jesaun.2006.110079
Margahny, M., Shakour, A. (2006). 'FAST ALGORITHM FOR MINING ASSOCIATION RULE', JES. Journal of Engineering Sciences, 34(No 1), pp. 79-87. doi: 10.21608/jesaun.2006.110079
Margahny, M., Shakour, A. FAST ALGORITHM FOR MINING ASSOCIATION RULE. JES. Journal of Engineering Sciences, 2006; 34(No 1): 79-87. doi: 10.21608/jesaun.2006.110079

FAST ALGORITHM FOR MINING ASSOCIATION RULE

Article 5, Volume 34, No 1, January and February 2006, Page 79-87  XML PDF (185.77 K)
Document Type: Research Paper
DOI: 10.21608/jesaun.2006.110079
View on SCiNiTO View on SCiNiTO
Authors
M. H. Margahny email ; A. Shakour*
Faculty of Science, Computer Science Department, Assuit University, Assiut, Egypt
Abstract
One of the important problems in data mining is discovering association rules from databases of transactions where each transaction consists of a set of items. The most time consuming operation in this discovery process is the computation of the frequency of the occurrences of interesting subset of items (called candidates) in the database of transactions. Can one develop a method that may avoid or reduce candidate generation and test and utilize some novel data structures to reduce the cost in frequent pattern mining ? This is the motivation of my study. A fast algorithm has been proposed for solving this problem. Our algorithm use the "TreeMap" which is a structure in Java language. Also we present "Arraylist" technique that greatly reduces the need to traverse the database. Moreover we present experimental results which show our structure outperforms all existing available algorithms in all common data mining problems.
Keywords
data mining; association rules; TreeMap; ArrayList
Main Subjects
Electrical Engineering, Computer Engineering and Electrical power and machines engineering.
Statistics
Article View: 807
PDF Download: 628