Abstract
Efficient discovery of association rules in large database is a well studied problem and several approaches have been proposed. However, the previously proposed methods still encounter some performance bottlenecks when mining databases is updated, such as inserted and deleted. In this paper, we propose an incremental updating technique based on H-mine and xml, for the maintenance of association rules when new transaction data is added to a transaction database. A performance evaluation shows that our algorithm is available and scalable.
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: Journal of Algorithms & Computational Technology
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.
