{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002507109,0.0001281239,0.00008269868,0.000153017,0.0003437818,0.0007787823,0.0005264968,0.00007590136,0.000124049],"category_scores_gemma":[0.00004957424,0.00009293987,0.00007958578,0.0002482582,0.00001869251,0.001361757,0.00003939821,0.0001507613,0.0001397937],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008556342,"about_ca_system_score_gemma":0.00005954677,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001123322,"about_ca_topic_score_gemma":0.000003372908,"domain_scores_codex":[0.9988804,0.00002150428,0.0003270807,0.0001558005,0.0004334542,0.0001817625],"domain_scores_gemma":[0.9988257,0.00007662259,0.0001913061,0.0001907583,0.0006629131,0.00005271844],"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.00008285748,0.00004577448,0.0000230319,0.000003014314,0.00001807607,2.618537e-7,0.00030198,0.003370728,0.000274873,0.6447366,0.01411834,0.3370245],"study_design_scores_gemma":[0.0004399134,0.0002197006,0.00127323,0.00001983364,0.000003475093,0.00001782998,0.00008015351,0.7975428,0.0005822923,0.008674473,0.1910114,0.0001349596],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00091875,0.000005075848,0.9600914,0.01498548,0.001151401,0.0004047918,0.00003221044,0.000214034,0.02219692],"genre_scores_gemma":[0.9765143,0.00007399916,0.01663045,0.005116078,0.0002918624,0.00007454775,0.000192711,0.000005066548,0.001100939],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9755956,"threshold_uncertainty_score":0.7509816,"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."}}