Efficient single-pass frequent pattern mining using a prefix-tree
DOI10.1016/J.INS.2008.10.027zbMATH Open1170.68035OpenAlexW2024511949MaRDI QIDQ1010129FDOQ1010129
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
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
Learning and adaptive systems in artificial intelligence (68T05) Pattern recognition, speech recognition (68T10) Database theory (68P15)
Cites Work
Cited In (8)
- New frequent pattern tree structure
- Efficient top-\(k\) high utility itemset mining on massive data
- A Shapley Value Index for Market Basket Analysis: Efficient Computation Using an Harsanyi Dividend Representation
- Mining weighted sequential patterns in incremental uncertain databases
- Mining frequent patterns with the pattern tree
- Using the structure of prelarge trees to incrementally mine frequent itemsets
- Constraint Databases
- CP-tree: an adaptive synopsis structure for compressing frequent itemsets over online data streams
Uses Software
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)
