Using the structure of prelarge trees to incrementally mine frequent itemsets

DOI10.1007/S00354-008-0072-6zbMATH Open1191.68208OpenAlexW2053986355MaRDI QIDQ2269083FDOQ2269083

Authors: Chun-Wei Lin, Wen-Hsiang Lu, T. P. Hong 

Publication date: 15 March 2010

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

Full work available at URL: https://doi.org/10.1007/s00354-008-0072-6

Recommendations

• Maintenance of the pre-large trees for record deletion
• Mining frequent patterns with the pattern tree
• scientific article; zbMATH DE number 2088043
• scientific article; zbMATH DE number 2101216
• Efficient single-pass frequent pattern mining using a prefix-tree

zbMATH Keywords

data miningmaintenanceincremental miningFP-treeprelarge-tree algorithm

Mathematics Subject Classification ID

Data structures (68P05)

Cites Work

• Mining optimized association rules for numeric attributes
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (4)

• Title not available (Why is that?)
• Mining frequent patterns with the pattern tree
• Efficient single-pass frequent pattern mining using a prefix-tree
• An efficient approach for incremental mining fuzzy frequent itemsets with FP-tree

This page was built for publication: Using the structure of prelarge trees to incrementally mine frequent itemsets

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