A heuristic for mining association rules in polynomial time. (Q1410915): Difference between revisions

@@ Property / cites work @@
+Set-oriented data mining in relational databases
@@ Property / cites work: Set-oriented data mining in relational databases / rank @@
+Normal rank
@@ Property / cites work @@
+A greedy randomized adaptive search procedure (GRASP) for inferring logical clauses from examples in polynomial time and some extensions
+Normal rank
@@ Property / cites work @@
+A Relationship Between CNF and DNF Systems Derivable from Examples
+Normal rank
@@ Property / cites work @@
+Inference of a minimum size Boolean function from examples by using a new efficient branch-and-bound approach
+Normal rank
@@ Property / cites work @@
+Generating logical expressions from positive and negative examples via a branch-and-bound approach
+Normal rank
@@ Property / cites work @@
+Q3935440
@@ Property / cites work: Q3935440 / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/s0895-7177(03)80016-x
+Normal rank
@@ Property / OpenAlex ID @@
+W2054904948
@@ Property / OpenAlex ID: W2054904948 / rank @@
+Normal rank