Efficiently Using Prefix-trees in Mining Frequent Itemsets

Efficient algorithms for mining frequent itemsets are crucial for mining association rules. Methods for mining frequent itemsets and for iceberg data cube computation have been implemented using a prefix-tree structure, known as an FP-tree, for storing compressed information about frequent itemsets. Numerous experimental results have demonstrated that these… CONTINUE READING

5 Figures & Tables



Citations per Year

570 Citations

Semantic Scholar estimates that this publication has 570 citations based on the available data.

See our FAQ for additional information.