ROC `n' rule learning -- towards a better understanding of covering algorithms

DOI10.1007/s10994-005-5011-xzbMath1075.68071OpenAlexW2011101028WikidataQ58642791 ScholiaQ58642791MaRDI QIDQ1777415

Peter A. Flach, Johannes Fürnkranz

Publication date: 13 May 2005

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

Full work available at URL: https://doi.org/10.1007/s10994-005-5011-x

zbMATH Keywords

learning algorithms

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Learning and adaptive systems in artificial intelligence (68T05)

Related Items (21)

For real: a thorough look at numeric attributes in subgroup discovery ⋮ Optimal estimator of hypothesis probability for data mining problems with small samples ⋮ Sequential Optimization of $$\gamma $$-Decision Rules Relative to Length, Coverage and Number of Misclassifications ⋮ Efficient learning of large sets of locally optimal classification rules ⋮ Approximate Bayesian inference in spatial GLMM with skew normal latent variables ⋮ Gleaner: Creating ensembles of first-order clauses to improve recall-precision curves ⋮ Measures of Ruleset Quality Capable to Represent Uncertain Validity ⋮ Cluster-grouping: from subgroup discovery to clustering ⋮ On the quest for optimal rule learning heuristics ⋮ Itemset mining: a constraint programming perspective ⋮ Behavior-based clustering and analysis of interestingness measures for association rule mining ⋮ Simple Pattern Minimality Problems: Integer Linear Programming Formulations and Covering-Based Heuristic Solving Approaches ⋮ Secure Top-k Subgroup Discovery ⋮ Extreme value correction: a method for correcting optimistic estimations in rule learning ⋮ Visualizing the behavior and some symmetry properties of Bayesian confirmation measures ⋮ MiningZinc: a declarative framework for constraint-based mining ⋮ Measures of ruleset quality for general rules extraction methods ⋮ Quality improvement of rule-based gene group descriptions using information about GO terms importance occurring in premises of determined rules ⋮ On the connection between the phase transition of the covering test and the learning success rate in ILP ⋮ Revisiting the optimal probability estimator from small samples for data mining ⋮ On cognitive preferences and the plausibility of rule-based models

This page was built for publication: ROC `n' rule learning -- towards a better understanding of covering algorithms