Indian Journal of Science and Technology
Year: 2015, Volume: 8, Issue: 24, Pages: 1-8
Y. Jeya Sheela and S. H. Krishnaveni*
Department of Information Technology, Noorul Islam University, Kumaracoil, Kanyakumari - 629180, Tamil Nadu, India;
[email protected], [email protected]
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
Subscribe now for latest articles and news.