Efficient single-pass frequent pattern mining using a prefix-tree

DOI10.1016/J.INS.2008.10.027MaRDI QIDQ1010129zbMATH OpenOpenAlexFDO

Authors Syed Khairuzzaman Tanbeer, Chowdhury Farhan Ahmed, Byeong-Soo Jeong, Young-Koo Lee

Publication date 3 April 2009

Published in Information Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ins.2008.10.027

zbMATH Keywords

data miningassociation rulefrequent patternincremental mininginteractive mining

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Pattern recognition, speech recognition (68T10) Database theory (68P15)

Recommendations

• Mining frequent patterns with the pattern tree
• CP-tree: an adaptive synopsis structure for compressing frequent itemsets over online data streams
• New frequent pattern tree structure
• Using the structure of prelarge trees to incrementally mine frequent itemsets
• scientific article; zbMATH DE number 2088043

Cites work

• scientific article; zbMATH DE number 1977833 (Why is no real title available?)
• Efficient strategies for tough aggregate constraint-based sequential pattern mining
• Fuzzy association rules and the extended mining algorithms
• Interactive sequence discovery by incremental mining

Cited in

(8)

• Mining weighted sequential patterns in incremental uncertain databases
• New frequent pattern tree structure
• Constraint Databases
• Using the structure of prelarge trees to incrementally mine frequent itemsets
• A Shapley Value Index for Market Basket Analysis: Efficient Computation Using an Harsanyi Dividend Representation
• Efficient top-\(k\) high utility itemset mining on massive data
• CP-tree: an adaptive synopsis structure for compressing frequent itemsets over online data streams
• Mining frequent patterns with the pattern tree

Describes a project that uses

Uses Software

• UCI

This page was built for publication: Efficient single-pass frequent pattern mining using a prefix-tree

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