Abstract
Association rule mining technique plays an important role in data mining research where the aim is to find interesting correlations between sets of items in databases. The apriori algorithm has been the most popular techniques in finding frequent patterns. However, when applying this method a database has to be scanned many times to calculate the counts of the huge umber of candidate items sets. A new algorithm has been proposed as a solution to this problem. The proposed algorithm is mainly concentrated to reduce the candidate sets generation and also aimed to increase the time of execution of the process.
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 Computer Applications Technology and Research
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.
