Abstract
The traditional algorithm of mining association rules, or slowly produces association rules, or produces too many redundant rules, or it is probable to find an association rule, which posses high support and confidence, but is uninteresting, and even is false. Furthermore, a rule with negative-item cant be produced. This paper puts forward a new algorithm MVNR(Mining Valid and non-Redundant Association Rules Algorithm),which primely solves above problems by using the minimal subset of frequent itemset.
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.
