Abstract
Mining frequent closed itemsets is a fundamental and important issue in many data mining applications.A new depth-first search algorithm for mining frequent closed itemsets called depth-first search for frequent closed itemsets(DFFCI)was proposed,which could reduce the number of candidate itemsets and the cost of support counting.DFFCI projected the dataset information stored by the improved Compressed Frequent Pattern tree(CFP-Tree)into the partition matrix,and improved the efficiency of support counting by using binary vector logic operation.Global 2-itemset pruning based on support pre-counting and local extension pruning were used to prune the search space effectively.The experimental results show that DFFCI outperforms other depth-first search algorithms.
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.
