{"id":"W2145814045","doi":"10.1145/1097064.1097092","title":"Two ellipse-based pruning methods for group nearest neighbor queries","year":2005,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":57,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Calgary","funders":"","keywords":"Ellipse; Pruning; Tree traversal; Computer science; k-nearest neighbors algorithm; Query optimization; Rectangle; Minimum bounding box; Bounding overwatch; Point (geometry); Nearest neighbor search; k-d tree; Data mining; Algorithm; Mathematics; Artificial intelligence; Image (mathematics)","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.001795752,0.0008682085,0.001345018,0.002472734,0.0009199822,0.001244539,0.001998612,0.001278292,0.001456717],"category_scores_gemma":[0.01068847,0.0004821635,0.0007764354,0.002654714,0.0006835737,0.002825895,0.00184496,0.001078787,0.0007220292],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006522727,"about_ca_system_score_gemma":0.0009533096,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003246061,"about_ca_topic_score_gemma":0.00575794,"domain_scores_codex":[0.9964877,0.0008643576,0.0003071559,0.0003937743,0.001764145,0.0001828416],"domain_scores_gemma":[0.9952838,0.002126477,0.0005883637,0.000927383,0.0009324353,0.0001414991],"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.0005079104,0.0002933836,0.002565723,0.0003044136,0.0001100837,0.0003068107,0.0007958604,0.06273564,0.0187186,0.03012392,0.01187118,0.8716665],"study_design_scores_gemma":[0.0002713015,0.0003922507,0.002976762,0.00006711885,0.000115854,0.00215013,0.000354481,0.9030521,0.02717949,0.01829224,0.0450001,0.0001482238],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0162887,0.001848558,0.9789385,0.0002939055,0.00006208438,0.000168996,0.000100136,0.0006478565,0.001651232],"genre_scores_gemma":[0.1306945,0.001214123,0.864453,0.0001708611,0.0001366429,0.0003030018,0.0004429041,0.0001348873,0.002449994],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003246061,"threshold_uncertainty_score":0.009496987,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03042247173326711,"score_gpt":0.352553347163736,"score_spread":0.3221308754304689,"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."}}