{"id":"W2964255032","doi":"10.1109/access.2019.2931005","title":"Scalable Distributed kNN Processing on Clustered Data Streams","year":2019,"lang":"en","type":"article","venue":"IEEE Access","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"York University","funders":"Natural Science Foundation of Shandong Province; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China; Shandong University","keywords":"Computer science; Scalability; Partition (number theory); Data stream mining; Bounded function; Data mining; Sliding window protocol; Set (abstract data type); Process (computing); Index (typography); Distributed computing; Theoretical computer science; Window (computing); Database; World Wide Web","routes":{"ca_aff":true,"ca_fund":true,"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.00131621,0.001250617,0.001966219,0.00140007,0.001211863,0.001958673,0.002766767,0.001121864,0.002518102],"category_scores_gemma":[0.006778198,0.0006449027,0.0009111722,0.003528656,0.0006501501,0.003088809,0.002325017,0.001258098,0.001108371],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001396216,"about_ca_system_score_gemma":0.001659874,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.02196998,"about_ca_topic_score_gemma":0.02634475,"domain_scores_codex":[0.9980425,0.0002343252,0.0001725502,0.0005788459,0.0006939907,0.0002778033],"domain_scores_gemma":[0.9968798,0.001028616,0.0002401386,0.0006815029,0.0009624112,0.0002074785],"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.001292022,0.0002774041,0.004363915,0.0003313972,0.0001819871,0.0005001691,0.0005439806,0.6874635,0.01634896,0.01028756,0.01116233,0.2672467],"study_design_scores_gemma":[0.0000204555,0.00002282927,0.0002411184,0.000003503437,0.000005538347,0.00002690762,0.00007594265,0.9934429,0.001436375,0.004038813,0.0006789405,0.000006723184],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06277063,0.0006438184,0.9283076,0.0004056123,0.0001749957,0.0002087855,0.001043485,0.004097025,0.002348159],"genre_scores_gemma":[0.4535021,0.0003914984,0.5375555,0.0002268589,0.0001616164,0.0002704276,0.003647552,0.0002951408,0.003949369],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02196998,"threshold_uncertainty_score":0.04368418,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0616474869040738,"score_gpt":0.3196342269281706,"score_spread":0.2579867400240968,"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."}}