A new algorithm for fast mining frequent itemsets using N-lists (Q362278)
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: A new algorithm for fast mining frequent itemsets using N-lists |
scientific article; zbMATH DE number 6199717
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A new algorithm for fast mining frequent itemsets using N-lists |
scientific article; zbMATH DE number 6199717 |
Statements
A new algorithm for fast mining frequent itemsets using N-lists (English)
0 references
20 August 2013
0 references
data mining
0 references
frequent itemset mining
0 references
data structure
0 references
N-lists
0 references
algorithm
0 references
0.88250434
0 references
