{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002978646,0.001176783,0.001841746,0.002090102,0.0009710832,0.001483731,0.00370422,0.00171887,0.003589894],"category_scores_gemma":[0.009467943,0.0007315173,0.0008486923,0.002613329,0.000979381,0.00306077,0.00315451,0.001633478,0.001395549],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009600619,"about_ca_system_score_gemma":0.001587944,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002810193,"about_ca_topic_score_gemma":0.005510249,"domain_scores_codex":[0.9969015,0.001004565,0.0001759183,0.0004786539,0.001254892,0.0001844934],"domain_scores_gemma":[0.9973215,0.0008063291,0.0001754953,0.0006057321,0.0009966777,0.00009427691],"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.0004042449,0.0002763226,0.00158168,0.0004139434,0.0001499922,0.0001160941,0.00023406,0.2356356,0.01911618,0.1319232,0.01184392,0.5983048],"study_design_scores_gemma":[0.00002593849,0.00006748514,0.0002767387,0.00002345108,0.00003541843,0.0001692446,0.00003399861,0.9572448,0.004143518,0.0326926,0.005260457,0.00002646198],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002720377,0.0002165323,0.9951918,0.00008013338,0.00004214847,0.00003721796,0.00003434721,0.0001966922,0.001480764],"genre_scores_gemma":[0.07147072,0.0002901081,0.9240741,0.0001671926,0.00009664541,0.0001415077,0.0001821685,0.0002052339,0.003372228],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00370422,"threshold_uncertainty_score":0.01575279,"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."}}