Using the structure of prelarge trees to incrementally mine frequent itemsets (Q2269083)
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: Using the structure of prelarge trees to incrementally mine frequent itemsets |
scientific article; zbMATH DE number 5681695
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Using the structure of prelarge trees to incrementally mine frequent itemsets |
scientific article; zbMATH DE number 5681695 |
Statements
Using the structure of prelarge trees to incrementally mine frequent itemsets (English)
0 references
15 March 2010
0 references
data mining
0 references
FP-tree
0 references
prelarge-tree algorithm
0 references
incremental mining
0 references
maintenance
0 references
0.840386688709259
0 references
0.8268288969993591
0 references
0.7870205044746399
0 references
