A heuristic for mining association rules in polynomial time.

DOI10.1016/S0895-7177(03)80016-XzbMath1048.68038OpenAlexW2054904948MaRDI QIDQ1410915

D. Massart

Publication date: 15 October 2003

Published in: Mathematical and Computer Modelling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0895-7177(03)80016-x

zbMATH Keywords

HeuristicsBoolean functionsData miningRandomized algorithmsAssociation rulesAlgorithm analysisOne clause at a time (OCAT) approach

Mathematics Subject Classification ID

Database theory (68P15)

Related Items (1)

Mining pure linguistic associations from numerical data

Cites Work

• Unnamed Item
• A greedy randomized adaptive search procedure (GRASP) for inferring logical clauses from examples in polynomial time and some extensions
• Generating logical expressions from positive and negative examples via a branch-and-bound approach
• Inference of a minimum size Boolean function from examples by using a new efficient branch-and-bound approach
• Set-oriented data mining in relational databases
• A Relationship Between CNF and DNF Systems Derivable from Examples

This page was built for publication: A heuristic for mining association rules in polynomial time.