Abstract

Aiming at the weakness of traditional Apriori algorithm, this paper presents MFI algorithm for mining maximum frequent itemsets on association rules. MFI algorithm scans database only once, the algorithm need not produce candidate itemsets, MFI algorithm does not use the method of iteration for each layer, MFI algorithm adopts binary bit and logic operation.The efficiency is distinctly improved in mining maximum frequent itemset.

Full Text
Paper version not known

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 call

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.