Identifying approximate itemsets of interest in large databases

DOI10.1023/A:1020995206763MaRDI QIDQ1398080zbMATH OpenWikidataFDO

Authors Chengqi Zhang, Shi Chao Zhang, Geoffrey I. Webb

Publication date 6 August 2003

Published in Applied Intelligence (Search for Journal in Brave)

zbMATH Keywords

data miningfrequent itemsetsampling approximate

Mathematics Subject Classification ID

Database theory (68P15)

Recommendations

• scientific article; zbMATH DE number 2016855
• An algorithm for discovering the frequent closed itemsets in a large database
• Approximate frequent itemset mining in the presence of random noise
• scientific article; zbMATH DE number 1964830
• A fast algorithm for mining association rules

Cited in

(6)

• Adaptive data reduction for large-scale transaction data
• An efficient rigorous approach for identifying statistically significant frequent itemsets
• scientific article; zbMATH DE number 2016855 (Why is no real title available?)
• Approximate frequent itemset mining in the presence of random noise
• Semi-parametric optimization for missing data imputation
• Efficient automatic discovery of `hot' itemsets

This page was built for publication: Identifying approximate itemsets of interest in large databases

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