MétaCan
Menu
Back to cohort
Record W2147807687 · doi:10.1109/iscit.2009.5341219

Cross-Entropy optimization for sensor selection problems

2009· article· en· W2147807687 on OpenAlexaff
Muhammad Naeem, D. C. Lee

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicDistributed Sensor Networks and Detection Algorithms
Canadian institutionsSimon Fraser University
Fundersnot available
KeywordsCross-entropy methodMathematical optimizationSelection (genetic algorithm)Monte Carlo methodEntropy (arrow of time)Computer scienceComputational complexity theoryOptimization problemSet (abstract data type)AlgorithmCombinatorial optimizationMathematicsArtificial intelligenceQuadratic assignment problemStatistics

Abstract

fetched live from OpenAlex

In this paper, we apply the Cross-Entropy optimization (CEO) to the problem of selecting k sensors from a set of m sensors for the purpose of minimizing the error in parameter estimation. The computational complexity of finding an optimal subset through exhaustive search can grow exponentially with the numbers (m and k) of sensors. The CEO is a generalized Monte Carlo technique to solve combinatorial optimization problems. The CEO method updates its parameters from the superior samples at the previous iterations. The performance of proposed CEO-based sensor selection algorithm is better than existing sensor selection algorithm, and its effectiveness is verified through simulation results.

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.006
metaresearch head score (Gemma)0.014
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: Simulation or modeling
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.006
Threshold uncertainty score0.031

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0060.014
Meta-epidemiology (narrow)0.0020.001
Meta-epidemiology (broad)0.0020.001
Bibliometrics0.0010.001
Science and technology studies0.0010.002
Scholarly communication0.0010.002
Open science0.0010.002
Research integrity0.0020.002
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.012
GPT teacher head0.254
Teacher spread0.242 · 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
GenreMethods

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

Citations41
Published2009
Admission routes1
Has abstractyes

Explore more

Same topicDistributed Sensor Networks and Detection AlgorithmsFrench-language works237,207