MétaCan
Menu
Back to cohort
Record W4393375513 · doi:10.23977/jaip.2024.070119

Rule-based Matching and Hidden Markov Model-based Warning for Brushing Behavior

2024· article· en· W4393375513 on OpenAlex
Jian Wang, Yang Liu

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

VenueJournal of Artificial Intelligence Practice · 2024
Typearticle
Languageen
FieldEngineering
TopicEvacuation and Crowd Dynamics
Canadian institutionsnot available
Fundersnot available
KeywordsMatching (statistics)Computer scienceArtificial intelligenceHidden Markov modelMarkov chainPattern recognition (psychology)Machine learningStatisticsMathematics

Abstract

fetched live from OpenAlex

This paper proposes a warning system for brushing behavior based on the tobacco industry's reward activities by combining rule-based matching and Hidden Markov Models. Targeting behaviors where customers make large-scale purchases during promotional events that deviate from their individual historical consumption patterns, the system employs rule-based matching for initial assessment, followed by a more in-depth behavioral analysis using Hidden Markov Models. Experimental results demonstrate the significant effectiveness of the system in warning against brushing behavior, providing an effective monitoring tool for the tobacco industry and similar sectors.

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.001
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: Simulation or modeling
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.718
Threshold uncertainty score0.589

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.001
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.037
GPT teacher head0.335
Teacher spread0.298 · 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