MétaCan
Menu
Back to cohort
Record W1985134489 · doi:10.1117/12.669579

Combination rules of evidence for situation assessment and target identification

2006· article· en· W1985134489 on OpenAlexaff
Hongyan Sun, M. Farooq

Bibliographic record

VenueProceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE · 2006
Typearticle
Languageen
FieldComputer Science
TopicDistributed Sensor Networks and Detection Algorithms
Canadian institutionsRoyal Military College of Canada
Fundersnot available
KeywordsIdentification (biology)Rule-based systemDempster–Shafer theoryMathematicsArtificial intelligenceDecision ruleFuzzy ruleExpert systemData miningComputer scienceMachine learningPattern recognition (psychology)Fuzzy setFuzzy logic

Abstract

fetched live from OpenAlex

In this paper, the combination rules, such as the Dempster-Shafer's (D-S) combination rule, the Yager's combination rule, the Dubois and Prade's (D-P) combination rule, the DSm's combination rule and the disjunctive combination rule, are applied to the situation assessment and target identification problems. Given two independent sources of information with different resolutions, the results from each combination rule of evidence are analyzed. It is observed from these results that the DSm's rule is the fastest in arriving at a decision compared to the other three rules, while the disjunctive combination rule is the slowest. The Yager's rule yields the same identification results for the situation assessment as the Dubois and Prade's rule. Moreover, the decision-making of the D-S' rule is faster than that of the Yager's as well as of the Dubois and Prade's rules, however, slower than that of the DSm's rule

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.019
metaresearch head score (Gemma)0.094
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.019
Threshold uncertainty score0.102

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0190.094
Meta-epidemiology (narrow)0.0020.001
Meta-epidemiology (broad)0.0020.003
Bibliometrics0.0070.005
Science and technology studies0.0020.002
Scholarly communication0.0040.007
Open science0.0030.002
Research integrity0.0020.003
Insufficient payload (model declined to judge)0.0050.002

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.023
GPT teacher head0.269
Teacher spread0.245 · 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

Citations1
Published2006
Admission routes1
Has abstractyes

Explore more

Same venueProceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIESame topicDistributed Sensor Networks and Detection AlgorithmsFrench-language works237,207