DMCA
Fast Algorithm for Mining Association Rules
| Citations: | 15 - 1 self |
BibTeX
@MISC{Margahny_fastalgorithm,
author = {M. H. Margahny and A. A. Mitwaly},
title = {Fast Algorithm for Mining Association Rules},
year = {}
}
Share
 |
 |
 |
 |
||
OpenURL
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 uses 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.
Keyphrases
fast algorithm mining association rule data mining association rule available algorithm java language treemap quot common data mining problem novel data structure arraylist quot discovery process important problem interesting subset present experimental result candidate generation frequent pattern mining
