MétaCan
Menu
Back to cohort
Record W2475399949 · doi:10.2495/dne-v11-n3-275-283

Towards anticipate detection of complex event processing rules with probabilistic modelling

2016· article· en· W2475399949 on OpenAlex
Fernando Terroso-Sáenz, Aurora González-Vidal, Antonio Skármeta

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

venuePublished in a venue whose home country is Canada.
no affNo Canadian affiliation: this work is invisible to an affiliation-only frame.
No Canadian affiliation. An affiliation-only frame, the usual design, would never have seen this work. It is one of the works that make the case for inverting the frame.

Bibliographic record

VenueInternational Journal of Design & Nature and Ecodynamics · 2016
Typearticle
Languageen
FieldComputer Science
TopicAdvanced Database Systems and Queries
Canadian institutionsnot available
FundersEuropean Regional Development FundHorizon 2020 Framework ProgrammeMinisterio de Economía y CompetitividadEuropean Commission
KeywordsComputer scienceEvent (particle physics)Probabilistic logicComplex event processingData miningArtificial intelligenceProcess (computing)Programming languagePhysics

Abstract

fetched live from OpenAlex

Nowadays, Big Data implies not only the need of processing high volume of data, but also do it in a timely manner. In this scope, the Complex Event Processing (CEP) paradigm has arisen as a prominent real-time rule-based solution. Due to its reactive nature, a CEP system might suffer from slight delays in the activation of its rules that could not be desirable in certain environments. As a result, the present work introduces a novel mechanism that intends to anticipate the activation of event-based rules and, thus, come up with even faster CEP systems. This is achieved by means of a probabilistic modelling of each rule's precondition. Finally, the proposal includes a preliminary evaluation so as to show its suitability.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.810
Threshold uncertainty score0.220

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.001
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.000

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.025
GPT teacher head0.274
Teacher spread0.249 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it