MétaCan
Menu
Back to cohort
Record W2115067547 · doi:10.1109/acc.2011.5991210

Bayesian method for identification of constrained nonlinear processes with missing output data

2011· article· en· W2115067547 on OpenAlex

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.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicTarget Tracking and Data Fusion in Sensor Networks
Canadian institutionsUniversity of Alberta
Fundersnot available
KeywordsMissing dataExpectation–maximization algorithmLikelihood functionParticle filterComputer scienceAlgorithmIdentification (biology)Nonlinear systemData setFunction (biology)Set (abstract data type)MaximizationMathematical optimizationBayesian probabilityEstimation theoryData miningMaximum likelihoodMathematicsArtificial intelligenceStatisticsKalman filterMachine learning

Abstract

fetched live from OpenAlex

A methodology for the identification of nonlinear models using constrained particle filters under the scheme of the expectation-maximization (EM) algorithm is presented in this paper. Missing or irregularly sampled observations are commonplace in the chemical industry. In order to circumvent the difficulties rendered by largely incomplete data set, an improved EM based algorithm, which uses the expected value of the log-likelihood function including the missing observations, is developed. Constrained particle filters are adopted to solve the expected log-likelihood function in the EM algorithm. The efficiency of the proposed method in handling missing data is illustrated through numerical examples and validated through experiments.

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.001
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: Methods
Teacher disagreement score0.962
Threshold uncertainty score0.282

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.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.0010.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.082
GPT teacher head0.312
Teacher spread0.230 · 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