Mining frequent patterns with the pattern tree
From MaRDI portal
Publication:2493280
Recommendations
- Efficient single-pass frequent pattern mining using a prefix-tree
- New frequent pattern tree structure
- scientific article; zbMATH DE number 2088043
- Using the structure of prelarge trees to incrementally mine frequent itemsets
- Mop: an efficient algorithm for mining frequent pattern with subtree traversing
Cited in
(19)- Efficient single-pass frequent pattern mining using a prefix-tree
- Using the structure of prelarge trees to incrementally mine frequent itemsets
- scientific article; zbMATH DE number 1700008 (Why is no real title available?)
- Efficient mining of traversal patterns
- Pattern space maintenance for data updates and interactive mining
- Mop: an efficient algorithm for mining frequent pattern with subtree traversing
- scientific article; zbMATH DE number 5522675 (Why is no real title available?)
- New frequent pattern tree structure
- Tree structure for efficient data mining using rough sets
- scientific article; zbMATH DE number 1755532 (Why is no real title available?)
- scientific article; zbMATH DE number 1930110 (Why is no real title available?)
- scientific article; zbMATH DE number 2088043 (Why is no real title available?)
- scientific article; zbMATH DE number 2099992 (Why is no real title available?)
- A novel approach of mining strong jumping emerging patterns based on BSC-tree
- scientific article; zbMATH DE number 2217745 (Why is no real title available?)
- Constraint Databases
- Constraint-Based Mining and Inductive Databases
- A tree projection algorithm for generation of frequent item sets
- Maintenance of fast updated frequent pattern trees for record deletion
This page was built for publication: Mining frequent patterns with the pattern tree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2493280)
