{"id":"W2102291279","doi":"10.1109/tvt.2009.2020802","title":"In-Network Data Reduction and Coverage-Based Mechanisms for Generating Association Rules in Wireless Sensor Networks","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Ottawa","funders":"","keywords":"Wireless sensor network; Key distribution in wireless sensor networks; Computer science; Computer network; Sensor node; Process (computing); Association rule learning; Reduction (mathematics); Visual sensor network; Quality of service; Mobile wireless sensor network; Data mining; Real-time computing; Wireless; Distributed computing; Wireless network; Telecommunications","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006767754,0.0002409864,0.0003344491,0.0005218048,0.0002337001,0.00009007061,0.0006277151,0.0005948551,0.000001440214],"category_scores_gemma":[0.00001810907,0.0002724728,0.00005207858,0.001137051,0.0000395401,0.0003381653,0.000009342855,0.000589336,0.000001898366],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002676077,"about_ca_system_score_gemma":0.00004553377,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002092441,"about_ca_topic_score_gemma":0.000136823,"domain_scores_codex":[0.9978008,0.0001382258,0.000431028,0.0008272135,0.0002219262,0.0005808151],"domain_scores_gemma":[0.9986488,0.0001868793,0.0001884562,0.0008504128,0.00007735213,0.00004811012],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000215377,0.0001480825,0.000019119,0.000005014553,0.00001372267,0.00001639411,0.00001679452,0.9520764,0.004459651,0.006110584,0.00004539605,0.03706732],"study_design_scores_gemma":[0.0009674787,0.0001773418,0.00004265205,0.00007538198,0.00001510829,0.00002123255,0.00001277455,0.9837957,0.01218088,0.002368544,0.00008213922,0.0002607587],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1148667,0.00009906317,0.880811,0.002886222,0.0006341279,0.0004074937,0.00000796538,0.0002799283,0.000007536375],"genre_scores_gemma":[0.8908833,0.00009792464,0.1084523,0.0003539583,0.0000789649,0.00006511073,0.00001867004,0.00001943459,0.0000302571],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7760167,"threshold_uncertainty_score":0.9999728,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0115567630264644,"score_gpt":0.233262881666457,"score_spread":0.2217061186399926,"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."}}