Meta itemset: a new concise representation of frequent itemset

DOI10.1080/09528130902723690MaRDI QIDQ3401379zbMATH OpenOpenAlexFDO

Authors Wei Song, Jinhong Li, Zhang-Yan Xu

Publication date 29 January 2010

Published in Journal of Experimental & Theoretical Artificial Intelligence (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/09528130902723690

zbMATH Keywords

association ruleclosed itemsetdata miningmaximal itemsetmeta itemset

Mathematics Subject Classification ID

Database theory (68P15) Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• scientific article; zbMATH DE number 1945800
• scientific article; zbMATH DE number 1934545
• Knowledge Discovery in Inductive Databases
• scientific article; zbMATH DE number 1983139
• scientific article; zbMATH DE number 1696739

Cites work

• An algorithm for discovering the frequent closed itemsets in a large database
• Frequent mining of subgraph structures
• Generalized disjunction-free representation of frequent patterns with negation
• Generating frequent itemsets incrementally: two novel approaches based on Galois lattice theory
• scientific article; zbMATH DE number 1696848 (Why is no real title available?)
• scientific article; zbMATH DE number 1755713 (Why is no real title available?)

Cited in

(3)

• scientific article; zbMATH DE number 1934545 (Why is no real title available?)
• scientific article; zbMATH DE number 1945800 (Why is no real title available?)
• Knowledge Discovery in Inductive Databases

This page was built for publication: Meta itemset: a new concise representation of frequent itemset

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