A heuristic for mining association rules in polynomial time.
type: Item
instance of: scholarly article
title: A heuristic for mining association rules in polynomial time.
zbMATH Open document ID: 1048.68038
DOI: 10.1016/S0895-7177(03)80016-X
author: D. Massart
published in: Mathematical and Computer Modelling
publication date: 2003-10-15T00:00:00Z
Mathematics Subject Classification ID: 68P15
zbMATH DE Number: 1993256
zbMATH Keywords: Data mining
zbMATH Keywords: Association rules
zbMATH Keywords: Algorithm analysis
zbMATH Keywords: One clause at a time (OCAT) approach
zbMATH Keywords: Randomized algorithms
zbMATH Keywords: Heuristics
zbMATH Keywords: Boolean functions
MaRDI profile type: Publication
cites work: Set-oriented data mining in relational databases
cites work: A greedy randomized adaptive search procedure (GRASP) for inferring logical clauses from examples in polynomial time and some extensions
cites work: A Relationship Between CNF and DNF Systems Derivable from Examples
cites work: Inference of a minimum size Boolean function from examples by using a new efficient branch-and-bound approach
cites work: Generating logical expressions from positive and negative examples via a branch-and-bound approach
cites work: Q3935440
full work available at URL: s0895-7177(03)80016-x
OpenAlex ID: W2054904948
description: scientific article; zbMATH DE number 1993256