An efficient algorithm for mining frequent maximal and closed itemsets

DOI10.3233/HIS-2009-0091zbMath1200.68187OpenAlexW1618442343MaRDI QIDQ3655433

Tarek F. Gharib

Publication date: 7 January 2010

Published in: International Journal of Hybrid Intelligent Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3233/his-2009-0091

zbMATH Keywords

blanketmaximal and closed itemsetsmining-frequent itemsets

Mathematics Subject Classification ID

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

Related Items (2)

Expressive generalized itemsets ⋮ Exploiting the formation of maximal cliques in social networks

This page was built for publication: An efficient algorithm for mining frequent maximal and closed itemsets