Algorithm for Efficient Multilevel Association Rule Mining

Content Provider	Open Access Library (OALib)
Author	Pratima Gautam
Abstract	over the years, a variety of algorithms for finding frequent item sets in very large transaction databases have been developed. The problems of finding frequent item sets are basic in multi level association rule mining, fast algorithms for solving problems are needed. This paper presents an efficient version of apriori algorithm for mining multi-level association rules in large databases to finding maximum frequent itemset at lower level of abstraction. We propose a new, fast and an efficient algorithm (SC-BF Multilevel) with single scan of database for mining complete frequent item sets. To reduce the execution time and increase throughput in new method. Our proposed algorithm works well comparison with general approach of multilevel association rules.
ISSN	09753397
Journal	International Journal on Computer Science and Engineering
Publisher	Engg Journals Publications
Publisher Date	2010-01-01
Access Restriction	Open
Subject Keyword	Data mining Transaction database Association rules Multilevel association rules
Content Type	Text
Resource Type	Article