Efficient learning of large sets of locally optimal classification rules

DOI10.1007/s10994-022-06290-warXiv2301.09936MaRDI QIDQ6097160

Florian Beck, Johannes Fürnkranz, Van Quoc Phuong Huynh

Publication date: 12 June 2023

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

Full work available at URL: https://arxiv.org/abs/2301.09936

zbMATH Keywords

classificationdata miningmachine learningrule learning

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A new algorithm for fast mining frequent itemsets using N-lists
• Interpretable classifiers using rules and Bayesian analysis: building a better stroke prediction model
• Separate-and-conquer rule learning
• ROC `n' rule learning -- towards a better understanding of covering algorithms
• On the quest for optimal rule learning heuristics
• Branch-and-Price: Column Generation for Solving Huge Integer Programs
• Foundations of Rule Learning
• FUSINTER: A Method for Discretization of Continuous Attributes

This page was built for publication: Efficient learning of large sets of locally optimal classification rules