A heuristic for mining association rules in polynomial time. (Q1410915): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Set-oriented data mining in relational databases / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A greedy randomized adaptive search procedure (GRASP) for inferring logical clauses from examples in polynomial time and some extensions / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A Relationship Between CNF and DNF Systems Derivable from Examples / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Inference of a minimum size Boolean function from examples by using a new efficient branch-and-bound approach / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Generating logical expressions from positive and negative examples via a branch-and-bound approach / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3935440 / rank | |||
Normal rank | |||
Revision as of 10:52, 6 June 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
