Introduces an L*-based active learning algorithm for deterministic MDPs that uses trace sampling to infer complete models including states and outperforms passive methods on accuracy with equal data.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.LG 2verdicts
UNVERDICTED 2roles
background 1polarities
background 1representative citing papers
N-gram models equipped with a dynamic promotion ensemble match or exceed the accuracy of neural networks for next-activity prediction in event logs while using substantially fewer resources.
citing papers explorer
-
L*-Based Learning of Markov Decision Processes (Extended Version)
Introduces an L*-based active learning algorithm for deterministic MDPs that uses trace sampling to infer complete models including states and outperforms passive methods on accuracy with equal data.
-
Promoting Simple Agents: Ensemble Methods for Event-Log Prediction
N-gram models equipped with a dynamic promotion ensemble match or exceed the accuracy of neural networks for next-activity prediction in event logs while using substantially fewer resources.