Abstract
In the field of knowledge discovery in databases (KDD), the effectiveness of association rules is important. Association rules are a technique of data mining, wherein we identify the relationship between one item to another. For mining, the association rules Apriori algorithm is widely used. The idea of the Apriori algorithm is to find the frequent sets from a transactional database. Through the frequent sets, association rules are obtained, and these rules must satisfy the minimum confidence threshold. This paper presents an improved method for deciding an optimum minimum support threshold and minimum confidence threshold, pruning of rules based on a contingency table, and finally the decision about whether to go for lift or confidence to get rid of uninteresting, misleading, and confusing association rules.
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 callDisclaimer: 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.
