{"id":"W1993530675","doi":"10.1109/tpami.2012.170","title":"A Fast Approximate Nearest Neighbor Search Algorithm in the Hamming Space","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Pattern Analysis and Machine Intelligence","topic":"Advanced Image and Video Retrieval Techniques","field":"Computer Science","cited_by":53,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of British Columbia","funders":"","keywords":"Locality-sensitive hashing; Hamming space; Hamming distance; Hash function; k-nearest neighbors algorithm; Nearest neighbor search; Computer science; Pattern recognition (psychology); Fingerprint (computing); Hamming code; Binary number; Best bin first; Binary code; Hash table; Algorithm; 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.000706883,0.0005918993,0.001285867,0.001272263,0.000809661,0.001054878,0.001342987,0.000871281,0.004040354],"category_scores_gemma":[0.002958263,0.0004006506,0.0005325587,0.001820619,0.0004438467,0.001868679,0.00134556,0.0009274185,0.002180402],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004932809,"about_ca_system_score_gemma":0.001061507,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003163412,"about_ca_topic_score_gemma":0.002801672,"domain_scores_codex":[0.9987578,0.00021326,0.00008285607,0.0002115072,0.0006524442,0.00008209964],"domain_scores_gemma":[0.9991455,0.0002070931,0.00006676754,0.0001540859,0.0003888376,0.00003764632],"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.0003094321,0.0001245643,0.001042178,0.000232035,0.0000809866,0.0001226892,0.0001418115,0.06585539,0.02435804,0.02619032,0.006606351,0.8749362],"study_design_scores_gemma":[0.0000831883,0.0002476389,0.0006186204,0.00002595438,0.00003174664,0.0005669312,0.00007918209,0.9526951,0.01833509,0.01399505,0.01325489,0.00006659589],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006783296,0.0006111858,0.9907985,0.00006490995,0.0001240745,0.00007684451,0.00007339579,0.0005410904,0.0009267913],"genre_scores_gemma":[0.1139939,0.0005842078,0.8799216,0.00008285765,0.0001011301,0.0001784263,0.00039254,0.00008062932,0.004664701],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004040354,"threshold_uncertainty_score":0.01351637,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02746178885651555,"score_gpt":0.3043613961908752,"score_spread":0.2768996073343596,"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."}}