The PDF file you selected should load here if your Web browser has a PDF reader plug-in installed (for example, a recent version of Adobe Acrobat Reader).

If you would like more information about how to print, save, and work with PDFs, Highwire Press provides a helpful Frequently Asked Questions about PDFs.

Alternatively, you can download the PDF file directly to your computer, from where it can be opened using a PDF reader. To download the PDF, click the Download link above.

Fullscreen Fullscreen Off


In the current trend, development of various applications of Data mining gains much importance. Data mining is a process of extracting interesting, advantageous and understandable patterns from huge databases. Mining Association rules from large databases is one of the important tasks in data mining. Association rule mining is based on two steps: finding frequent item set and generating rules from it. There are many algorithms for finding frequent item set. Processing large databases for generating efficient association rules necessitates repeated scans which increases the computing time. Data Structures plays a main role in reducing the complexity of computational operations. In this paper we have focused on the theories of standard data structures used in mining proficient association rules and exemplified with examples.

Keywords

Data Mining, Data Structures, FP-Tree, Pre-Large Tree, Tries
User