A heuristic for mining association rules in polynomial time. (Q1410915): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/s0895-7177(03)80016-x / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2054904948 / rank | |||
Normal rank | |||
Latest revision as of 10:20, 30 July 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
0 references
0 references
