{"id":"W2153841986","doi":"","title":"Upper bounds for the sensor subset selection problem","year":2009,"lang":"en","type":"article","venue":"International Conference on Information Fusion","topic":"Distributed Sensor Networks and Detection Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of British Columbia","funders":"","keywords":"Lagrangian relaxation; Upper and lower bounds; Mathematics; Mathematical optimization; Metric (unit); Selection (genetic algorithm); Optimization problem; Relaxation (psychology); Combinatorial optimization; Combinatorics; Convex optimization; Fisher information; Regular polygon; Computer science; Artificial intelligence; Statistics; Mathematical analysis","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008555409,0.002383779,0.002171034,0.001808053,0.001391202,0.00413963,0.003138028,0.002167005,0.0093384],"category_scores_gemma":[0.03968582,0.0008994619,0.001472704,0.002537209,0.00292011,0.00791439,0.004402014,0.005660657,0.001674422],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003468229,"about_ca_system_score_gemma":0.002430195,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00130025,"about_ca_topic_score_gemma":0.001091726,"domain_scores_codex":[0.9911404,0.003595579,0.0003090632,0.001124521,0.002892278,0.0009381265],"domain_scores_gemma":[0.9601393,0.0326536,0.001627647,0.001977585,0.002717108,0.0008846436],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002642607,0.0002187527,0.001277824,0.0006673169,0.0001058819,0.0002267864,0.0003599934,0.3440273,0.003952674,0.5624804,0.01261123,0.07380755],"study_design_scores_gemma":[0.00004209869,0.0001236006,0.0003706182,0.0001230558,0.00003103515,0.0001654202,0.00008320737,0.7293349,0.001634895,0.2624021,0.005658584,0.00003047304],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01004417,0.001830438,0.9728631,0.002032542,0.0001169571,0.0001035152,0.0002931179,0.0002763421,0.01243997],"genre_scores_gemma":[0.4820265,0.005816821,0.4925543,0.001774668,0.00117728,0.001329017,0.001921249,0.0008534278,0.01254673],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0093384,"threshold_uncertainty_score":0.04524589,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01965920555752451,"score_gpt":0.2644603664179974,"score_spread":0.2448011608604728,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}