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

DOI10.1016/J.INS.2008.10.027zbMath1170.68035OpenAlexW2024511949MaRDI QIDQ1010129

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

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 miningincremental miningassociation rulefrequent patterninteractive mining

Mathematics Subject Classification ID

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

Related Items (3)

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

Uses Software

• UCI-ml

Cites Work

• Interactive sequence discovery by incremental mining
• Fuzzy association rules and the extended mining algorithms
• Efficient strategies for tough aggregate constraint-based sequential pattern mining
• Unnamed Item

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