The following pages link to Foundations of Rule Learning (Q3166345):
Displaying 22 items.
- Mining incomplete data with singleton, subset and concept probabilistic approximations (Q507637) (← links)
- ERBlox: combining matching dependencies with machine learning for entity resolution (Q518610) (← links)
- On cognitive preferences and the plausibility of rule-based models (Q782445) (← links)
- Bi-criteria optimization problems for decision rules (Q1730539) (← links)
- Anytime discovery of a diverse set of patterns with Monte Carlo tree search (Q1741383) (← links)
- Consistency of incomplete data (Q1750037) (← links)
- Editable machine learning models? A rule-based framework for user studies of explainability (Q2022486) (← links)
- Robust subgroup discovery. Discovering subgroup lists using MDL (Q2097449) (← links)
- Interpretable regularized class association rules algorithm for classification in a categorical data space (Q2212562) (← links)
- Embedding-based silhouette community detection (Q2217405) (← links)
- Time and space complexity of deterministic and nondeterministic decision trees (Q2679423) (← links)
- On the complexity of redescription mining (Q2680177) (← links)
- Rationalizing predictions by adversarial information calibration (Q2680803) (← links)
- 10.1162/153244302320884588 (Q4409350) (← links)
- (Q4633042) (← links)
- Learning Optimal Decision Sets and Lists with SAT (Q5026234) (← links)
- (Q5079773) (← links)
- Empirical risk minimization for dominance-based rough set approaches (Q6081307) (← links)
- Efficient learning of large sets of locally optimal classification rules (Q6097160) (← links)
- Constrained clustering: current and new trends (Q6602261) (← links)
- Explainable and interpretable machine learning and data mining (Q6637767) (← links)
- On the efficient implementation of classification rule learning (Q6661121) (← links)
