Abstract
Association Rule Mining plays a major role in current research. This classical algorithm extracts frequent itemsets from large dataset which identifies Correlation between different items in the Transaction. Main issue in this algorithm is doubling the data scanning time. Many algorithms are proposed to find association rule and avoid complexity. This paper highlights two algorithms such as Novel Pruning approach for association rule mining and Hiding of Sensitive Association Rule by using improved Apriori algorithm. Finally, Suggested an integrated approach for Filtering Infrequent Itemsets and hiding Sensitive Association Rules using Same method which removes infrequent itemsets for hiding sensitive items in the Dataset.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
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.