A heuristic for mining association rules in polynomial time. (Q1410915)
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 heuristic for mining association rules in polynomial time. |
scientific article; zbMATH DE number 1993256
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A heuristic for mining association rules in polynomial time. |
scientific article; zbMATH DE number 1993256 |
Statements
A heuristic for mining association rules in polynomial time. (English)
0 references
15 October 2003
0 references
Data mining
0 references
Association rules
0 references
Algorithm analysis
0 references
One clause at a time (OCAT) approach
0 references
Randomized algorithms
0 references
Heuristics
0 references
Boolean functions
0 references
0 references
0 references
