An efficient method for discovery of large item sets Online publication date: Sun, 01-Jan-2017
by Deepa S. Deshpande
International Journal of Data Mining, Modelling and Management (IJDMMM), Vol. 8, No. 4, 2016
Abstract: In today's emerging field of descriptive data mining, association rule mining (ARM) has been proven helpful to describe essential characteristics of data from large databases. Mining frequent item sets is the fundamental task of ARM. Apriori, the most influential traditional ARM algorithm, adopts iterative search strategy for frequent item set generation. But, multiple scans of database, candidate item set generation and large load of system's I/O are major abuses which degrade the mining performance of it. Therefore, we proposed a new method for mining frequent item sets which overcomes these shortcomings. It judges the importance of occurrence of an item set by counting present and absent count of an individual item. Performance evaluation with Apriori algorithm shows that proposed method is more efficient as it finds fewer items in frequent item set in 50% less time without backtracking. It also reduces system I/O load by scanning the database only once.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Data Mining, Modelling and Management (IJDMMM):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook