Finding a short and accurate decision rule in disjunctive normal form by exhaustive search

DOI10.1007/s10994-010-5168-9zbMath1470.68164OpenAlexW2002303652MaRDI QIDQ1959589

Jan A. Kors, Peter R. Rijnbeek

Publication date: 7 October 2010

Published in: Machine Learning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10994-010-5168-9

zbMATH Keywords

branch-and-boundinductionexhaustive searchrule learning

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (5)

bsnsing: A Decision Tree Induction Method Based on Recursive Optimal Boolean Rule Composition ⋮ Causal Rule Sets for Identifying Subgroups with Enhanced Treatment Effects ⋮ Learning Certifiably Optimal Rule Lists for Categorical Data ⋮ Unnamed Item ⋮ Unnamed Item

Uses Software

• UCI-ml
• C4.5

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the handling of continuous-valued attributes in decision tree generation
• Cost-sensitive learning and decision making revisited
• Very simple classification rules perform well on most commonly used datasets
• An experimental evaluation of simplicity in rule learning
• Fast algorithms for genegrating integer partitions
• A study of relevance for learning in deductive databases

This page was built for publication: Finding a short and accurate decision rule in disjunctive normal form by exhaustive search