{"id":"W2064848265","doi":"10.1007/s10115-011-0405-5","title":"Effectiveness of NAQ-tree in handling reverse nearest-neighbor queries in high-dimensional metric space","year":2011,"lang":"en","type":"article","venue":"Knowledge and Information Systems","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Pruning; Metric (unit); k-nearest neighbors algorithm; Nearest neighbor search; Euclidean distance; Tree (set theory); Data mining; Metric space; Artificial intelligence; 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.005537322,0.0006349573,0.002226665,0.001962444,0.001660213,0.00257624,0.002596058,0.002161638,0.002400784],"category_scores_gemma":[0.03102032,0.000362987,0.0006638261,0.003539188,0.0008575823,0.007635797,0.001892863,0.0008427894,0.001294542],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001244695,"about_ca_system_score_gemma":0.002816612,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01298717,"about_ca_topic_score_gemma":0.009305545,"domain_scores_codex":[0.9929304,0.002122517,0.0007361607,0.0006505718,0.003087398,0.0004731364],"domain_scores_gemma":[0.9753798,0.01451619,0.0008368762,0.004366026,0.004375579,0.0005255104],"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.004657976,0.001443617,0.0207623,0.001083378,0.0003972519,0.0004623795,0.0009573465,0.2078406,0.02084329,0.02548697,0.03828287,0.6777821],"study_design_scores_gemma":[0.0001348762,0.0002423219,0.001372998,0.00002725851,0.00006959429,0.0004979912,0.0004033179,0.9765244,0.005477645,0.01163174,0.00358561,0.00003230385],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5237954,0.009431058,0.4380031,0.002806716,0.0006923896,0.0003849169,0.001887804,0.007377165,0.01562152],"genre_scores_gemma":[0.7299175,0.001307476,0.2626583,0.0003818622,0.0001403692,0.00009286449,0.00261271,0.0002614423,0.002627485],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01298717,"threshold_uncertainty_score":0.02928448,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01414356977584011,"score_gpt":0.2202502816969014,"score_spread":0.2061067119210613,"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."}}