Foundations of Rule Learning
From MaRDI portal
Publication:3166345
DOI10.1007/978-3-540-75197-7zbMath1263.68002OpenAlexW1494581921MaRDI QIDQ3166345
Nada Lavrač, Dragan Gamberger, Johannes Fürnkranz
Publication date: 11 October 2012
Published in: Cognitive Technologies (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-75197-7
Computational learning theory (68Q32) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Learning and adaptive systems in artificial intelligence (68T05)
Related Items (19)
Time and space complexity of deterministic and nondeterministic decision trees ⋮ Empirical risk minimization for dominance-based rough set approaches ⋮ On the complexity of redescription mining ⋮ Rationalizing predictions by adversarial information calibration ⋮ Efficient learning of large sets of locally optimal classification rules ⋮ Rule Induction and Reasoning over Knowledge Graphs ⋮ Interpretable regularized class association rules algorithm for classification in a categorical data space ⋮ Embedding-based silhouette community detection ⋮ Bi-criteria optimization problems for decision rules ⋮ Anytime discovery of a diverse set of patterns with Monte Carlo tree search ⋮ Mining incomplete data with singleton, subset and concept probabilistic approximations ⋮ Consistency of incomplete data ⋮ ERBlox: combining matching dependencies with machine learning for entity resolution ⋮ Unnamed Item ⋮ Editable machine learning models? A rule-based framework for user studies of explainability ⋮ On cognitive preferences and the plausibility of rule-based models ⋮ Unnamed Item ⋮ Robust subgroup discovery. Discovering subgroup lists using MDL ⋮ Learning Optimal Decision Sets and Lists with SAT
This page was built for publication: Foundations of Rule Learning