MétaCan
Menu
Back to cohort
Record W2542314080 · doi:10.1109/aipr.2008.4906460

Exploitation of massive numbers of simple events

2008· article· en· W2542314080 on OpenAlexaff
Ray Rimey, Dan Keefe

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicAnomaly Detection Techniques and Applications
Canadian institutionsLockheed Martin (Canada)
Fundersnot available
KeywordsComputer scienceEvent (particle physics)Simple (philosophy)VisualizationData miningImage (mathematics)Volume (thermodynamics)Data typeData structureData scienceArtificial intelligence

Abstract

fetched live from OpenAlex

Emerging image-based sensor systems can observe a relatively large area (e.g., the size of an urban neighborhood) for long time intervals either continually or with high revisit rates. This type of sensor data makes new types of exploitation possible, but only with the assistance of automated exploitation aids because of the massive volume of data that must be studied as a whole. Automated methods to extract the simplest events from image sequences are often fairly robust (e.g., change events derived from EO or SAR image sequences or from video-derived tracks). Massive numbers of such events can contain information with high intelligence value. This paper examines this general-purpose problem: How massive numbers of the simplest sensor-derived events can be exploited. We summarize the basic functionality an intelligence analyst needs for studying this type of event data, in short: to understand the spatial structure, temporal structure and event-pair structure within an area of regard. Then we present a number of algorithms for automated exploitation of such data, and some visualization tools to help analysts study such data. Experimental results using all those technologies are also presented.

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.

How this classification was reachedexpand

Full frame machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.005
Version: metacan-v3-hybrid-931329e0061cValidation 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: Empirical · Consensus signal: none
Teacher disagreement score0.002
Threshold uncertainty score0.005

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.005
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0010.002
Science and technology studies0.0010.001
Scholarly communication0.0010.004
Open science0.0010.002
Research integrity0.0000.001
Insufficient payload (model declined to judge)0.0020.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.022
GPT teacher head0.262
Teacher spread0.239 · 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

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreEmpirical

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations2
Published2008
Admission routes1
Has abstractyes

Explore more

Same topicAnomaly Detection Techniques and ApplicationsFrench-language works237,207