{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001013138,0.00009458957,0.0002064777,0.0006573544,0.00003488927,0.00007882955,0.0002278468,0.00004525179,0.000002918218],"category_scores_gemma":[0.00006428116,0.00008234574,0.00001847888,0.0008940004,0.00002651992,0.004273344,0.0001943291,0.0000646139,0.00005445211],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003488695,"about_ca_system_score_gemma":0.00003444059,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006182879,"about_ca_topic_score_gemma":0.00004867017,"domain_scores_codex":[0.9991264,0.0001173914,0.0003610642,0.0001183471,0.0001408769,0.0001358586],"domain_scores_gemma":[0.9994262,0.0001096109,0.0001310386,0.0001999837,0.00009926773,0.00003389507],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","study_design_scores_codex":[0.0002206568,0.0004064954,0.09121481,0.005924434,0.00009145197,0.00002672451,0.02569032,0.0008184224,0.0002098135,0.7503096,0.001411017,0.1236762],"study_design_scores_gemma":[0.005377288,0.0004050879,0.6561119,0.002496955,0.00001898379,0.00001753883,0.00140054,0.3111811,0.003764705,0.0008195171,0.01763487,0.0007715062],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7567137,0.002477184,0.179114,0.00005267061,0.003189333,0.001930973,0.00002451379,0.0001790309,0.05631856],"genre_scores_gemma":[0.9983478,0.00003116623,0.001501025,0.000006313941,0.000013334,0.00002423745,0.00001340223,0.00000243026,0.00006031672],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7494901,"threshold_uncertainty_score":0.3357962,"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."}}