{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000612309,0.000127825,0.0001286562,0.00008845748,0.0001534158,0.0004536375,0.0008687745,0.00002285258,0.00007110115],"category_scores_gemma":[0.00003906937,0.0001082936,0.00006452534,0.0002529117,0.00003299205,0.001198277,0.0002391838,0.00005599005,0.00006430846],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002111284,"about_ca_system_score_gemma":0.00002274775,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003897739,"about_ca_topic_score_gemma":0.00005874472,"domain_scores_codex":[0.9989956,0.0000574559,0.0001759595,0.0003513545,0.0001207969,0.0002988492],"domain_scores_gemma":[0.9991145,0.0002080434,0.00005473067,0.0005170144,0.00003743415,0.00006824922],"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.000003761321,0.00003601355,0.00004965639,0.0000106798,0.000009217209,8.782274e-7,0.00004684136,0.0002248175,0.0002201197,0.2828073,0.002518778,0.7140719],"study_design_scores_gemma":[0.0004269483,0.00005420359,0.0000899422,0.000006066338,0.000005618867,3.721098e-7,0.00001722599,0.6046733,0.002708496,0.001639356,0.3902286,0.0001498041],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00008926958,0.00006109848,0.9881243,0.002881983,0.0002606424,0.0002557865,0.000002233175,0.0003184173,0.008006339],"genre_scores_gemma":[0.004886472,0.000004059321,0.9907124,0.001552517,0.0002045488,0.00004935996,0.00002041674,0.00001071945,0.0025595],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7139221,"threshold_uncertainty_score":0.4416085,"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."}}