Meta itemset: a new concise representation of frequent itemset

DOI10.1080/09528130902723690zbMath1320.68147OpenAlexW2028833013MaRDI QIDQ3401379

Jinhong Li, Wei Song, 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

data miningassociation ruleclosed itemsetmaximal itemsetmeta itemset

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• An algorithm for discovering the frequent closed itemsets in a large database
• Frequent mining of subgraph structures
• Generating frequent itemsets incrementally: two novel approaches based on Galois lattice theory
• Generalized disjunction-free representation of frequent patterns with negation

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