An algorithm for discovering the frequent closed itemsets in a large database

DOI10.1080/09528130600975758zbMath1111.68031OpenAlexW2073385028MaRDI QIDQ3429323

No author found.

Publication date: 30 March 2007

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

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

zbMATH Keywords

latticefrequent closed itemsetsclosed tidsetsreduced IT-tree

Mathematics Subject Classification ID

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

Related Items (1)

Meta itemset: a new concise representation of frequent itemset

Cites Work

• Unnamed Item

This page was built for publication: An algorithm for discovering the frequent closed itemsets in a large database