An algorithm for discovering the frequent closed itemsets in a large database (Q3429323)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An algorithm for discovering the frequent closed itemsets in a large database |
scientific article |
Statements
An algorithm for discovering the frequent closed itemsets in a large database (English)
0 references
30 March 2007
0 references
frequent closed itemsets
0 references
closed tidsets
0 references
reduced IT-tree
0 references
lattice
0 references
