Abstract
In order to solve the problem that it is necessary to scan the database many times and produce unnecessary frequent itemsets in the process of mining indirect association rules, a new algorithm FPI-mine based on FP-Tree is designed to mine the indirect association rules in transaction database. Firstly, FP-Tree is constructed, and then the indirect item pairs and intermediate support sets of all frequent items are found. Finally, all the indirect association rules are obtained by mining algorithm. It can directly mine indirect association rules without generating all frequent itemsets. Finally, the effectiveness of the algorithm is verified by experiments.
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.
