Mining frequent patterns with the pattern tree

DOI10.1007/BF03037636zbMATH Open1092.68032MaRDI QIDQ2493280FDOQ2493280

Authors: Yanyan Li 

Publication date: 12 June 2006

Published in: New Generation Computing (Search for Journal in Brave)

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

zbMATH Keywords

data miningassociation rulesfrequent patterns

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Database theory (68P15)

Cited In (19)

• Maintenance of fast updated frequent pattern trees for record deletion
• New frequent pattern tree structure
• Title not available (Why is that?)
• Title not available (Why is that?)
• A tree projection algorithm for generation of frequent item sets
• Tree structure for efficient data mining using rough sets
• Efficient single-pass frequent pattern mining using a prefix-tree
• Using the structure of prelarge trees to incrementally mine frequent itemsets
• Title not available (Why is that?)
• Constraint Databases
• Pattern space maintenance for data updates and interactive mining
• Mop: an efficient algorithm for mining frequent pattern with subtree traversing
• Efficient mining of traversal patterns
• A novel approach of mining strong jumping emerging patterns based on BSC-tree
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Constraint-Based Mining and Inductive Databases
• Title not available (Why is that?)

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)