A heuristic for mining association rules in polynomial time. (Q1410915): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 16:42, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A heuristic for mining association rules in polynomial time. |
scientific article |
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
