A tree projection algorithm for generation of frequent item sets

DOI10.1006/JPDC.2000.1693MaRDI QIDQ5943114zbMATH OpenOpenAlexFDO

Authors Ramesh C. Agarwal, Charu C. Aggarwal, V. V. V. Prasad

Publication date 9 September 2001

Published in Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/jpdc.2000.1693

zbMATH Keywords

tree projection algorithm

Mathematics Subject Classification ID

Database theory (68P15)

Recommendations

• scientific article; zbMATH DE number 1863282
• scientific article; zbMATH DE number 5522675
• scientific article; zbMATH DE number 1954170
• New frequent pattern tree structure
• Mining frequent patterns with the pattern tree

Cited in

(12)

• TCOM, an innovative data structure for mining association rules among infrequent items
• Maintaining discovered frequent itemsets: Cases for changeable database and support
• A lattice-based approach for I/O efficient association rule mining.
• Opportunistic mining of top-\(n\) high utility patterns
• Applying frequent itemset mining to identify a small itemset that satisfies a large percentage of orders in a warehouse
• Induction of association rules: apriori implementation
• scientific article; zbMATH DE number 1863282 (Why is no real title available?)
• An efficient procedure for mining statistically significant frequent itemsets
• An integrated cuckoo search-genetic algorithm for mining frequent itemsets
• Simple algorithms for frequent item set mining
• Efficient high utility itemset mining without the join operation
• Mining maximal hyperclique pattern: a hybrid search strategy

This page was built for publication: A tree projection algorithm for generation of frequent item sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5943114)