{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006308771,0.0001981473,0.0002427708,0.0004407059,0.0002066959,0.0001890461,0.0005868872,0.00005243248,0.00003544952],"category_scores_gemma":[0.000005270925,0.0001392382,0.0001568414,0.001759571,0.00007305828,0.0006096723,0.00001114693,0.0004153419,0.00001731424],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003226296,"about_ca_system_score_gemma":0.00001202813,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008938417,"about_ca_topic_score_gemma":0.0002366483,"domain_scores_codex":[0.9984781,0.0001539896,0.0002793964,0.0003638504,0.0003266178,0.0003981084],"domain_scores_gemma":[0.9990583,0.0001972092,0.00005967697,0.0005314254,0.00004726981,0.0001060922],"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.0000035527,0.000153721,0.0007996476,0.000008116184,0.00006062763,0.000008857496,0.001313183,0.001075947,0.0001144105,0.0001412087,0.000002729014,0.996318],"study_design_scores_gemma":[0.0001468456,0.0002187429,0.003856526,0.00005087236,0.0002298725,0.00005930201,0.0006448462,0.5502157,0.443062,0.0005088662,0.0004466839,0.0005597799],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0007136762,0.0002631145,0.9980759,0.0005255254,0.00007024704,0.0001745393,0.00001471843,0.0000780793,0.00008416751],"genre_scores_gemma":[0.9753075,0.0004797562,0.02360266,0.0004595992,0.00002834741,0.00003157445,0.000002103551,0.000009372174,0.00007909213],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9957582,"threshold_uncertainty_score":0.5677969,"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."}}