Dynamic FP-tree based mining of frequent patterns satisfying succinct constraints

DOI10.1007/978-3-540-25954-1_7MaRDI QIDQ5717757zbMATH OpenOpenAlexFDO

Authors Carson Kai-Sang Leung

Publication date 10 January 2006

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b98003

zbMATH Keywords

constraintsData miningdynamic changesFP-treessuccinctness

Mathematics Subject Classification ID

Database theory (68P15)

Recommendations

• Dataset filtering techniques in constraint-based frequent pattern mining
• Mining frequent patterns with the pattern tree
• Efficient strategies for tough aggregate constraint-based sequential pattern mining
• scientific article; zbMATH DE number 2020222
• Efficient single-pass frequent pattern mining using a prefix-tree

This page was built for publication: Dynamic FP-tree based mining of frequent patterns satisfying succinct constraints

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