Depth-first search algorithm for mining frequent closed itemsets

DOI10.3724/SP.J.1087.2010.00806MaRDI QIDQ3021446zbMATH OpenOpenAlexFDO

Authors Xin Zhang, Pin Liao, Bo Guo

Publication date 25 July 2011

Published in Journal of Computer Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3724/sp.j.1087.2010.00806

zbMATH Keywords

CFP-treecompressed frequent pattern treedata miningfrequent closed itemsetpartition matrix

Mathematics Subject Classification ID

Database theory (68P15) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• An efficient algorithm for mining frequent maximal and closed itemsets
• An algorithm for discovering the frequent closed itemsets in a large database
• Disclosed: an efficient depth-first, top-down algorithm for mining disjunctive closed itemsets in high-dimensional data

Cited in

(8)

• BFS miner algorithm
• Cherry: an algorithm for mining frequent closed itemsets without subset checking
• An algorithm for discovering the frequent closed itemsets in a large database
• A new algorithm for mining frequent closed patterns in gene expression data sets
• scientific article; zbMATH DE number 1983170 (Why is no real title available?)
• scientific article; zbMATH DE number 2013276 (Why is no real title available?)
• A vertical algorithm for finding frequent closed itemsets and frequent generators
• Disclosed: an efficient depth-first, top-down algorithm for mining disjunctive closed itemsets in high-dimensional data

This page was built for publication: Depth-first search algorithm for mining frequent closed itemsets

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