{"id":"W2160152607","doi":"10.14778/1687627.1687754","title":"Efficient method for maximizing bichromatic reverse nearest neighbor","year":2009,"lang":"en","type":"article","venue":"Proceedings of the VLDB Endowment","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":129,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; k-nearest neighbors algorithm; Point (geometry); Best bin first; Exponential function; Algorithm; Exponential growth; Theoretical computer science; Mathematics; Artificial intelligence","routes":{"ca_aff":true,"ca_fund":true,"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.0006653243,0.00015014,0.0001924429,0.00009486605,0.0001523825,0.0001758173,0.001484499,0.00002654132,0.000004913277],"category_scores_gemma":[0.00009940144,0.0001026985,0.0001301104,0.0004159688,0.00002353691,0.000234822,0.0004301501,0.00006970707,0.000006988207],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005380619,"about_ca_system_score_gemma":0.00001566073,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001456355,"about_ca_topic_score_gemma":2.686304e-7,"domain_scores_codex":[0.9987003,0.000006684613,0.0002858811,0.0003376298,0.0003645704,0.0003049485],"domain_scores_gemma":[0.9992753,0.00004986282,0.0002402601,0.0002728761,0.0001051833,0.0000565302],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003504273,0.0005335892,0.0001066098,0.0003703237,0.00008671777,0.000001635318,0.001463111,0.0008019512,0.0363678,0.7219895,0.02968973,0.208554],"study_design_scores_gemma":[0.002142952,0.000513093,0.003280138,0.0003813149,0.0001333378,0.00001635071,0.0003618814,0.8581399,0.08078135,0.02961672,0.02408257,0.0005503957],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02502903,0.0002592309,0.9225783,0.02990946,0.001468002,0.003988468,0.00002602421,0.0004478864,0.01629365],"genre_scores_gemma":[0.23785,0.00001037679,0.760218,0.001074257,0.0001026116,0.00006662645,0.00000152704,0.00001157998,0.0006650704],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.857338,"threshold_uncertainty_score":0.4187925,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01458119393423405,"score_gpt":0.2572641271071092,"score_spread":0.2426829331728751,"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."}}