An algorithm for discovering the frequent closed itemsets in a large database (Q3429323)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An algorithm for discovering the frequent closed itemsets in a large database |
scientific article; zbMATH DE number 5139318
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An algorithm for discovering the frequent closed itemsets in a large database |
scientific article; zbMATH DE number 5139318 |
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
0.93261427
0 references
0.9038779
0 references
0.89873326
0 references
