{"id":"W2050175694","doi":"10.1007/s10115-012-0527-4","title":"A new approach for maximizing bichromatic reverse nearest neighbor search","year":2012,"lang":"en","type":"article","venue":"Knowledge and Information Systems","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":false,"ca_institutions":"Simon Fraser University","funders":"National Natural Science Foundation of China; National Science Foundation","keywords":"k-nearest neighbors algorithm; Best bin first; Nearest neighbor search; Large margin nearest neighbor; Nearest-neighbor chain algorithm; Computer science; Nearest neighbor graph; Metric space; Metric (unit); Fixed-radius near neighbors; Algorithm; Space (punctuation); Mathematics; Data mining; Artificial intelligence; Discrete mathematics; Cluster analysis","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.0007358426,0.00009976498,0.00013574,0.0001666826,0.0001478146,0.0005628632,0.0003369793,0.00004125321,0.000005026831],"category_scores_gemma":[0.00002485276,0.000083644,0.00003053297,0.0002835173,0.00001101791,0.008684679,0.0001998227,0.00004956236,0.0003199797],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002713702,"about_ca_system_score_gemma":0.00003968754,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003185462,"about_ca_topic_score_gemma":2.757121e-7,"domain_scores_codex":[0.9991646,0.0000319903,0.0002860371,0.0001009832,0.0001478466,0.0002685242],"domain_scores_gemma":[0.9993591,0.00004388034,0.00008331051,0.0002934078,0.00007390276,0.0001463463],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000008618154,0.00007138297,0.0005260217,0.001907605,0.00006284449,2.12192e-7,0.01574341,0.00007254089,0.00001620002,0.4417636,0.1986962,0.3411314],"study_design_scores_gemma":[0.0004885456,0.00002341255,0.0003316111,0.0000403343,0.000007831654,0.000009412418,0.0006599497,0.4469224,0.00001875105,0.00001538208,0.5513446,0.0001377732],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0001400381,0.0004719938,0.9495576,0.00007064566,0.0005907592,0.0005529718,0.000006686511,0.00009239161,0.04851689],"genre_scores_gemma":[0.5731216,0.0001684597,0.4081356,0.0005066012,0.002152187,0.000368729,0.0004834361,0.00003152593,0.01503183],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5729816,"threshold_uncertainty_score":0.6296183,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03640221889120267,"score_gpt":0.2651786546214523,"score_spread":0.2287764357302497,"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."}}