Abstract
AbstractUser-defined specification of support and confidence thresholds often degrades the significance of the association rules. The task is highly domain-dependent and henceforth leads to discovery of huge number of association rules. In addition, the existing approaches exclude rare itemsets for significant association rules. Significance depends on the associability between the itemsets forming association rules. This paper introduces an efficient technique for discovering significant association rules with high associability using multiple minimum supports (MMS), jaccard similarity index, and maximum permissible flexible dissociation. Subsequently, an efficient algorithm called SAMSAR (Semi-Automated Mining of Significant Association Rule) is developed that does not require support and confidence thresholds. Performance of the proposed SAMSAR is quite satisfactory in comparison with the relevant approaches.KeywordsAssociation rule miningAssociabilityMultiple minimum supportsJaccard similarityPermissible flexible dissociation
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.
