A vertical algorithm for finding frequent closed itemsets and frequent generators (Q4968969)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7254917
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A vertical algorithm for finding frequent closed itemsets and frequent generators |
scientific article; zbMATH DE number 7254917 |
Statements
Egy gyakori zárt mintákat és gyakori generátorokat kereső vertikális algoritmus (English)
0 references
2 October 2020
0 references
frequent itemsets
0 references
0.7667469382286072
0 references
0.7515624761581421
0 references
0.745631754398346
0 references
0.7432833313941956
0 references
0.7412859201431274
0 references
