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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Data Mining, Modelling and Management
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
