{"id":"W2077318038","doi":"10.1109/twc.2012.121412.120148","title":"STCDG: An Efficient Data Gathering Algorithm Based on Matrix Completion for Wireless Sensor Networks","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":133,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Prince Edward Island","funders":"","keywords":"Wireless sensor network; Computer science; Matrix completion; Compressed sensing; Network packet; Adaptability; Algorithm; Data collection; Data loss; Stability (learning theory); Set (abstract data type); Optimization problem; Real-time computing; Mathematics; Machine learning; Computer network","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.0009710375,0.001308771,0.001121423,0.001273769,0.000753964,0.0005743757,0.001490891,0.001005026,0.001780894],"category_scores_gemma":[0.002658763,0.0004513829,0.0007368476,0.001626524,0.0009493677,0.001629909,0.002145505,0.00212609,0.0008680683],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000694198,"about_ca_system_score_gemma":0.001819486,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004457245,"about_ca_topic_score_gemma":0.005080777,"domain_scores_codex":[0.9992177,0.0001538179,0.00004090734,0.000132828,0.0003842239,0.00007044118],"domain_scores_gemma":[0.9989333,0.0003958509,0.0001314062,0.0001815522,0.0002668431,0.00009116596],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003417224,0.0001727584,0.0005895923,0.0002353371,0.00005991983,0.0001705473,0.0002964458,0.3936656,0.03334834,0.01574088,0.01086484,0.5445139],"study_design_scores_gemma":[0.00002740027,0.00008409405,0.0001013633,0.000008175605,0.000004416326,0.00006547228,0.00002753355,0.9881741,0.004478677,0.004263431,0.002749621,0.00001577399],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003174903,0.0001453853,0.9952065,0.0001105977,0.00003723499,0.0000740182,0.00005987995,0.0008385002,0.0003529518],"genre_scores_gemma":[0.08141454,0.0002278828,0.9157864,0.0001331376,0.00004933111,0.0002414571,0.0004509614,0.0001460677,0.001550157],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004457245,"threshold_uncertainty_score":0.008862555,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06246138348487786,"score_gpt":0.3076555059859662,"score_spread":0.2451941225010884,"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."}}