Online Rule Learning via Weighted Model Counting - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier Access content directly
Conference Papers Year : 2008

Online Rule Learning via Weighted Model Counting

Frédéric Koriche

Abstract

Online multiplicative weight-update learning algorithms, such asWinnow, have proven to behave remarkably for learning simple disjunctions with few relevant attributes. The aim of this paper is to extend theWinnow algorithm to more expressive concepts characterized by DNF formulas with few relevant rules. For such problems, the convergence of Winnow is still fast, since the number of mistakes increases only linearly with the number of attributes. Yet, the learner is confronted with an important computational barrier: during any prediction, it must evaluate the weighted sum of an exponential number of rules. To circumvent this issue, we convert the prediction problem into a Weighted Model Counting problem. The resulting algorithm, SharpNow, is an exact simulation ofWinnow equipped with backtracking, caching, and decomposition techniques. Experiments on static and drifting problems demonstrate the performance of the algorithm in terms of accuracy and speed.
Fichier principal
Vignette du fichier
ECAI08-Article-FV.pdf (185.72 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

lirmm-00315916 , version 1 (01-09-2008)
lirmm-00315916 , version 2 (15-03-2009)

Identifiers

  • HAL Id : lirmm-00315916 , version 2

Cite

Frédéric Koriche. Online Rule Learning via Weighted Model Counting. ECAI'08: Eighteenth European Conference on Artificial Intelligence, Patras, Greece, pp.5-9. ⟨lirmm-00315916v2⟩
95 View
361 Download

Share

Gmail Facebook X LinkedIn More