Complex event processing under uncertainty using Markov chains, constraints, and sampling - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2018

Complex event processing under uncertainty using Markov chains, constraints, and sampling

Résumé

For the last two decades, complex event processing under uncertainty has been widely studied, but, nowadays, researchers are still facing difficult problems such as combinatorial explosion or lack of expressiveness while inferring about possible outcomes. Numerous approaches have been proposed, like automaton based methods, stochastic context-free grammars, or mixed methods using first-order logic and probabilistic graphical models. Each technique has its own pros and cons, which rely on the problem structure and underlying assumptions. In our case, we want to propose a model providing the probability of a complex event from long data streams produced by a simple, but large system, in a reasonable amount of time. Furthermore, we want this model to allow considering prior knowledge on data streams with a high degree of expressiveness.
Fichier principal
Vignette du fichier
rule_ml_final.pdf (557.37 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01891691 , version 1 (17-04-2020)

Identifiants

Citer

Romain Rincé, Romain Kervarc, Philippe Leray. Complex event processing under uncertainty using Markov chains, constraints, and sampling. 2nd International Joint Conference on Rules and Reasoning (RuleML+RR 2018), 2018, Luxembourg, Luxembourg. pp.147-163, ⟨10.1007/978-3-319-99906-7_10⟩. ⟨hal-01891691⟩
144 Consultations
79 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More